Distributed Lyapunov Functions in Analysis of Graph Models of Software

Authors:
Mardavij Roozbehani;Alexandre Megretski;Emilio Frazzoli;Eric Feron
Affiliations:
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology (MIT), Cambridge,;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology (MIT), Cambridge,;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology (MIT), Cambridge,;Department of Aerospace Engineering, Georgia Institute of Technology, Atlanta,
Venue:
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Year:
2008

Citing 8
Cited 1

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking

Model checking
Software reliability methods

Software reliability methods
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to Linear Optimization

Introduction to Linear Optimization
Hybrid Systems with Finite Bisimulations

Hybrid Systems V
Modeling, optimization and computation for software verification

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Controllers for reachability specifications for hybrid systems

Automatica (Journal of IFAC)

Analysis of the joint spectral radius via lyapunov functions on path-complete graphs

Proceedings of the 14th international conference on Hybrid systems: computation and control

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.