Efficient checking of behavioural relations and modal assertions using fixed-point inversion-Reference-Cited by-同舟云学术

Efficient checking of behavioural relations and modal assertions using fixed-point inversion

Published:1995 Issue: Volume: Page:142-154
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Andersen Henrik Reif,Vergauwen Bart

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60045-0_47.pdf

Reference16 articles.

1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

2. Henrik R. Andersen. Verification of Temporal Properties of Concurrent Systems. PhD thesis, Department of Computer Science, Aarhus University, Denmark, June 1993. PB–445.

3. Henrik R. Andersen. Model checking and boolean graphs. Theoretical Computer Science, 126(1):3–30, April 1994.

4. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 428–439. IEEE Computer Society Press, 1990.

5. Bard Bloom and Robert Paige. Computing ready simulations efficiently. 1992.

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

1. Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems;CONCUR 2007 – Concurrency Theory;2007

2. Distributed On-the-Fly Model Checking and Test Case Generation;Model Checking Software;2006

3. CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems;International Journal on Software Tools for Technology Transfer;2005-10-07

4. Distributed On-the-Fly Equivalence Checking;Electronic Notes in Theoretical Computer Science;2005-04

5. Efficient Diagnostic Generation for Boolean Equation Systems;Tools and Algorithms for the Construction and Analysis of Systems;2000