- https://doi.org/10.1007/978-3-540-24597-1_34
Reasoning about Infinite State Systems Using Boolean Methods
- Jan 1, 2003
- Randal E Bryant
Abstract
The logic of Counters, Lambdas, and Uninterpreted functions (CLU) is a subset of first-order logic satisfying the twin properties that 1) the validity of a CLU formula can be decided by generating a Boolean formula and using a Boolean satisfiability (SAT) checker to show the formula is unsatisfiable, and 2) it has sufficient expressive power to construct models of a variety of interesting software and hardware systems. We describe this logic and show its modeling capabilities.
- # Infinite State Systems
- # Uninterpreted Functions
- # Boolean Methods
- # Boolean Satisfiability
- # Subset Of Logic
- # Hardware Systems
- # Modeling Capabilities
- # Satisfiability
- # Satisfiability Checker
- # Logic Of Functions
