An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmetic operations (PA). BAPA can express the relationship between integer variables and cardinalities of sets, and supports a...
Main Authors: | Kuncak, Viktor, Nguyen, Huu Hai, Rinard, Martin |
---|---|
Other Authors: | Computer Architecture |
Language: | en_US |
Published: |
2005
|
Online Access: | http://hdl.handle.net/1721.1/30488 |
Similar Items
-
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
by: Kuncak, Viktor
Published: (2007) -
On The Boolean Algebra of Shape Analysis Constraints
by: Kuncak, Viktor, et al.
Published: (2005) -
Arithmetic version of boolean algebra
by: Azram, Mohammad, et al.
Published: (2009) -
Arithmetic version of boolean algebra
by: Azram, Mohammad, et al.
Published: (2009) -
Arithmetic version of boolean algebra
by: Azram, Mohammad, et al.
Published: (2010)