Model checking large-scale and parameterized resource allocation systems

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

Volumn 2280 LNCS, Issue , 2002, Pages 251-265

  Emerson, E Allen ^a   Kahlon, Vineet ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARAMETERIZATION; PHILOSOPHICAL ASPECTS; RESOURCE ALLOCATION;

CORRECTNESS PROPERTIES; DINING PHILOSOPHERS PROBLEM; EXACT METHODS; IRREGULAR NETWORKS; LIMITING STATE; PARAMETERIZED MODEL CHECKING; RESOURCE ALLOCATION PROBLEM; RESOURCE ALLOCATION SYSTEMS;

MODEL CHECKING;

EID: 84888221697     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46002-0_18     Document Type: Conference Paper

References (27)

1. T. Arons, A. Pnueli, S. Ruah, J. Xu, and L. Zuck. ParameterizedVerification withAutomatically Computed Inductive Assertions. CAV 2001, LNCS, 2001.
2. K. Apt and D. Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters, 15, pages 307-309, 1986.
3. M.C. Browne, E.M. Clarke and O. Grumberg. Reasoning about Networks with Many Identical Finite State Processes. Information and Control, 81(1), pages 13-31, April 1989.
4. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers. C-35(8). pp 677-691, August 1986.
5. 20 states and beyond. LICS 1990.
6. K.M. Chandy and J. Misra. The Drinking Philosophers Problem. ACM Transactions on Programming Languages and Systems, Vol. 6, No. 4, pp 632-646, 1984.
7. E.M. Clarke, T. Filkorn and S. Jha. Exploiting Symmetry in Temporal Model Checking. In Computer Aided Verification, Proceedings of the 5th International Conference. LNCS 697, Springer-Verlag, 1993.
8. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logics. In Proceedings of the IBM Workshop on Logics of Programs, LNCS 131, 1981.
9. E.M. Clarke and O. Grumberg. Avoiding the State Explosion Problem in Temporal Logic Model Checking Algorithms. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 294-303, 1987.
10. E.M. Clarke, O. Grumberg and S. Jha. Verifying Parameterized Networks using Abstraction and Regular Languages. In CONCUR '95: Concurrency Theory, Proceedings of the 6th International Conference, LNCS 962, pages 395-407, Springer-Verlag, 1995.
11. E. A. Emerson, J. Havlicek and R. Trefler. Virtual Symmetry. LICS 2000.
12. E.A. Emerson and V. Kahlon. Reducing Model Checking of the Manytothe Few. In Automated Deduction - CADE-17, LNAI 1831, Springer, pages 236-254, 2000.
13. E.A. Emerson and V. Kahlon. Model Checking Large-scale and Parameterized Resource Allocation Systems. Tech. Report, The Univ. of Texas at Austin, 2001.
14. E.A. Emerson and K.S. Namjoshi. Reasoning about Rings. In Conference Record of POPL '95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 85-94, 1995.
15. E.A. Emerson and K.S. Namjoshi. Automatic Verification of Parameterized Synchronous Systems. In Computer Aided Verification, Proceedings of the 8th International Conference. LNCS, Springer-Verlag, 1996.
16. E.A. Emerson and A.P. Sistla. Symmetry and Model Checking. In Computer Aided Verification, Proceedings of the 5th International Conference. LNCS 697, Springer-Verlag, 1993.
17. E.A. Emerson and A.P. Sistla. Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approach. ACM Trans. on Prog. Lang. and Systems (TOPLAS), pp. 617-638, Vol. 19, no. 4, July 1997.
18. E. Emerson and R. Trefler. From Asymmetry to Full Symmetry. CHARME99, LNCS, 1999.
19. S.M. German and A.P. Sistla. Reasoning about Systems with Many Processes. J. ACM, 39(3), July 1992.
20. P. Godefroid and P. Wolper. Using Partial orders for the efficient verification of deadlock-freedom and safety properties. Formal Methods in Systems Design. 2(2), pp 149-164, 1993.
21. C. N. Ip and D. Dill, Verifying Systems with Replicated Components in Murphi, pp. 147-158 CAV 1996.
22. R. P. Kurshan and K. L. McMillan. A Structural Induction Theorem for Processes. In Proceedings of the Eight Annual ACM Symposium on Principles of Distributed Computing, pages 239-247, 1989.
23. M. Maidl. A Unifying Model Checking Approach for Safety Properties of Parameterized Systems. CAV 2001, LNCS, 2001.
24. D. Peled. Combining partial order reductions with on-the-fly model checking. Formal Aspects of Computing, 8, pp 39-64, 1996.
25. A. Pnueli, S. Ruah, and L. Zuck. Automatic Deductive Verification with Invisible Invariants. TACAS 2001, LNCS, 2001.
26. A. P. Sistla. Parameterized Verification of Linear Networks Using Automata as Invariants, CAV, 1997, 412-423.
27. P. Wolper and V. Lovinfosse. Verifying Properties of Large Sets of Processes with Network Invariants. In J. Sifakis(ed) Automatic Verification Methods for Finite State Systems, Springer-Verlag, LNCS 407, 1989.