Distributed Lyapunov Functions in Analysis of Graph Models of Software

In previous works, the authors introduced a framework for software analysis, which is based on optimization of Lyapunov invariants. These invariants prove critical software properties such as absence of overflow and termination in finite time. In this paper, graph models of software are introduced and the software analysis framework is further developed and extended on graph models. A distributed Lyapunov function is assigned to the software by assigning a Lyapunov function to every node on its graph model. The global decremental condition is then enforced by requiring that the Lyapunov functions on each node decrease as transitions take place along the arcs. The concept of graph reduction and optimality of graphs for Lyapunov analysis is briefly discussed.

[1]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[2]  John Lygeros,et al.  Controllers for reachability specifications for hybrid systems , 1999, Autom..

[3]  Alberto Bemporad,et al.  Moving horizon estimation for hybrid systems and fault detection , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[4]  Doron A. Peled,et al.  Software Reliability Methods , 2001, Texts in Computer Science.

[5]  Mardavij Roozbehani,et al.  Modeling, Optimization and Computation for Software Verification , 2005, HSCC.

[6]  L. Ghaoui,et al.  History of linear matrix inequalities in control theory , 1994, Proceedings of 1994 American Control Conference - ACC '94.

[7]  Mark R. Greenstreet,et al.  Hybrid Systems: Computation and Control , 2002, Lecture Notes in Computer Science.

[8]  Anders Rantzer,et al.  Computation of piecewise quadratic Lyapunov functions for hybrid systems , 1997, 1997 European Control Conference (ECC).

[9]  A. Megretski,et al.  Convex optimization proves software correctness , 2005, Proceedings of the 2005, American Control Conference, 2005..

[10]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[11]  V. Borkar,et al.  A unified framework for hybrid control: model and optimal control theory , 1998, IEEE Trans. Autom. Control..

[12]  S. Shankar Sastry,et al.  Hybrid Systems with Finite Bisimulations , 1997, Hybrid Systems.

[13]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[14]  Pablo A. Parrilo,et al.  Minimizing Polynomial Functions , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

[15]  George J. Pappas,et al.  A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates , 2007, IEEE Transactions on Automatic Control.

[16]  Stephan Merz,et al.  Model Checking , 2000 .