Symmetry and induction in model checking-Reference-Cited by-同舟云学术

Symmetry and induction in model checking

Published:1995 Issue: Volume: Page:455-470
ISSN:0302-9743
Container-title:Computer Science Today
language:
Short-container-title:

Author:

Clarke E. M.,Jha S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0015260

Reference23 articles.

1. K. Apt and D. Kozen. Limits for automatic verification of finite-state systems. IPL, 15:307–309, 1986.

2. M. Browne, E. Clarke, and O. Grumberg. Characterizing finite kripke structures in propositional temporal logic. Theoretical Comput. Sci., 59:115–131, 1988.

3. M. Browne, E. Clarke, and O. Grumberg. Reasoning about networks with many identical finite-state processes. Inf. and Computation, 81(1):13–31, Apr. 1989.

4. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput, C-35(8), 1986.

5. J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill. Symbolic model checking for sequential circuit verification. To appear in IEEE Trans. Comput.-Aided Design Integrated Circuits.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. $$\mathsf {SceneChecker}$$: Boosting Scenario Verification Using Symmetry Abstractions;Computer Aided Verification;2021

2. Using Symmetry Transformations in Equivariant Dynamical Systems for Their Safety Verification;Automated Technology for Verification and Analysis;2019

3. Shape Analysis and Applications;The Compiler Design Handbook;2002-09-25

4. Parametric shape analysis via 3-valued logic;ACM Transactions on Programming Languages and Systems;2002-05

5. BDD-Nodes Can Be More Expressive;Advances in Computing Science — ASIAN’99;1999