thesis
Symbolic algorithms for verification and control
published
Ritankar
Majumdar
author
Methods for the formal specification and verification of systems are indispensible for the development of complex yet correct systems. In formal verification, the designer describes the system in a modeling language with a well-defined semantics, and this system description is analyzed against a set of correctness requirements. Model checking is an algorithmic technique to check that a system description indeed satisfies correctness requirements given as logical specifications. While successful in hardware verification, the potential for model checking for software and embedded systems has not yet been realized. This is because traditional model checking focuses on systems modeled as finite state-transition graphs. While a natural model for hardware (especially synchronous hardware), state-transition graphs often do not capture software and embedded systems at an appropriate level of granularity. This dissertation considers two orthogonal extensions to finite state-transition graphs making model checking techniques applicable to both a wider class of systems and a wider class of properties.
The first direction is an extension to infinite-state structures finitely represented using constraints and operations on constraints. Infinite state arises when we wish to model variables with unbounded range (e.g., integers), or data structures, or real time. We provide a uniform framework of symbolic region algebras to study model checking of infinite-state systems. We also provide sufficient language-independent termination conditions for symbolic model checking algorithms on infinite state systems.
The second direction supplements verification with game theoretic reasoning. Games are natural models for interactions between components. We study game theoretic behavior with winning conditions given by temporal logic objectives both in the deterministic and in the probabilistic context. For deterministic games, we provide an extremal model characterization of fixpoint algorithms that link solutions of verification problems to solutions for games. For probabilistic games we study fixpoint characterization of winning probabilities for games with omega-regular winning objectives, and construct (epsilon-)optimal winning strategies.
University of California, Berkeley2003
1 - 201
yes
Majumdar R. 2003. Symbolic algorithms for verification and control, University of California, Berkeley,p.
Majumdar, Ritankar. <i>Symbolic Algorithms for Verification and Control</i>. University of California, Berkeley, 2003.
Majumdar, Ritankar. <i>Symbolic Algorithms for Verification and Control</i>. University of California, Berkeley, 2003, pp. 1–201.
R. Majumdar, <i>Symbolic algorithms for verification and control</i>. University of California, Berkeley, 2003, pp. 1–201.
Majumdar R. <i>Symbolic Algorithms for Verification and Control</i>. University of California, Berkeley; 2003:1-201.
Majumdar, R. (2003). <i>Symbolic algorithms for verification and control</i> (pp. 1–201). University of California, Berkeley.
R. Majumdar, Symbolic Algorithms for Verification and Control, University of California, Berkeley, 2003.
44162018-12-11T12:08:44Z2019-01-24T13:19:54Z