Advertisement

Formal Methods in System Design

, Volume 11, Issue 2, pp 157–185 | Cite as

Verification of Real-Time Systems using Linear Relation Analysis

  • Nicolas Halbwachs
  • Yann-Erick Proy
  • Patrick Roumanoff
Article

Abstract

Linear Relation Analysis [11] is an abstract interpretation devoted to the automatic discovery of invariant linear inequalities among numerical variables of a program. In this paper, we apply such an analysis to the verification of quantitative time properties of two kinds of systems: synchronous programs and linear hybrid systems.

abstract interpretation convex polyhedra real time systems synchronous languages hybrid systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Abadi and L. Lamport, “An old-fashioned recipe for real time,” In J.W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg, editors, Rex Workshop on Real-Time: Theory in Practice, DePlasmolen (Netherlands). LNCS 600, Springer Verlag, June 1991.Google Scholar
  2. 2.
    R. Alur, C. Courcoubetis, and D. Dill, “Model checking in dense real-time,” Information and Computation, Vol. 104, No. 1, pp. 2-34, 1993. Preliminary version appears in the Proc. of 5th LICS, 1990.Google Scholar
  3. 3.
    R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine, “The algorithmic analysis of hybrid systems,” Theoretical Computer Science B, Vol. 138, pp. 3-34, January 1995.Google Scholar
  4. 4.
    R. Alur, C. Courcoubetis, T. A. Henzinger, and Pei-Hsin Ho, “Hybrid automata: an algorithmic approach to the specification and analysis of hybrid systems,” In Workshop on Theory of Hybrid Systems, Lyngby, Denmark, October 1993. LNCS 736, Springer Verlag.Google Scholar
  5. 5.
    R. Alur, T. A. Henzinger, and Pei-Hsin Ho, “Automatic symbolic verification of embedded systems,” In Proc. of the 14th IEEE Real-Time Systems Symposium, pp. 2-11, 1993.Google Scholar
  6. 6.
    F. Boussinot and R. de Simone, “The Esterel language,” Proceedings of the IEEE, Vol. 79, No. 9, pp. 1293-1304, September 1991.Google Scholar
  7. 7.
    N. V. Chernikova, “Algorithm for discovering the set of all solutions of a linear programming problem,” U.S.S.R. Computational Mathematics and Mathematical Physics, 8(6):282-293, 1968.Google Scholar
  8. 8.
    P. Cousot and R. Cousot, “Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints,” In 4th ACM Symposium on Principles of Programming Languages, POPL'77, Los Angeles, January 1977.Google Scholar
  9. 9.
    P. Cousot and R. Cousot, “Abstract interpretation and application to logic programs,” Journal of Logic Programming, Vol. 13, Nos. 1-4, pp. 103-179, 1992. (Also, Research Report LIX/RR/92/08, Ecole Poly-technique).Google Scholar
  10. 10.
    P. Cousot and R. Cousot, “Comparing the Galois connection and widening/narrowing approaches to abstract interpretation,” In M. Bruynooghe and M. Wirsing, editors, PLILP'92, Leuven (Belgium), January 1992. LNCS 631, Springer Verlag.Google Scholar
  11. 11.
    P. Cousot and N. Halbwachs, “Automatic discovery of linear restraints among variables of a program,” In 5th ACM Symposium on Principles of Programming Languages, POPL'78, Tucson (Arizona), January 1978.Google Scholar
  12. 12.
    D. DiIl and H.Wong-Toi, “Verification of real-time systems by successive over-and under-approximations,” In P. Wolper, editor, 7th International Conference on Computer Aided Verification, CAV'95, Liege (Belgium), July 1995. LNCS 939, Springer Verlag.Google Scholar
  13. 13.
    N. Halbwachs, “Détermination automatique de relations linéaires vérifiées par les variables d'un programme,” Thèse de 3e cycle, University of Grenoble, March 1979.Google Scholar
  14. 14.
    N. Halbwachs, “Delay analysis in synchronous programs,” In Fifth Conference on Computer-Aided Verifi-cation, CAV'93, Elounda (Greece), July 1993. LNCS 697, Springer Verlag.Google Scholar
  15. 15.
    N. Halbwachs, Synchronous programming of reactive systems. Kluwer Academic Pub., 1993.Google Scholar
  16. 16.
    N. Halbwachs, F. Lagnier, and C. Ratel, “An experience in proving regular networks of processes by modular model checking,” Acta Informatica, Vol. 29, Nos. 6/7, pp. 523-543, 1992.Google Scholar
  17. 17.
    N. Halbwachs, F. Lagnier, and P. Raymond, “Synchronous observers and the verification of reactive system,” In M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, Third Int. Conf. on Algebraic Methodology and Software Technology, AMAST'93, Twente, June 1993. Workshops in Computing, Springer Verlag.Google Scholar
  18. 18.
    N. Halbwachs, Y.-E. Proy, and P. Raymond, “Verification of linear hybrid systems by means of convex approximations,” In B. LeCharlier, editor, International Symposium on Static Analysis, SAS'94, Namur (Belgium), September 1994. LNCS 864, Springer Verlag.Google Scholar
  19. 19.
    T. A. Henzinger and P.-H. Ho, “Model checking strategies for hybrid systems,” In Conference on Industrial Applications of Artificial Intelligence and Expert Systems, 1994.Google Scholar
  20. 20.
    T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model-checking for real-time systems,” In LICS'92, June 1992.Google Scholar
  21. 21.
    “Another look at real-time programming,” Special Section of the Proceedings of the IEEE, 79(9), September 1991.Google Scholar
  22. 22.
    Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine, “Integration graphs: a class of decidable hybrid systems,” In Workshop on Theory of Hybrid Systems, Lyngby, Denmark, October 1993. LNCS 736, Springer Verlag.Google Scholar
  23. 23.
    L. Lamport, “A fast mutual exclusion algorithm,” ACM Transactions on Computer Systems, Vol. 5, No. 1, pp. 1-11, 1987.Google Scholar
  24. 24.
    H. LeVerge, “A note on Chernikova's algorithm,” Research Report 635, IRISA, February 1992.Google Scholar
  25. 25.
    O. Maler, Z. Manna, and A. Pnueli, “From timed to hybrid systems,” In Rex Workshop on Real-Time: Theory in Practice, DePlasmolen (Netherlands), June 1991. LNCS 600, Springer Verlag.Google Scholar
  26. 26.
    F. Maraninchi, “Operational and compositional semantics of synchronous automaton compositions,” In CONCUR'92, Stony Brook, August 1992. LNCS 630, Springer Verlag.Google Scholar
  27. 27.
    J. Rushby, “A formally verified algorithm for clock synchronization under a hybrid fault model,” In 13th ACM Symp. on Principles of Distributed Computing, PODC'94, Los Angeles, August 1994.Google Scholar
  28. 28.
    H. Wong-Toi and D. Dill, “Aproximations for verifying timing properties,” In Theories and Experiences for Real-Time System Development, chapter 7. World Scientific, 1995.Google Scholar

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • Nicolas Halbwachs
    • 1
  • Yann-Erick Proy
    • 1
  • Patrick Roumanoff
    • 1
  1. 1.Verimag, Centre EquationGieresFrance

Personalised recommendations