default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15. VMCAI 2014: an Diego, CA, USA
- Kenneth L. McMillan, Xavier Rival:
Verification, Model Checking, and Abstract Interpretation - 15th International Conference, VMCAI 2014, San Diego, CA, USA, January 19-21, 2014, Proceedings. Lecture Notes in Computer Science 8318, Springer 2014, ISBN 978-3-642-54012-7 - Roderick Bloem
, Robert Könighofer, Martina Seidl:
SAT-Based Synthesis Methods for Safety Specs. 1-20 - Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Kalmer Apinis:
Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs. 21-38 - Antoine Miné:
Relational Thread-Modular Static Value Analysis by Abstract Interpretation. 39-58 - Andreas Gustavsson, Jan Gustafsson, Björn Lisper:
Timing Analysis of Parallel Software Using Abstract Execution. 59-77 - Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday Equilibria for Omega-Regular Games. 78-97 - Lei Song, Lijun Zhang, Jens Chr. Godskesen:
Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes. 98-117 - Dileep Kini, Mahesh Viswanathan:
Probabilistic Automata for Safety LTL Specifications. 118-136 - Bor-Yuh Evan Chang:
Refuting Heap Reachability. 137-141 - Wei Wang, Clark W. Barrett, Thomas Wies:
Cascade 2.0. 142-160 - Cezara Dragoi, Thomas A. Henzinger, Helmut Veith, Josef Widder, Damien Zufferey:
A Logic-Based Framework for Verifying Consensus Algorithms. 161-181 - Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Verifying Array Programs by Transforming Verification Conditions. 182-202 - Nuno P. Lopes, José Monteiro:
Weakest Precondition Synthesis for Compiler Optimizations. 203-221 - Loïg Jezequel, Javier Esparza:
Message-Passing Algorithms for the Verification of Distributed Protocols. 222-241 - Marius Bozga, Radu Iosif, Filip Konecný:
Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops. 242-261 - Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin:
Parameterized Model Checking of Token-Passing Systems. 262-281 - Zhoulai Fu:
Modularly Combining Numeric Abstract Domains with Points-to Analysis, and a Scalable Static Numeric Analyzer for Java. 282-301 - Pietro Ferrara:
Generic Combination of Heap and Value Analyses in Abstract Interpretation. 302-321 - Vicente Acuña, Andrés Aravena, Alejandro Maass, Anne Siegel:
Modeling Parsimonious Putative Regulatory Networks: Complexity and Heuristic Approach. 322-336 - Anthony Romano:
Practical Floating-Point Tests with Integer Code. 337-356 - Peter Faymonville, Bernd Finkbeiner, Doron A. Peled:
Monitoring Parametric Temporal Logic. 357-375 - Chao Wang, Kevin Hoang:
Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability. 376-394 - Rohit Singh, Rishabh Singh, Zhilei Xu, Rebecca Krosnick, Armando Solar-Lezama:
Modular Synthesis of Sketches Using Models. 395-414 - Rüdiger Ehlers, Sanjit A. Seshia, Hadas Kress-Gazit:
Synthesis with Identifiers. 415-433 - Jan Leike, Ashish Tiwari:
Synthesis for Polynomial Lasso Programs. 434-452 - Damien Massé:
Policy Iteration-Based Conditional Termination and Ranking Functions. 453-471 - Ben Hardekopf, Ben Wiedermann, Berkeley R. Churchill, Vineeth Kashyap:
Widening for Control-Flow. 472-491
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.
last updated on 2026-03-04 23:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
