Abstract
Stålmarck’s 1-saturation algorithm is an incomplete but fast method for computing partial equivalence relations over propositional formulae. Aside from anecdotal evidence, until now little has been known about what it can prove. In this paper we characterize a set of formulae with bitvector-inequalities for which 1-saturation is sufficient to prove unsatisfiability. This result has application to fast predicate abstraction for software with fixed-width bit-vectors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andersson, G., Bjesse, P., Cook, B., Hanna, Z.: A proof engine approach to solving combinational design automation problems. In: 2002 Design Automation Conference (2002)
Ball, T., Cook, B., Das, S., Rajamani, S.K.: Refining approximations in software predicate abstraction. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 388–403. Springer, Heidelberg (2004)
Ball, T., Cook, B., Lahiri, S.K., Zhang, L.: Zapato: Automatic theorem proving for predicate abstraction refinement. In: CAV 2004: International Conference on Computer-Aided Verification (2004)
Cook, B., Kroening, D., Sharygina, N.: Cogent: Accurate theorem proving for program verification. To appear at CAV 05: Conference on Computer Aided Verification (2005)
Davey, B.A., Priestley, H.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)
Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: CAV 1997: Conference on Computer Aided Verification (1997)
Harrison, J.: Stålmarck’s method as a HOL derived rule. In: TPHOLs 1996: International Conference on Theorem Proving in Higher Order Logics (1996)
Kunz, W., Pradhan, D.K.: Recursive learning: An attractive alternative to the decision tree for test generation in digital circuits. In: ITC 1992: International Test Conference (1992)
Lahiri, S.K., Ball, T., Cook, B.: Predicate abstraction via symbolic decision procedures. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 24–38. Springer, Heidelberg (2005)
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)
Microsoft Corporation. Static Driver Verifier, Available at http://www.microsoft.com/whdc/devtools/tools/SDV.mspx
Sheeran, M., Stålmarck, G.: A tutorial on Stålmarck’s proof procedure for propositional logic. Formal Methods in System Design 16(1) (January 000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cook, B., Gonthier, G. (2005). Using Stålmarck’s Algorithm to Prove Inequalities. In: Lau, KK., Banach, R. (eds) Formal Methods and Software Engineering. ICFEM 2005. Lecture Notes in Computer Science, vol 3785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576280_23
Download citation
DOI: https://doi.org/10.1007/11576280_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29797-0
Online ISBN: 978-3-540-32250-4
eBook Packages: Computer ScienceComputer Science (R0)