Symbolic model checking with rich assertional languages-Reference-Cited by-同舟云学术

Symbolic model checking with rich assertional languages

Published:2001-04 Issue:1-2 Volume:256 Page:93-112
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Kesten Y.,Maler O.,Marcus M.,Pnueli A.,Shahar E.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference31 articles.

1. Limits for automatic program verification of finite-state concurrent systems;Apt;Inform. Process. Lett.,1986

2. Hardware verification using 2nd-order logic;Basin,1995

3. String-Rewriting Systems;Book,1993

4. A. Bouajjani, O. Maler, Reachability analysis of push-down automata, Workshop on Infinite-state systems, Pisa, 1996.

5. M.C. Browne, E.M. Clarke, O. Grumberg, Reasoning about networks with many finite state processes, Proc. 5th ACM Symp. Princ. of Dist. Comp., 1986, pp. 240–248.

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

1. A symbolic algorithm for the case-split rule in solving word constraints with extensions;Journal of Systems and Software;2023-07

2. Verification of component-based systems with recursive architectures;Theoretical Computer Science;2023-01

3. Parameterized Verification under TSO with Data Types;Tools and Algorithms for the Construction and Analysis of Systems;2023

4. Computing Parameterized Invariants of Parameterized Petri Nets;Fundamenta Informaticae;2022-10-19

5. Parameterized verification of systems with component identities, using view abstraction;International Journal on Software Tools for Technology Transfer;2022-02-26