Liveness with Invisible Ranking-Reference-Cited by-同舟云学术

Liveness with Invisible Ranking

Published:2004 Issue: Volume: Page:223-238
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fang Yi,Piterman Nir,Pnueli Amir,Zuck Lenore

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24622-0_19

Reference23 articles.

1. Apt, K.R., Kozen, D.: Limits for automatic program verification of finite-state concurrent systems. Information Processing Letters 22(6) (1986)

2. Lecture Notes in Computer Science;T. Arons,2001

3. Baukus, K., Lakhnesche, Y., Stahl, K.: Verification of parameterized protocols. Journal of Universal Computer Science 7(2), 141–158 (2001)

4. Bjørner, N., Browne, I., Chang, E., Colón, M., Kapur, A., Manna, Z., Sipma, H., Uribe, T.: STeP: The Stanford Temporal Prover, User’s Manual. Technical Report STAN-CS-TR-95-1562, Computer Science Department, Stanford University (1995)

5. Lecture Notes in Computer Science;N. Bjørner,1995

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

1. Toward Liveness Proofs at Scale;Lecture Notes in Computer Science;2024

2. Compositional Verification of Smart Contracts Through Communication Abstraction;Static Analysis;2021

3. Parameterized Synthesis with Safety Properties;Programming Languages and Systems;2020

4. Proving Liveness of Parameterized Programs;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05

5. Parameterized Compositional Model Checking;Tools and Algorithms for the Construction and Analysis of Systems;2016