Abstractions from proofs
Top Cited Papers
- 1 January 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 39 (1) , 232-244
- https://doi.org/10.1145/964001.964021
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Polymorphic predicate abstractionACM Transactions on Programming Languages and Systems, 2005
- Extreme Model CheckingPublished by Springer Nature ,2003
- Interpolation and SAT-Based Model CheckingPublished by Springer Nature ,2003
- Predicate Abstraction with Minimum PredicatesPublished by Springer Nature ,2003
- Lower bounds for resolution and cutting plane proofs and monotone computationsThe Journal of Symbolic Logic, 1997
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmeticThe Journal of Symbolic Logic, 1997
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- A General Axiom of AssignmentPublished by Springer Nature ,1982
- Correctness of a compiler for arithmetic expressionsProceedings of Symposia in Applied Mathematics, 1967
- Linear reasoning. A new form of the Herbrand-Gentzen theoremThe Journal of Symbolic Logic, 1957