Parameterized Verification by Probabilistic Abstraction-Reference-Cited by-同舟云学术

Parameterized Verification by Probabilistic Abstraction

Published:2003 Issue: Volume: Page:87-102
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Pnueli Amir,Zuck Lenore

Publisher

Springer Berlin Heidelberg

Link

https://link.springer.com/content/pdf/10.1007/3-540-36576-1_6

Reference32 articles.

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

2. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In Proc. 13 thIntl. Conference on Computer Aided Verification (CAV’01), volume 2102 ofLect. Notes in Comp. Sci., Springer-Verlag, pages 221–234, 2001.

3. T. Arons, A. Pnueli, and L. Zuck. Verification by probabilistic abstraction. Weizmann Institute of Science Technical Report, 2003.

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

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

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

1. Invisible Invariants Are Neither;From Reactive Systems to Cyber-Physical Systems;2019

2. On the hardness of analyzing probabilistic programs;Acta Informatica;2018-05-15

3. $$P^5$$ : Planner-less Proofs of Probabilistic Parameterized Protocols;Lecture Notes in Computer Science;2017-12-29

4. Liveness of Randomised Parameterised Systems under Arbitrary Schedulers;Computer Aided Verification;2016

5. Probabilistic CTL $$^{*}$$ : The Deductive Way;Tools and Algorithms for the Construction and Analysis of Systems;2016