Verification of large state/event systems using compositionality and dependency analysis-Reference-Cited by-同舟云学术

Verification of large state/event systems using compositionality and dependency analysis

Published:1998 Issue: Volume: Page:201-216
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Lind-Nielsen JØrn,Andersen Henrik Reif,Behrmann Gerd,Hulgaard Henrik,Kristoifersen Kåre,Larsen Kim G.

Publisher

Springer Berlin Heidelberg

Link

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

Reference20 articles.

1. H. R. Andersen, J. Staunstrup, and N. Maretti. Partial model checking with ROBDDs. In E. Brinksma, editor, Proceedings of TACAS'97, volume 1217 of LNCS, pages 35–49. Springer-Verlag, April 1997.

2. H.R. Andersen. Partial model checking (extended abstract). In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 398–407, La Jolla, San Diego, 26–29 July 1995. IEEE Computer Society Press.

3. R.J. Anderson, P. Beame, S. M. Burns, W. Chan, F. Modugno, D. Notkin, and J.D. Reese. Model checking large software specifications. In D. Garlan, editor, SIGSOFT '96. Proceedings of the Fourth ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 156–66, San Francisco, 1996. ACM.

4. F. Balarin and A.L. Sangiovanni-Vincentelli. An iterative approach to language containment. In C. Courcoubetis, editor, CAV'93. 5th International Conference on Computer Aided Verification, volume 697 of LNCS, pages 29–40, Berlin, 1993. Springer-Verlag.

5. R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 8(C-35):677–691, 1986.

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

1. Randomized Refinement Checking of Timed I/O Automata;Dependable Software Engineering. Theories, Tools, and Applications;2020

2. Model Checking of UML-RT Models Using Lazy Composition;Lecture Notes in Computer Science;2013

3. Symbolic and Compositional Reachability for Timed Automata;Lecture Notes in Computer Science;2010

4. Compositional SCC Analysis for Language Emptiness;Formal Methods in System Design;2006-01

5. To Store or Not to Store;Computer Aided Verification;2003