Using Fairness to Make Abstractions Work

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

Volumn 2989, Issue , 2004, Pages 198-215

  Bošnački, Dragan ^a   Ioustinova, Natalia ^b   Sidorova, Natalia ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

ABSTRACT MODELING; CASE-STUDIES; CYCLIC BEHAVIOUR; DATA ABSTRACTION; FAIRNESS CONSTRAINTS; ITS EFFICIENCIES; MODEL CHECKER; VERIFICATION ALGORITHMS;

MODEL CHECKING;

EID: 35048869612     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24732-6_15     Document Type: Article

References (25)

1. K. Baukus, Y. Lakhnech, and K. Stahl. Verification of parameterized protocols. Journal of Universal Computer Science, 7(2):141-158, 2001.
2. D. Bošnački. Partial-order reduction in presence of rendez-vous communication with unless constructs and weak fairness. In Theoretical and Practical Aspects of SPIN Model Checking, 5th and 6th Int. SPIN Workshops, volume 1680 of Lecture Notes in Computer Science. Spriner-Verlag, 1999.
3. D. Bošnački and D. Dams. Integrating real time into Spin: A prototype implementation. In Proc. of Formal Description Techniques and Protocol Specification, Testing, and Verification. Kluwer Academic Publishers, 1998.
4. D. Bošnački, D. Dams, L. Holenderski, and N. Sidorova. Verifying SDL in Spin. In TAC AS 2000, volume 1785 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
5. Y. Choueka. Theories of automata on ω-tapes: a simplified approach. Journal of Computer and System Science, 8:117-141, 1974.
6. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample- guided abstraction refinement. In Int. Conference on Computer Aided Verification (CAV'00), volume 1855 of Lecture Notes in Computer Science. Springer, 2000.
7. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
8. P. Cousot and R. Cousot. Abstract interpretaion: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. of POPL '73. ACM, January 1973.
9. D. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD dissertation, Eindhoven University of Thechnology, July 1996.
10. D. Dams and R. Gerth. The bounded retransmission protocol revisited. Electronic Notes in Theoretical Computer Science, 9, 1999.
11. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems: Abstraction preserving ∀VCTL*, ∃CTL*, and CTL*. In Proc. of PROCOMET '94. IFIP, North-Holland, June 1994.
12. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems (TOPLAS), 19(2), 1997.
13. M. M. Gallardo, J. Martine, P. Merino, and E. Pimentel. αSpin: Extending Spin with abstraction. In 9th Int. SPIN Workshop, Grenoble, France 2002, volume 2318 of Lecture Notes in Computer Science, pages 254-258, 2002.
14. S. Graf. Verification of a distributed cache memory by using abstractions. In Workshop on Computer-Aided Verification, CAV'94, Stanford. LNCS 818, Springer Verlag, 1994.
15. G. J. Holzmann. The SPIN Model Checker: Primer and Reference Manual. Addison Wesley, 2003.
16. N. Ioustinova, N. Sidorova, and M. Steffen. Closing open SDL-systems for model checking with DT Spin. In Proc. of Formal Methods Europe (FME'02), volume 2391 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
17. Y. Kesten and A. Pnueli. Control and data abstraction: The cornerstones of practical formal verification. Int. Journal on Software Tools for Technology Transfer, 2(4):328-342, 2000.
18. Y. Kesten and A. Pnueli. Verification by augmented unitary abstraction. Information and Computation, 163(1):203-243, 2000.
19. L. Lamport. A fast mutual exclusion algorithm. ACM Transactions in Computer Systems, 5(1):1-11, 1987.
20. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6(1):11-44, 1995.
21. B. D. Lubachevsky. An approach to automating the verification of compact parallel coordination programs I. Acta Informatica, 21:125-169, 1984.
22. A. Pnueli, J. Xu, and L. Zuck. Liveness with (0, 1,∞)-counter abstraction. In Computer Aided Verification: 14th Int. Conference, CAV 2002, Copenhagen, Denmark, July 27-31, 2002. Proc., volume 2404 of Lecture Notes in Computer Science, pages 107-122. Springer, 2002.
23. A. S. Tanenbaum. Computer Networks. Prentice Hall Int. Inc., 1981.
24. R. J. van Glabbeek and R. P. Weijland. Branching time and abstraction in bisimulation semantics. In Proc. IFIP'89, pages 613-618. North-Holland, 1989.
25. P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proc. 13th ACM Symp. on Principles of Programming Languages, pages 184-192, St. Petersburgh, January 1986.