Variants of LTL query checking

Hana Chockler, Arie Gurfinkel, Ofer Strichman

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

Abstract

Given a model M and a temporal logic formula Φ[?], where ? is a placeholder, the query checking problem, as defined for the case of CTL by Chan in 2000, is to find the strongest propositional formula f such that M = Φ[? ←f]. The motivation for solving this problem is, among other things, to get insight on the model. We consider various objectives to the LTL query-checking problem, and study the question of whether there is a better solution than simply enumerating all possible formulas (modulo logical equivalence). It turns out that in most cases the answer is no, but there is one particular objective for which the answer - in practice - is definitely yes. The solution is based on a reduction to a Pseudo-Boolean Solving problem.

Original languageEnglish
Title of host publicationHardware and Software
Subtitle of host publicationVerification and Testing - 6th International Haifa Verification Conference, HVC 2010, Revised Selected Papers
Pages76-92
Number of pages17
DOIs
StatePublished - 2011
Event6th International Haifa Verification Conference on Hardware and Software: Verification and Testing, HVC 2010 - Haifa, Israel
Duration: 4 Oct 20107 Oct 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6504 LNCS

Conference

Conference6th International Haifa Verification Conference on Hardware and Software: Verification and Testing, HVC 2010
Country/TerritoryIsrael
CityHaifa
Period4/10/107/10/10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Variants of LTL query checking'. Together they form a unique fingerprint.

Cite this