Property checking via structural analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2404, Issue , 2002, Pages 151-165

  Baumgartner, Jason ^a   Kuehlmann, Andreas ^b   Abraham, Jacob ^c  

^a IBM   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

OVERALL EFFICIENCY; PREIMAGE COMPUTATION; RESOURCE LIMITATIONS; STATE-TRANSITION DIAGRAMS; SYMBOLIC REACHABILITY ANALYSIS; UNFOLDING TECHNIQUES; VERIFICATION FRAMEWORK; VERIFICATION PROBLEMS;

COMPUTER AIDED ANALYSIS;

EID: 84937580823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_12     Document Type: Conference Paper

References (16)

1. Armin Biere, Alessandro Cimatti, Edmund M. Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems, March 1999.
2. J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design, 13(4), April 1994.
3. H. Cho, G. Hachtel, E. Macii, B. Pleisser, and F. Somenzi. Algorithms for approximate FSM traversal based on state space decomposition. IEEE Transactions on Computer-Aided Design, 15(12), Dec. 1996.
4. O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines using Boolean functional vectors. In IMEC-IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, Nov. 1989.
5. Luca de Alfaro, Thomas A. Henzinger, and Freddy Y. C. Mang. Detecting errors before reaching them. In Computer-Aided Verification, July 2000.
6. Thomas Filkorn. Functional extensions of symbolic model checking. In Computer-Aided Verification, June 1991.
7. Malay K. Ganai. Algorithms for Efficient State Space Search. PhD thesis, University of Texas at Austin, 2001.
8. Youpyo Hong, Peter A. Beerel, Jerry R. Burch, and Kenneth L. McMillan. Safe BDD minimization using don’t cares. In Proc. 34th ACM/IEEE Design Automation Conference, June 1997.
9. Andreas Kuehlmann and Jason Baumgartner. Transformation-based verification using generalized retiming. In Computer-Aided Verification, July 2001.
10. Andreas Kuehlmann, Malay K. Ganai, and Viresh Paruthi. Circuit-based Boolean reasoning. In Proc. 38th ACM/IEEE Design Automation Conference, June 2001.
11. Robert P. Kurshan. Computer-Aided Verification ofCo ordinating Processes. Princeton University Press, 1994. 152, 157
12. In-Ho Moon, Gary D. Hachtel, and Fabio Somenzi. Border-block triangular form and conjunction schedule in image computation. In Formal Methods in Computer-Aided Design, Nov. 2000.
13. Mary Sheeran, Satnam Singh, and Gunnar Stalmarck. Checking safety properties using induction and a SAT-solver. In Formal Methods in Computer-Aided Design, Nov. 2000.
14. Poul F. Williams, Armin Biere, Edmund M. Clarke, and Anubhav Gupta. Combining decision diagrams and SAT procedures for efficient symbolic model checking. In Computer-Aided Verification, July 2000.
15. C. Han Yang and David L. Dill. Validation with guided search of the state space. In Proc. 35th ACM/IEEE Design Automation Conference, June 1998.
16. Jun Yuan, Jian Shen, Jacob Abraham, and Adnan Aziz. On combining formal and informal verification. In Computer-Aided Verification, June 1997.