Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Temporal Reasoning for Procedural Programs Rajeev Alur1

Summary: Temporal Reasoning for Procedural Programs
Rajeev Alur1
and Swarat Chaudhuri2
University of Pennsylvania, USA
Pennsylvania State University, USA
Abstract. While temporal verification of programs is a topic with a long
history, its traditional basis--semantics based on word languages--is ill-
suited for modular reasoning about procedural programs. We address
this issue by defining the semantics of procedural (potentially recursive)
programs using languages of nested words and developing a framework
for temporal reasoning around it. This generalization has two benefits.
First, this style of reasoning naturally unifies Manna-Pnueli-style tem-
poral reasoning with Hoare-style reasoning about structured programs.
Second, it allows verification of "non-regular" properties of specific proce-
dural contexts--e.g., "If a lock is acquired in a context, then it is released
in the same context." We present proof rules for a variety of properties
such as local safety, local response, and staircase reactivity; our rules are
sufficient to prove all temporal properties over nested words. We show


Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania


Collections: Computer Technologies and Information Sciences