Skip to main content
Article thumbnail
Location of Repository

Efficient Temporal-Logic Query Checking for Presburger Systems

By et al. Dezhuang Zhang

Abstract

This paper develops a framework for solving temporal-logic query-checking problems for a class of infinite-state system models that compute with integer-valued variables (so-called Presburger systems, in which Presburger formulas are used to define system behavior). The temporal-logic query-checking problem may be formulated as follows: given a model and a temporal logic formula with placeholders, compute a set of assignments of formulas to placeholders such that the resulting temporal formula is satisfied by the given model. Temporal-logic query checking has proved useful as a means for requirements and design understanding; existing work, however, has focused only on propositional temporal logic and finite-state systems. Our method is based on a symbolic model-checking technique that relies on proof search. The paper first introduces this model-checking approach and then shows how it can be adapted to solving the temporal queries in which formulas may contain integer variables. We also present experimental results showing the computational efficacy of our approach

Topics: methods, Model Checking, D.2.1 [Software Engineering, Requirement / Specification—Tools General Terms Design, Verification, Experimentation, Performance Keywords query checking, Presburger systems, tableau-based symbolic model checking
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.8462
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.umd.edu/~rance/p... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.