Non-linear quantification scheduling in image computation

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2001, Pages 293-298

  Chauhan, P ^a   Clarke, E M ^a   Jha, S ^a   Kukula, J ^a   Shiple, T ^a   Veith, H ^a   Wang, D ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; HEURISTIC METHODS; TREES (MATHEMATICS);

IMAGE COMPUTATION;

IMAGE ANALYSIS;

EID: 0035212854     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Model checking of hierarchical state machines
2. Symbolic model checking using SAT procedures instead of BDDs
3. Graph-based algorithms for Boolean function manipulation
4. Representing circuits more efficiently in symbolic model checking
5. Symbolic model checking with partitioned transition relations
6. 20 states and beyond
7. Using combinatorial optimization methods for quantification scheduling
8. NuSMV: A new symbolic model verifier
9. Efficient model checking by automated ordering of transition relation partitions
10. SAT-based image computation with application in reachability analysis
11. Early quantification and partitioned transition relations
12. To split or to conjoin: The question in image computation
13. Border-block triangular form and conjunction schedule in image computation
14. Efficient BDD algorithms for FSM synthesis and verification
15. Implicit enumeration of finite state machines using BDDs