38 search results - page 3 / 8 » Hybrid Booleans |
DAC
2003
ACM
15 years 10 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
CAV
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) ...
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...
TACAS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
136
click to vote
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...