On reasoning about rings

International Journal of Foundations of Computer Science

Volumn 14, Issue 4, 2003, Pages 527-549

  Emerson, E Allen ^a   Namjoshi, Kedar S ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 46449088735     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001881     Document Type: Article

References (33)

1. Apt, K., Kozen, D. Limits for automatic verification of finite-state concurrent systems.IPL 15, pp. 307-309
2. Browne, M. C, Clarke, E. M., Grumberg, O. Characterizing Finite Kripke Structuresin Propositional Temporal Logic, Theor. Comp. Sci., vol. 59, pp. 115-131,1988
3. Browne, M. C, Clarke, E. M., Grumberg, O. Reasoning about Networks with ManyIdentical Finite State Processes, Information and Computation, vol. 81, no. 1, pp.13-31, April 1989
4. Clarke, E. M., Emerson, E. A. Design and Synthesis of Synchronization Skeletons usingBranching Time Temporal Logic, in Workshop on Logics of Programs, Springer-Verlag LNCS 131
5. Clarke, E. M., Emerson, E. A., and Sistla, A. P., Automatic Verification of Finite-State Concurrent Systems using Temporal Logic, ACM Trans. Prog Lang and Sys.,vol. 8, no. 2, pp. 244-263, April 1986
6. Clarke, E. M., Filkorn, T., Jha, S. Exploiting Symmetry in Temporal Logic ModelChecking, 5th CAV, Springer-Verlag LNCS 697
7. Clarke, E. M., Grumberg, O. Avoiding the State Explosion Problem in TemporalLogic Model Checking Algorithms, PODC 1987
8. Clarke, E.M., Grumberg, O., Jha, S. Verifying Parameterized Networks using Abstractionand Regular Languages. CONCUR 95. Full version in ACM TOPLAS,1997
9. Clarke, E.M., Jha, S. Symmetry and Induction in Model Checking. Computer ScienceToday 1995, pp. 455-470
10. Cleaveland, R., Parrow, J., Steffen, B. The Concurrency Workbench. In J.Sifakis(ed), Automatic Verification Methods for Finite State Systems, Springer-Verlag,LNCS 407
11. Dijkstra, E. W. Invariance and non-determinacy, in Mathematical Logic and ProgrammingLanguages, Prentice-Hall International Series in Computer Science, eds.C.A.R Hoare and J.C Shepherdson
12. Dijkstra, E. W., Scholten. C. S. Predicate Calculus and Program Semantics,Springer-Verlag, 1990
13. Emerson, E. A. Temporal and Modal Logic, in Handbook of Theoretical ComputerScience, (J. van Leeuwen, ed.), Elsevier/North-Holland, 1991
14. Emerson, E.A., Halpern, J. Y. "Sometimes" and "Not Never" Revisited: On Branchingversus Linear Time Temporal Logic Journal of the ACM, Vol. 33, pp. 151-178,1986
15. E. Allen Emerson, Vineet Kahlon, " Reducing Model Checking of the Many to theFew", Conf. on Automated Deduction (CADE), pp. 236-254, 2000
16. Emerson, E.A., Namjoshi, K.S. Reasoning about Rings. Proc. ACM Symposium onPrinciples of Programming Languages, pp. 85-94, 1995
17. Emerson, E. A., Sistla, A. P. Symmetry and Model Checking, 5th CAV, Springer-Verlag LNCS 697
18. German, S. M., Sistla, A. P. Reasoning about Systems with Many Processes. J. ACM,Vol. 39, Number 3, July 1992
19. Keller, R. M. Formal verification of parallel programs. CACM, July 1976
20. Kurshan, R. P., McMillan, K. A Structural Induction Theorem for Processes, PODC1989
21. Li, J., Suzuki, I., Yamashita, M. A New Structural Induction Theorem for Rings ofTemporal Petri Nets. IEEE Trans. Soft. Engg, vol. 20, No. 2, February 1994
22. Milner, R. Communication and Concurrency, Prentice-Hall International Series inComputer Science, ed. C.A.R Hoare
23. Minsky, M. Computation : Finite and Infinite Machines, Prentice-Hall, 1962
24. McMillan, K., Symbolic Model Checking: An Approach to the State ExplosionProblem, Ph.D. Thesis, Carnegie-Mellon University, 1992
25. Misra, J., Chandy, K. M. Parallel Program Design : A Foundation, Addison-WesleyPublishers, 1988
26. Manna, Z., Pnueli, A. Verification of Parameterized Programs, in Specification andValidation Methods (E. Borger, ed.), Oxford University Press, pp. 167-230, 1994
27. Pnueli, A. The Temporal Logic of Programs. FOCS 1977
28. Queille, J.P., Sifakis, J. Specification and verification of concurrent systems in CESAR,in Proc. of the 5th International Symposium on Programming, LNCS 137,1982
29. Shtadler, Z., Grumberg, O. Network Grammars, Communication Behaviours andAutomatic Verification. In J.Sifakis (ed), Automatic Verification Methods for FiniteState Systems, Springer-Verlag, LNCS 407
30. Sistla, A.P. Parametrized Verification of Linear Networks Using Automata as Invariants.CAV 1997, pp. 412-42331. Suzuki, I. Proving properties of a ring of finite state machines. IPL 28, pp. 213-214
31. Vardi, M., Wolper, P. An Automata-theoretic Approach to Automatic ProgramVerification, Proc. IEEE LICS, pp. 332-344, 1986
32. Vernier, I. Specification and Verification of Parameterized Parallel Programs. Proc.8th International Symposium on Computer and Information Sciences, Istanbul,Turkey, pp. 622-625
33. Wolper, P., Lovinfosse, V. Verifying Properties of Large Sets of Processes withNetwork Invariants. In J.Sifakis (ed), Automatic Verification Methods for FiniteState Systems, Springer-Verlag, LNCS 407.