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 a...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Spring Berlin/Heidelberg
2011
|
| Online Access: | http://hdl.handle.net/1721.1/67000 https://orcid.org/0000-0002-0505-1400 https://orcid.org/0000-0001-9088-0205 |