Abstraction of communication channels in promela: A case study

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1885, Issue , 2000, Pages 187-204

  Fersman, Elena ^a   Jonsson, Bengt ^a  

^a Dept Of Computer Systems ^*  (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; SPACE RESEARCH; TRANSMISSION CONTROL PROTOCOL; VERIFICATION;

ABSTRACT MODELING; HANDSHAKE PROTOCOL; PROMELA; PROTOCOL MODEL; SAFETY PROPERTY; SEQUENCE NUMBER; STATE SPACE EXPLORATION;

MODEL CHECKING;

EID: 84947258442     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/10722468_12     Document Type: Article

References (17)

1. Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, and Tsay Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. 11th IEEE Int. Syrup. On Logic in Computer Science, Pages 313-321, 1996.
2. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91-101, 1996.
3. D. Belsnes. Single-message communication. IEEE Trans on Computers, COM-24(2):190-194, Feb 1976.
4. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems automatically and compositionally. In Alan J. Hu and Moshe Y. Vardi, editors, Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 319-331.Springer-Verlag,1998.
5. P. Cousot and R. Cousot, Abstract interpretation: A unified model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM Symp. on Principles of Programming Languages, pages 238-252, 1977.
6. E. M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Trans. On Programming Languages and Systems, 16(5), Sept. 1994.
7. M.A. Colon and T.E. Uribe. Generating finite-state abstractions of reactive systems using decision procedures. In Proc. 10th Int. Conf. On Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 293-304. Springer Verlag, 1998.
8. S. Das, D.L. Dill, and S. Park. Experience with predicate abstraction. In Proc. 11th Int. Conf. on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, 1999.
9. Dennis Dams, Rob Gerth, and Orna Grumberg: Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems, 19(2), 1997.
10. S. Graf and H. Saidi. Construction of abstract state graphs with PVS.In Proc. 9th Int. Conf. on Computer Aided Verification, volume 1254. Haifa, Israel, 1997. Springer Verlag.
11. B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite-state programs. Information and Computation, 107(2):272-302, Dec. 1993.
12. L. Lamport. A theorem on atomicity in distributed algorithms. Distributed Computing, 4(2):59-68, 1990.
13. D. Lesens and H. Saidi. Abstraction of parameterized networks. Electronic Notes in Theoretical Computer Science, 9, 1997.
14. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
15. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer Verlag, 1992.
16. H. Saidi and N. Shankar. Abstract and model check while you prove. In Proc. 11th Int. Conf. on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, 1999.
17. Pierre Wolper. Expressing interesting properties of programs in propositional temporal logic (extended abstract). In Proc. 13 the ACM Symp. on Principles of Programming Languages, pages 184-193, Jan. 1986.