Buildingsmall equality graphs for decidingequality logic with Uninterpreted Functions

Information and Computation

Volumn 204, Issue 1, 2006, Pages 26-59

  Rodeh, Yoav ^a   Strichman, Ofer ^b  

^a TEL HAI COLLEGE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER AIDED ANALYSIS; FORMAL VERIFICATION; FUNCTIONS; GRAPHIC METHODS;

BDD-BASED ENGINES; COMPUTER AIDED VERIFICATIONS; DECISION PROCEDURE; INPUT AND OUTPUTS; LOGIC OF EQUALITIES; POSITIVE EQUALITY; RANGE-ALLOCATION ALGORITHM; UNINTERPRETED FUNCTIONS;

COMPUTER CIRCUITS;

EID: 84855198108     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.08.001     Document Type: Article

References (23)

1. W. Ackermann, Solvable Cases of the Decision Problem, Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1954.
2. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, R. Sebastiani, ASAT based approach for solvingformulas over boolean and linear mathematical propositions, in: Proc. 18th International Conference on Automated Deduction (CADE'02), 2002.
3. R. Bryant, S. German, M. Velev, Exploitingpositive equality in a logic of equality with uninterpreted functions, in: Proc. 11th Intl. Conference on Computer Aided Verification (CAV'99), 1999.
4. R. Bryant, S. German, M. Velev, Processor verification usingefficient reductions of the logic of uninterpreted functions to propositional logic, ACM Transactions on Computational Logic 2(1) (2001) 1-41.
5. R. Bryant, M. Velev, Boolean satisfiability with transitivity constraints, in: E. Emerson, A. Sistla (Eds.), Proc. 12th Intl. Conference on Computer Aided Verification (CAV'00), Lecture Notes in Computer Science, vol. 1855, Springer-Verlag, Berlin, 2000.
6. R. Bryant, M. Velev, Decidinga theory of positive equality with uninterpreted functions, Tech. Rep. CMU-CS-98-141, CMU (1998).
7. R. Bryant, S. Lahiri, S. Seshia, Modelingand verifyingsystems usinga logic of counter arithmetic with lambda expressions and uninterpreted functions, in: E. Brinksma, K. Larsen (Eds.), Proc. 14th Intl. Conference on Computer Aided Verification (CAV'02), Lecture Notes in Computer Science, vol. 2404, Springer-Verlag, Copenhagen, Denmark, 2002, pp. 78-91.
8. R. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Transactions on Computers C-35(12) (1986) 1035-1044.
9. J. R. Burch, D. L. Dill, Automatic verification of pipelined microprocessor control, in: Proc. 6th Intl. Conference on Computer Aided Verification (CAV'94), Lecture Notes in Computer Science, vol. 818, Springer-Verlag, Berlin, 1994, pp. 68-80.
10. L. de Moura, H. Ruess, An experimental evaluation of ground decisionprocedures, in: Rajeev Alur, Doron Peled (Eds.), Proc. 16th Intl. Conference on Computer Aided Verification (CAV'03), Lect. Notes in Comp. Sci., Springer-Verlag, Boston, 2004.
11. J. Filliatre, S. Owre, H. Rueb, N. Shankar, ICS: integrated canonizer and solver, in: G. Berry, H. Comon, A. Finkel (Eds.), Proc. 13th Intl. Conference on Computer Aided Verification (CAV'01), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2001.
12. A. Goel, K. Sajid, H. Zhou, A. Aziz, V. Singhal, BDD based procedures for a theory of equality with uninterpreted functions, in: A. Hu, M. Vardi (Eds.), CAV98, Lecture Notes in Computer Science, vol. 1427, Springer-Verlag, Berlin, 1998.
13. S. Lahiri, R. Bryant, A. Goel, M. Talupur, Revisitingpositive equality, in: Tools and Algorithms for the Construction and Analysis of Systems TACAS 2004, Lecture Notes in Computer Science, vol. 2988, Springer-Verlag, Berlin, 2004, pp. 1-15.
14. S. K. Lahiri, S. A. Seshia, The UCLID decision procedure, in: Rajeev Alur, Doron Peled (Eds.), Proc. 16th Intl. Conference on Computer Aided Verification (CAV'03), Lect. Notes in Comp. Sci., Springer-Verlag, Boston, 2004.
15. A. Pnueli, Y. Rodeh, O. Strichman, M. Siegel, The small model property: how small can it be?, Information and computation 178(1) (2002) 279-293. (Pubitemid 35312300)
16. A. Pnueli, M. Siegel, O. Shtrichman, The code validation tool (CVT)-automatic verification of a compilation process, International Journal of Software Tools for Technology Transfer (STTT) 2(2) (1999) 192-201.
17. A. Pnueli, M. Siegel, O. Shtrichman, The code validation tool (CVT)-automatic verification of code generated from synchronous languages, in: B. Steffen (Ed.), Proc. of the Software Tools for Technology Transfer (STTT'98), 1998.
18. A. Pnueli, Y. Rodeh, O. Shtrichman, M. Siegel, Deciding equality formulas by small-domains instantiations, in: Proc. 11th Intl. Conference on Computer Aided Verification (CAV'99), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1999.
19. A. Pnueli, Y. Rodeh, O. Shtrichman, Range allocation for equivalence logic, in: Proc. 21st conferenceon Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01), Bangalore, India, 2001.
20. Y. Rodeh, O. Shtrichman, Finite instantiations in equivalence logic with uninterpreted functions, in: G. Berry, H. Comon, A. Finkel (Eds.), Proc. 13th Intl. Conference on Computer Aided Verification (CAV'01), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2001.
21. A. Stump, C. Barrett, D. Dill, CVC: a cooperatingvalidity checker, in: Proc. 14th Intl. Conference on Computer Aided Verification (CAV'02), 2002.
22. M. Velev, R. Bryant, EVC: a validity checker for the logic of equality with uninterpreted functions and memories, exploitingpositive equality, and conservative transformations, in: G. Berry, H. Comon, A. Finkel (Eds.), Proc. 13th Intl. Conference on Computer Aided Verification (CAV'01), Lecture Notes in Computer Science, vol. 2102, Springer-Verlag, Berlin, 2001, pp. 235-240. (Pubitemid 33312918)
23. M. Velev, Private communication.