Augmenting a regular expression-based temporal logic with local variables

Cindy Eisner, Dana Fisman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not control the behavior of the atomic propositions, it merely observes their behavior. Local variables are a twist on this approach, in which the user can declare variables local to the formula and control their behavior from within the formula itself. Local variables were introduced in 2002, and a formal semantics was given to them in the context of SVA, the assertion language of SystemVerilog, in 2004. That semantics suffers from several drawbacks. In particular, it breaks distributivity of the operators corresponding to intersection and union. In this paper we present a formal semantics for local variables that solves that problem and others, and compare it to the previous solution.

Original languageEnglish
Title of host publicationProceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design, FMCAD
DOIs
StatePublished - 1 Dec 2008
Externally publishedYes
Event2008 International Conference on Formal Methods in Computer-Aided Design, FMCAD - Portland, OR, United States
Duration: 17 Nov 200820 Nov 2008

Publication series

NameProceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design, FMCAD

Conference

Conference2008 International Conference on Formal Methods in Computer-Aided Design, FMCAD
Country/TerritoryUnited States
CityPortland, OR
Period17/11/0820/11/08

Fingerprint

Dive into the research topics of 'Augmenting a regular expression-based temporal logic with local variables'. Together they form a unique fingerprint.

Cite this