An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 260-277
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Decision Procedures for Set-Valued FieldsElectronic Notes in Theoretical Computer Science, 2005
- Combining Nonstably Infinite TheoriesJournal of Automated Reasoning, 2005
- Generalized typestate checking using set interfaces and pluggable analysesACM SIGPLAN Notices, 2004
- Parametric shape analysis via 3-valued logicACM Transactions on Programming Languages and Systems, 2002
- The anatomy of vampireJournal of Automated Reasoning, 1995
- Boolean unification — The story so farJournal of Symbolic Computation, 1989
- Complexity of Boolean algebrasTheoretical Computer Science, 1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- Programming by Refinement, as Exemplified by the SETL Representation SublanguageACM Transactions on Programming Languages and Systems, 1979
- An axiomatic basis for computer programmingCommunications of the ACM, 1969