Compositional Sequentialization of Periodic Programs

  • Sagar Chaki
  • Arie Gurfinkel
  • Soonho Kong
  • Ofer Strichman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7737)

Abstract

We advance the state-of-the-art in verifying periodic programs – a commonly used form of real-time software that consists of a set of asynchronous tasks running periodically and being scheduled preemptively based on their priorities. We focus on an approach based on sequentialization (generating an equivalent sequential program) of a time-bounded periodic program. We present a new compositional form of sequentialization that improves on earlier work in terms of both scalability and completeness (i.e., false warnings) by leveraging temporal separation between jobs in the same hyper-period and across multiple hyper-periods. We also show how the new sequentialization can be further improved in the case of harmonic systems to generate sequential programs of asymptotically smaller size. Experiments indicate that our new sequentialization improves verification time by orders of magnitude compared to competing schemes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Sagar Chaki
    • 1
  • Arie Gurfinkel
    • 1
  • Soonho Kong
    • 1
  • Ofer Strichman
    • 2
  1. 1.CMUPittsburghUSA
  2. 2.TechnionHaifaIsrael

Personalised recommendations