60 search results - page 7 / 12 » Pairing Functions, Boolean Evaluation and Binary Decision Di... |
78
Voted
FMCAD
2009
Springer
15 years 4 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
SCP
1998
14 years 9 months ago
1998
Interpretation Using Typed Decision Graphs Laurent Mauborgne LIENS, ´Ecole Normale Sup´erieure, 45 rue d’Ulm, 75230 Paris cedex 05, France Abstract. This article presents a way...
EVOW
2004
Springer
15 years 3 months ago
2004
Springer
Recently, an approach has been presented to minimize Disjoint Sumof-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for larg...
SAS
2004
Springer
15 years 3 months ago
2004
Springer
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
DATE
2000
IEEE
15 years 2 months ago
2000
IEEE
c Abstraction for Worst-Case Analysis of Discrete Systems Felice Balarin Cadence Berkeley Laboratories Recently, a methodology for worst-case analysis of discrete systems has been...