Abstract
This paper provides a stronger result for exploiting positive equality in the logic of Equality with Uninterpreted Functions (EUF). Positive equality analysis is used to reduce the number of interpretations required to check the validity of a formula. We remove the primary restriction of the previous approach proposed by Bryant, German and VelevĀ [5], where positive equality could be exploited only when all the function applications for a function symbol appear in positive context. We show that the set of interpretations considered by our analysis of positive equality is a subset of the set of interpretations considered by the previous approach. The paper investigates the obstacles in exploiting the stronger notion of positive equality (called robust positive equality) in a decision procedure and provides a solution for it. We present empirical results on some verification benchmarks.
This research was supported in part by the Semiconductor Research Corporation, Contract RIDĀ 1029.001.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ackermann, W.: Solvable Cases of the Decision Problem. North-Holland, Amsterdam (1954)
Ball, T., Majumdar, R., Millstein, T., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: Programming Language Design and Implementation (PLDI 2001), Snowbird, Utah, (June 2001); SIGPLAN Notices, 36(5) (May 2001)
Barrett, C., Dill, D., Levitt, J.: Validity checking for combinations of theories with equality. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol.Ā 1166, pp. 187ā201. Springer, Heidelberg (1996)
Barrett, C.W., Dill, D.L., Stump, A.: Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.Ā 2404, pp. 236ā249. Springer, Heidelberg (2002)
Bryant, R.E., German, S., Velev, M.N.: Exploiting positive equality in a logic of equality with uninterpreted functions. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.Ā 1633, pp. 470ā482. Springer, Heidelberg (1999)
Bryant, R.E., German, S., Velev, M.N.: Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic. ACM Transactions on Computational LogicĀ 2(1), 1ā41 (2001)
Bryant, R.E., Lahiri, S.K., Seshia, S.A.: Modeling and Verifying Systems using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.Ā 2404, pp. 78ā92. Springer, Heidelberg (2002)
Burch, J.R., Dill, D.L.: Automated verification of pipelined microprocessor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.Ā 818, pp. 68ā80. Springer, Heidelberg (1994)
Flanagan, C., Joshi, R., Ou, X., Saxe, J.: Theorem Proving usign Lazy Proof Explication. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.Ā 2725, pp. 355ā367. Springer, Heidelberg (2003)
Goel, A., Sajid, K., Zhou, H., Aziz, A., Singhal, V.: BDD based procedures for a theory of equality with uninterpreted functions. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol.Ā 1427, pp. 244ā255. Springer, Heidelberg (1998)
Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy Abstraction. In: Launchbury, J., Mitchell, J.C. (eds.) Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages (POPL 2002), pp. 58ā70 (2002)
Lahiri, S.K.: An efficient decision procedure for the logic of Counters, Constrained Lambda expressions, Uninterpreted Functions and Ordering. Masterās thesis, ECE Department, Carnegie Mellon University (May 2001)
Lahiri, S.K., Bryant, R.E., Cook, B.: A symbolic approach to predicate abstraction. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.Ā 2725, pp. 141ā153. Springer, Heidelberg (2003)
Lahiri, S.K., Bryant, R.E., Goel, A., Talupur, M.: Revisiting positive equality. Technical Report CMU-CS-03-196, Carnegie Mellon University (November 2003)
Lahiri, S.K., Seshia, S.A., Bryant, R.E.: Modeling and verification of out-of-order microprocessors in UCLID. In: Aagaard, M.D., OāLeary, J.W. (eds.) FMCAD 2002. LNCS, vol.Ā 2517, pp. 142ā159. Springer, Heidelberg (2002)
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: 38th Design Automation Conference, DAC 2001 (2001)
Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (TOPLAS)Ā 2(1), 245ā257 (1979)
Owre, S., Rushby, J.M., Shankar, N.: PVS: A prototype verification system. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.Ā 607, Springer, Heidelberg (1992)
Pnueli, A., Rodeh, Y., Shtrichman, O., Siegel, M.: Deciding equality formulas by small-domain instantiations. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.Ā 1633, pp. 455ā469. Springer, Heidelberg (1999)
Pnueli, A., Rodeh, Y., Strichman, O., Siegel, M.: The Small Model Property: How Small Can It Be? Information and Computation. Information and ComputationĀ 178(1), 279ā293 (2002)
Rodeh, Y., Strichmann, O.: Finite Instantiations in Equivalence Logic with Uninterpreted Functions. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.Ā 2102, pp. 144ā154. Springer, Heidelberg (2001)
Shostak, R.E.: Deciding Combinations of Theories. Journal of the ACMĀ 31(1), 1ā12 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lahiri, S.K., Bryant, R.E., Goel, A., Talupur, M. (2004). Revisiting Positive Equality. In: Jensen, K., Podelski, A. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2004. Lecture Notes in Computer Science, vol 2988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24730-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-24730-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21299-7
Online ISBN: 978-3-540-24730-2
eBook Packages: Springer Book Archive