Modular Model Checking-Reference-Cited by-同舟云学术

Modular Model Checking

Published:1998 Issue: Volume: Page:381-401
ISSN:0302-9743
Container-title:Compositionality: The Significant Difference
language:
Short-container-title:

Author:

Kupferman Orna,Vardi Moshe Y.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-49213-5_14

Reference39 articles.

1. M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73–132, 1993.

2. Lect Notes Comput Sci;A. Aziz,1994

3. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. In Proc. 5th Symposium on Logic in Computer Science, pages 428–439, Philadelphia, June 1990.

4. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, January 1986.

5. E.M. Clarke and O. Grumberg. Research on automatic verification of finitestate concurrent systems. In Annual Review of Computer Science, volume 2, pages 269–290, 1987.

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

1. Cyber-Physical Ecosystems: Modelling and Verification;Engineering of Computer-Based Systems;2023-11-29

2. Safe Integration of Learning in SystemC using Timed Contracts and Model Checking;Proceedings of the 21st ACM-IEEE International Conference on Formal Methods and Models for System Design;2023-09-21

3. Electrical Rule Checking of Integrated Circuits using Satisfiability Modulo Theory;2023 Design, Automation & Test in Europe Conference & Exhibition (DATE);2023-04

4. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time;Proceedings of the ACM on Programming Languages;2020-01

5. Modular verification for almost-sure termination of probabilistic programs;Proceedings of the ACM on Programming Languages;2019-10-10