default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFormal Methods in System Design, Volume 57
Volume 57, Number 1, July 2021
- Hana Chockler
, Georg Weissenbacher:
Preface of the special issue on the conference on computer-aided verification 2018. 1-2 - Camille Coti, Laure Petrucci, César Rodríguez, Marcelo Sousa:
Quasi-optimal partial order reduction. 3-33 - Byron Cook, Kareem Khazem, Daniel Kroening, Serdar Tasiran, Michael Tautschnig, Mark R. Tuttle:
Model checking boot code from AWS data centers. 34-52 - S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah:
Boolean functional synthesis: hardness and practical algorithms. 53-86 - Aina Niemetz, Mathias Preiner, Andrew Reynolds, Clark W. Barrett, Cesare Tinelli:
On solving quantified bit-vector constraints using invertibility conditions. 87-115 - Kim G. Larsen, Natarajan Shankar, Pierre Wolper, Somesh Jha:
2018 CAV award. 116-117
Volume 57, Number 2, August 2021
- Nikolaj S. Bjørner, Arie Gurfinkel:
Preface of the special issue on the conference on formal methods in computer aided design 2018. 119-120 - Peter Backeman, Philipp Rümmer, Aleksandar Zeljic:
Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic. 121-156 - Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations. 157-177 - Alberto Griggio, Marco Roveri, Stefano Tonetta:
Certifying proofs for SAT-based model checking. 178-210 - Bjørnar Luteberget, Koen Claessen, Christian Johansen, Martin Steffen:
SAT modulo discrete event simulation applied to railway design capacity analysis. 211-245 - Oded Padon, Jochen Hoenicke, Kenneth L. McMillan, Andreas Podelski, Mooly Sagiv, Sharon Shoham:
Temporal prophecy for proving temporal properties of infinite-state systems. 246-269 - Thomas Pani, Georg Weissenbacher, Florian Zuleger:
Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. 270-302
Volume 57, Number 3, September 2021
- Daryl Stewart, Georg Weissenbacher:
Preface of the special issue on the Conference on Formal Methods in Computer-Aided Design 2017. 303-304 - Michael Blondin, Javier Esparza, Stefan Jaax, Philipp J. Meyer:
Towards efficient verification of population protocols. 305-342 - Hugo Illous, Matthieu Lemerre, Xavier Rival:
A relational shape abstract domain. 343-400 - Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster algorithms for quantitative verification in bounded treewidth graphs. 401-428 - Min-Hsien Weng, Robi Malik, Mark Utting:
Automatic proofs of memory deallocation for a Whiley-to-C Compiler. 429-472 - Roderick Bloem, Hana Chockler, Masoud Ebrahimi, Ofer Strichman:
Vacuity in synthesis. 473-495
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 2025-12-05 22:25 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:
