![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 33 matches
- 2012
- Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding. ATVA 2012: 152-166 - Bernd Becker
, Rüdiger Ehlers
, Matthew Lewis, Paolo Marin:
ALLQBF Solving by Computational Learning. ATVA 2012: 370-384 - Benedikt Bollig, Paul Gastin, Benjamin Monmege
, Marc Zeitoun
:
A Probabilistic Kleene Theorem. ATVA 2012: 400-415 - Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data. ATVA 2012: 167-182 - Peter E. Bulychev, Franck Cassez
, Alexandre David, Kim Guldstrand Larsen
, Jean-François Raskin, Pierre-Alain Reynier:
Controllers with Minimal Observation Power (Application to Timed Systems). ATVA 2012: 223-237 - Sofia Cassel, Bengt Jonsson, Falk Howar
, Bernhard Steffen:
A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations. ATVA 2012: 57-71 - Krishnendu Chatterjee, Martin Chmelik, Rupak Majumdar:
Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games. ATVA 2012: 385-399 - Alexandre Donzé, Oded Maler, Ezio Bartocci
, Dejan Nickovic, Radu Grosu, Scott A. Smolka:
On Temporal Logic and Signal Processing. ATVA 2012: 92-106 - Sami Evangelista, Alfons Laarman
, Laure Petrucci
, Jaco van de Pol:
Improved Multi-Core Nested Depth-First Search. ATVA 2012: 269-283 - John Fearnley, Doron A. Peled, Sven Schewe
:
Synthesis of Succinct Systems. ATVA 2012: 208-222 - Luis María Ferrer Fioriti, Ernst Moritz Hahn, Holger Hermanns, Björn Wachter:
Variable Probabilistic Abstraction Refinement. ATVA 2012: 300-316 - Vojtech Forejt, Marta Z. Kwiatkowska, David Parker
:
Pareto Curves for Probabilistic Model Checking. ATVA 2012: 317-332 - Carlo A. Furia:
A Verifier for Functional Properties of Sequence-Manipulating Programs. ATVA 2012: 183-186 - Andreas Gaiser, Jan Kretínský, Javier Esparza
:
Rabinizer: Small Deterministic Automata for LTL(F, G). ATVA 2012: 72-76 - Sergio Giro, Markus N. Rabe:
Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements. ATVA 2012: 333-348 - Orna Grumberg, Orna Kupferman, Sarai Sheinvald:
Model Checking Systems and Specifications with Parameterized Atomic Propositions. ATVA 2012: 122-136 - Matthias Güdemann
, Gwen Salaün, Meriem Ouederni:
Counterexample Guided Synthesis of Monitors for Realizability Enforcement. ATVA 2012: 238-253 - Ashutosh Gupta:
Improved Single Pass Algorithms for Resolution Proof Reduction. ATVA 2012: 107-121 - Shulamit Halamish, Orna Kupferman:
Approximating Deterministic Lattice Automata. ATVA 2012: 27-41 - Hossein Hojjat, Radu Iosif, Filip Konecný, Viktor Kuncak, Philipp Rümmer:
Accelerating Interpolants. ATVA 2012: 187-202 - Nils Jansen
, Erika Ábrahám
, Matthias Volk, Ralf Wimmer, Joost-Pieter Katoen
, Bernd Becker
:
The COMICS Tool - Computing Minimal Counterexamples for DTMCs. ATVA 2012: 349-353 - Daniel Neider
:
Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers. ATVA 2012: 354-369 - Sucheendra K. Palaniappan
, P. S. Thiagarajan:
Dynamic Bayesian Networks: A Factored Model of Probabilistic Dynamics. ATVA 2012: 17-25 - Paritosh K. Pandya, Simoni S. Shah:
The Unary Fragments of Metric Interval Temporal Logic: Bounded versus Lower Bound Constraints. ATVA 2012: 77-91 - Andreas Podelski:
Interpolant Automata - (Invited Talk). ATVA 2012: 26 - Rodrigo T. Saad
, Silvano Dal-Zilio
, Bernard Berthomieu:
An Experiment on Parallel Model Checking of a CTL Fragment. ATVA 2012: 284-299 - Mohamed Amin Ben Sassi, Romain Testylier, Thao Dang, Antoine Girard
:
Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations. ATVA 2012: 137-151 - Sven Schewe
, Thomas Varghese:
Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata. ATVA 2012: 42-56 - Daniel Schwartz-Narbonne, Georg Weissenbacher
, Sharad Malik:
Parallel Assertions for Architectures with Weak Memory Models. ATVA 2012: 254-268 - Ondrej Sery, Grigory Fedyukovich
, Natasha Sharygina:
FunFrog: Bounded Model Checking with Interpolation-Based Function Summarization. ATVA 2012: 203-207
skipping 3 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-03 21:14 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint