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 28 matches
- 2019
- Étienne André, Benoît Delahaye, Paulin Fournier, Didier Lime:
Parametric Timed Broadcast Protocols. VMCAI 2019: 491-512 - Étienne André, Laurent Fribourg, Jean-Marc Mota, Romain Soulat:
Verification of an Industrial Asynchronous Leader Election Algorithm Using Abstractions and Parametric Model Checking. VMCAI 2019: 409-424 - Clément Ballabriga, Julien Forget, Laure Gonnord, Giuseppe Lipari, Jordy Ruiz:
Static Analysis of Binary Code with Memory Indirections Using Polyhedra. VMCAI 2019: 114-135 - Quentin Bouillaguet, François Bobot, Mihaela Sighireanu, Boris Yakobowski:
Exploiting Pointer Analysis in Memory Models for Deductive Verification. VMCAI 2019: 160-182 - Rémy Boutonnet, Nicolas Halbwachs:
Disjunctive Relational Abstract Interpretation for Interprocedural Program Analysis. VMCAI 2019: 136-159 - Denis Bueno, Karem A. Sakallah:
euforia: Complete Software Model Checking with Uninterpreted Functions. VMCAI 2019: 363-385 - Normann Decker, Anton Pirogov:
Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic. VMCAI 2019: 513-534 - Grigory Fedyukovich, Arie Gurfinkel, Aarti Gupta:
Lazy but Effective Functional Synthesis. VMCAI 2019: 92-113 - Gereon Fox, Daniel Stan, Holger Hermanns:
Syntactic Partial Order Compression for Probabilistic Reachability. VMCAI 2019: 446-467 - Hongfei Fu, Krishnendu Chatterjee:
Termination of Nondeterministic Probabilistic Programs. VMCAI 2019: 468-490 - Kimball Germane, Jay McCarthy, Michael D. Adams, Matthew Might:
Demand Control-Flow Analysis. VMCAI 2019: 226-246 - Kimball Germane, Matthew Might:
Relatively Complete Pushdown Analysis of Escape Continuations. VMCAI 2019: 205-225 - Stefan Haar, Juraj Kolcák, Loïc Paulevé:
Combining Refinement of Parametric Models with Goal-Oriented Reduction of Dynamics. VMCAI 2019: 555-576 - Jad Hamza, Viktor Kuncak:
Minimal Synthesis of String to String Functions from Examples. VMCAI 2019: 48-69 - Jochen Hoenicke, Tanja Schindler:
Solving and Interpolating Constant Arrays Based on Weak Equivalences. VMCAI 2019: 297-317 - Richard Huybers, Alfons Laarman:
A Parallel Relation-Based Algorithm for Symbolic Bisimulation Minimization. VMCAI 2019: 535-554 - Anja F. Karl, Robert Schilling, Roderick Bloem, Stefan Mangard:
Small Faults Grow Up - Verification of Error Masking Robustness in Arithmetically Encoded Programs. VMCAI 2019: 183-204 - Nuno P. Lopes, Andrey Rybalchenko:
Fast BGP Simulation of Large Datacenters. VMCAI 2019: 386-408 - Tianhan Lu, Pavol Cerný, Bor-Yuh Evan Chang, Ashutosh Trivedi:
Type-Directed Bounding of Collections in Reactive Programs. VMCAI 2019: 275-296 - Charlie Murphy, Zachary Kincaid:
A Practical Algorithm for Structure Embedding. VMCAI 2019: 342-362 - Thanh-Toan Nguyen, Quang-Trung Ta, Wei-Ngan Chin:
Automatic Program Repair Using Formal Verification and Expression Templates. VMCAI 2019: 70-91 - Jens Nicolay, Quentin Stiévenart, Wolfgang De Meuter, Coen De Roover:
Effect-Driven Flow Analysis. VMCAI 2019: 247-274 - Viorel Preoteasa, Iulia Dragomir, Stavros Tripakis:
Mechanically Proving Determinacy of Hierarchical Block Diagram Translations. VMCAI 2019: 577-600 - Xiaokang Qiu, Yanjun Wang:
A Decidable Logic for Tree Data-Structures with Measurements. VMCAI 2019: 318-341 - Azalea Raad, Ori Lahav, Viktor Vafeiadis:
On the Semantics of Snapshot Isolation. VMCAI 2019: 1-23 - Calvin Smith, Aws Albarghouthi:
Program Synthesis with Equivalence Reduction. VMCAI 2019: 24-47 - Tomoya Yamaguchi, Martin Brain, Chirs Ryder, Yosikazu Imai, Yoshiumi Kawamura:
Application of Abstract Interpretation to the Automotive Electronic Control System. VMCAI 2019: 425-445 - Constantin Enea, Ruzica Piskac:
Verification, Model Checking, and Abstract Interpretation - 20th International Conference, VMCAI 2019, Cascais, Portugal, January 13-15, 2019, Proceedings. Lecture Notes in Computer Science 11388, Springer 2019, ISBN 978-3-030-11244-8 [contents]
loading more results
failed to load more results, please try again later
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-10-20 11:50 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