The small model property: How small can it be?

Information and Computation

Volumn 178, Issue 1, 2002, Pages 279-293

  Pnueli, Amir ^a   Rodeh, Yoav ^a   Strichman, Ofer ^a   Siegel, Michael ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Compiler verification; Equality logic; Finite instantiation; Range allocation; Translation validation; Uninterpreted functions

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; DECISION THEORY; DIGITAL ARITHMETIC; GRAPH THEORY; MATHEMATICAL MODELS; PROGRAM COMPILERS; SEMANTICS; STATE SPACE METHODS; THEOREM PROVING;

COMPILER VERIFICATION; EQUALITY LOGIC; FINITE INSTANTIATION; RANGE ALLOCATION; TRANSLATION VALIDATION; UNINTERPRETED FUNCTIONS;

BOOLEAN FUNCTIONS;

EID: 0037057861     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(02)93175-5     Document Type: Article

References (13)

1. Ackermann, W. (1954), "Solvable Cases of the Decision Problem," Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam.
2. Bryant, R. E., Lahiri, S. K., and Seshia, S. A. (2002), Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions, in "Proc. Computer-Aided Verification (CAV'02)" (E. Brinksma and K. G. Larsen, Eds.), Lecture Notes in Computer Science, Vol. 2404, pp. 78-91, Springer-Verlag, Copenhagen.
3. Bryant, R. E. (1986), Graph-based algorithms for Boolean function manipulation, IEEE Trans. Comput. 35, 1035-1044.
4. Bryant, R. E., German, S., and Velev, M. (1999), Exploiting positive equality in a logic of equality with uninterpreted functions, in "Proc. 11th Intl. Conference on Computer Aided Verification (CAV'99)."
5. Bryant, R. E., German, S., and Velev, M. (2001), Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic, ACM Trans. Comput. Logic 2, 1-41.
6. Bryant, R. E., and Velev, M. (2000), Boolean satisfiability with transitivity constraints, in "Proc. 12th Intl. Conference on Computer Aided Verification (CAV'00)" (E. A. Emerson and A. P. Sistla, Eds.), Lecture Notes in Computer Science, Vol. 1855, Springer-Verlag, Berlin.
7. The Sacres Consortium (1995), "Safety Critical Embedded Systems: From Requirements to System Architecture," Esprit Project Description EP 20.897, available at http://www.tni.fr/sacres.
8. Cyrluk, D., Lincoln, P., and Shankar, N. (1996), On Shostak's decision procedure for combinations of theories, in "Automated Deduction-CADE-13, New Brunwick, NJ" (M. A. McRobbie and J. K. Slaney, Eds.), Lecture Notes in Artificial Intelligence, Vol. 1104, pp. 463-477, Springer-Verlag, Berlin.
9. Goel, A., Sajid, K., Zhou, H., Aziz, A., and Singhal, V. (1998), BDD based procedures for a theory of equality with uninterpreted functions, in "CAV98" (A. J. Hu and M. Y. Vardi, Eds.), Lecture Notes in Computer Science, Vol. 1427, Springer-Verlag, Berlin.
10. Pnueli, A., Siegel, M., and Shtrichman, O. (1998), Translation validation for synchronous languages, in "Proc. 25th Int. Colloq. Aut. Lang. Prog." (K. G. Larsen, S. Skyum, and G. Winskel, Eds.), Lecture Notes in Computer Science, Vol. 1443, pp. 235-246, Springer-Verlag, Berlin.
11. Pnueli, A., Siegel, M., and Shtrichman, O. (1998), The code validation tool (CVT)-automatic verification of a compilation process, Int. J. Software Tools Technol. Transfer (STTT) 2(2), 192-201.
12. Shankar, N., Owre, S., and Rushby, J. M. (1993), "The PVS Proof Checker: A Reference Manual (Draft)," Technical report, Comp. Sci., Laboratory, SRI International, Menlo Park, CA.
13. Strichman, O., Benchmarks for satisfiability checking in the theory of equality with uninterpreted functions, available at www.cs.cmu.edu/˜ofers/sat/bench.htm.