Modeling, optimization and computation for software verification

  • Authors:
  • Mardavij Roozbehani;Eric Feron;Alexandre Megrestki

  • Affiliations:
  • Laboratory for Information and Decision Systems (LIDS), Massachusetts Institute of Technology, Cambridge, MA;Laboratory for Information and Decision Systems (LIDS), Massachusetts Institute of Technology, Cambridge, MA;Laboratory for Information and Decision Systems (LIDS), Massachusetts Institute of Technology, Cambridge, MA

  • Venue:
  • HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Modeling and analysis techniques are presented for real-time, safety-critical software. Software analysis is the task of verifying whether the computer code will execute safely, free of run-time errors. The critical properties that prove safe execution include bounded-ness of variables and termination of the program in finite time. In this paper, dynamical system representations of computer programs along with specific models that are pertinent to analysis via an optimization-based search for system invariants are developed. It is shown that the automatic search for system invariants that establish the desired properties of computer code, can be formulated as a convex optimization problem, such as linear programming, semidefinite programming, and/or sum of squares programming.