A generalization of stålmarck's method

Authors:
Aditya Thakur;Thomas Reps
Affiliations:
University of Wisconsin, Madison, WI;University of Wisconsin, Madison, WI, USA,GrammaTech., Inc., Ithaca, NY
Venue:
SAS'12 Proceedings of the 19th international conference on Static Analysis
Year:
2012

Citing 13
Cited 5

GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Improving the Results of Static Analyses Programs by Local Decreasing Iteration

Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
First Order Stålmarck

Journal of Automated Reasoning
Using stålmarck’s algorithm to prove inequalities

ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Numeric bounds analysis with conflict-driven learning

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Recursive learning: a new implication technique for efficient solutions to CAD problems-test, verification, and optimization

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A method for symbolic computation of abstract operations

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Satisfiability solvers are static analysers

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

Bilateral algorithms for symbolic abstraction

SAS'12 Proceedings of the 19th international conference on Static Analysis
Satisfiability solvers are static analysers

SAS'12 Proceedings of the 19th international conference on Static Analysis
Abstract conflict driven learning

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theory propagation and rational-trees

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Abstract satisfaction

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives an account of Stålmarck's method for validity checking of propositional-logic formulas, and explains each of the key components in terms of concepts from the field of abstract interpretation. We then use these insights to present a framework for propositional-logic validity-checking algorithms that is parametrized by an abstract domain and operations on that domain. Stålmarck's method is one instantiation of the framework; other instantiations lead to new decision procedures for propositional logic.