Non-linear quantification scheduling in image computation

Authors:
Pankaj Chauhan;Edmund M. Clarke;Somesh Jha;Jim Kukula;Tom Shiple;Helmut Veith;Dong Wang
Affiliations:
Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University, Pittsburgh, PA;University of Wisconsin, Madison, WI;Synopsys Inc., Beverton, OR;Synopsys Inc., Beverton, OR;TU Vienna, Austria;Carnegie Mellon University, Pittsburgh, PA
Venue:
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Year:
2001

Citing 13
Cited 11

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Representing circuits more efficiently in symbolic model checking

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Model checking of hierarchical state machines

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Symbolic model checking using SAT procedures instead of BDDs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Model checking

Model checking
To split or to conjoin: the question in image computation

Proceedings of the 37th Annual Design Automation Conference
Symbolic Model Checking

Symbolic Model Checking
Early Quantification and Partitioned Transition Relations

ICCD '96 Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors
SAT-Based Image Computation with Application in Reachability Analysis

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Border-Block Triangular Form and Conjunction Schedule in Image Computation

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Efficient Model Checking by Automated Ordering of Transition Relation Partitions

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Optimizing model checking based on bdd characterization

Optimizing model checking based on bdd characterization

Partition-based decision heuristics for image computation using SAT and BDDs

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Checking satisfiability of a conjunction of BDDs

Proceedings of the 40th annual Design Automation Conference
The Compositional Far Side of Image Computation

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Efficient Solution of Language Equations Using Partitioned Representations

Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Disjunctive image computation for software verification

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Integrating CSP decomposition techniques and BDDs for compiling configuration problems

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A model for integrating dialogue and the execution of joint plans

ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems
Efficient guided symbolic reachability using reachability expressions

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Computing argumentation in polynomial number of BDD operations: a preliminary report

ArgMAS'10 Proceedings of the 7th international conference on Argumentation in Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing the set of states reachable in one step from a given set of states, i.e. image computation, is a crucial step in several symbolic verification algorithms, including model checking and reachability analysis. So far, the best methods for quantification scheduling in image computation, with a conjunctively partitioned transition relation, have been restricted to a linear schedule. This results in a loss of flexibility during image computation. We view image computation as a problem of constructing an optimal parse tree for the image set. The optimality of a parse tree is defined by the largest BDD that is encountered during the computation of the tree. We present dynamic and static versions of a new algorithm, VarScore, which exploits the flexibility offered by the parse tree approach to the image computation. We show by extensive experimentation that our techniques outperform the best known techniques so far.