Using stålmarck’s algorithm to prove inequalities

Authors:
Byron Cook;Georges Gonthier
Affiliations:
Microsoft Research;Microsoft Research
Venue:
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Year:
2005

Citing 7
Cited 3

A proof engine approach to solving combinational design automation problems

Proceedings of the 39th annual Design Automation Conference
A Tutorial on Stålmarck‘s Proof Procedure for PropositionalLogic

Formal Methods in System Design - Special issue on formal methods for computer-added design
Stålmarck's Algorithm as a HOL Derived Rule

TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Recursive Learning: An Attractive Alternative to the Decision Tree for Test Genration in Digital Circuits

Proceedings of the IEEE International Test Conference on Discover the New World of Test and Design
Predicate abstraction via symbolic decision procedures

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Cogent: accurate theorem proving for program verification

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Thorough static analysis of device drivers

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
First Order Stålmarck

Journal of Automated Reasoning
A generalization of stålmarck's method

SAS'12 Proceedings of the 19th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

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.