Using Stålmarck’s Algorithm to Prove Inequalities
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 330-344
- https://doi.org/10.1007/11576280_23
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Recursive Learning: An attractive alternative to the decision tree for test generation in digital ciPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Predicate Abstraction via Symbolic Decision ProceduresPublished by Springer Nature ,2005
- Cogent: Accurate Theorem Proving for Program VerificationPublished by Springer Nature ,2005
- Refining Approximations in Software Predicate AbstractionPublished by Springer Nature ,2004
- Zapato: Automatic Theorem Proving for Predicate Abstraction RefinementPublished by Springer Nature ,2004
- A Symbolic Approach to Predicate AbstractionPublished by Springer Nature ,2003
- A proof engine approach to solving combinational design automation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Construction of abstract state graphs with PVSPublished by Springer Nature ,1997
- Stålmarck’s algorithm as a HOL derived rulePublished by Springer Nature ,1996