Skip to main content
Log in

An Approach to the Verification of Symmetric Parameterized Distributed Systems

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

REFERENCES

  1. Clarke, E., Grumberg, O., and Peled, D. Model Checking, Cambridge, Mass.: MIT Press, 1999. Translated under the title Verifikatsiya modelei programm, Moscow: Mosc. Tsentr Nepreryvnogo Matematicheskogo Obrazovaniya, 2002.

    Google Scholar 

  2. Apt, K. and Kozen, D. Limits for Automatic Verification of Finite-State Concurrent Systems, Inf. Proc. Let., 1986, vol. 15, pp. 307–309.

    Article  Google Scholar 

  3. Emerson, E. and Namjoshi, K., Reasoning about Rings, in Proc. 22nd ACM Symp. on Principles of Programming Languages, ACM, 1995, pp. 85–94.

  4. Wolper, P. and Lovinfosse, V., Properties of Large Sets of Processes with Network Invariants (Extended Abstract), in Proc. Int. Workshop in Automatic Verification Methods for Finite State Systems, Lect. Notes Comput. Sci., vol. 407, Springer, 1989.

  5. Clarke, E., Grumberg, O., and Jha, S., Verifying Parameterized Networks Using Abstraction and Regular Languages, 6th Int. Conf. on Concurrency Theory, 1995.

  6. Emerson, E. and Kahlon, V., Reducing Model Checking of the Many to the Few, 17th Int. Conf. on Automated Deduction (CADE-17), 2000, pp. 236–255.

  7. Kurshan, R. and McMillan, K., A Structural Induction Theorem for Processes, in Proc. PODC'89, ACM, 1989, pp. 239–247.

  8. Calder, M. and Miller, A., Five Ways to Use Induction and Symmetry in the Verification of Networks of Processes by Model-Checking, in Proc. of the Second Workshop on Automated Verification of Critical Systems (AVoCS), 2002, pp. 29–42.

  9. McMillan, K., Symbolic Model Checking: An Approach to the State Explosion Problem, PhD Thesis, Carnegie Mellon Univ., 1992.

  10. Drechsler, R. and Becker, B., Binary Decision Diagrams—Theory and Implementation, Kluwer, 1998.

  11. Hardin, R., Kurshan, R., Shukla, S., and Vardi, M., A New Heuristic for Bad Cycle Detection using BDDs, in Proc. 9th Int. Conf. on Computer Aided Verification (CAV'97), Lect. Notes Comput. Sci., 1997, pp. 268–278.

  12. Bodeveix, J.-P. and Filali, M., Experimenting Acceleration Methods for the Validation of Infinite State Systems, Int. Workshop on Distributed System Validation and Verification (DSVV'2000), Taipei, 2000.

  13. Jonsson, B. and Nilsson, B., Transitive Closures of Regular Relations for Verifying Infinite-State Systems, in Proc. of TACAS'00, Lect. Notes Comput. Sci., 2000.

  14. Shahar, E., Tools and Techniques for Verifying Parameterized Systems, PhD Thesis, Weizmann Institute of Science, 2001.

  15. Konnov, I.V. and Zakharov, V.A., On the Verification of Parameterized Symmetric Distributed Programs, in Trudy 1 Vserossiiskoi Nauchnoi Konferentsii Metody i Sredstva Obrabotki Informatsii (Proc. 1st All-Russia Conf. on Methods and Techniques of Information Processing), Moscow, 2003, pp. 395–400.

Download references

Author information

Authors and Affiliations

Authors

Additional information

__________

Translated from Programmirovanie, Vol. 31, No. 5, 2005.

Original Russian Text Copyright © 2005 by Konnov, Zakharov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Konnov, I.V., Zakharov, V.A. An Approach to the Verification of Symmetric Parameterized Distributed Systems. Program Comput Soft 31, 225–236 (2005). https://doi.org/10.1007/s11086-005-0034-4

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11086-005-0034-4

Keywords

Navigation