SMT-based model checking for recursive programs
Top Cited Papers
- 1 June 2016
- journal article
- research article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 48 (3) , 175-205
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (DMS1068829)
- National Science Foundation (CNS0926181, CNS0931985)
- Gigascale Systems Research Center (1041377)
- Semiconductor Research Corporation (2005TJ1366)
- Office of Naval Research (N000141010188)
- CMU-Portugal program
- U.S. Department of War (FA8721-05-C-0003)
This publication has 27 references indexed in Scilit:
- Linear Quantifier EliminationJournal of Automated Reasoning, 2010
- Nested interpolantsACM SIGPLAN Notices, 2010
- Solving SAT and SAT Modulo TheoriesJournal of the ACM, 2006
- Analysis of recursive state machinesACM Transactions on Programming Languages and Systems, 2005
- Modular verification of software components in CIEEE Transactions on Software Engineering, 2004
- Automatic predicate abstraction of C programsACM SIGPLAN Notices, 2001
- Applying Linear Quantifier EliminationThe Computer Journal, 1993
- Program invariants as fixedpointsComputing, 1979
- Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom SystemsJournal of the ACM, 1979
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theoryThe Journal of Symbolic Logic, 1957