Skip to main navigation Skip to search Skip to main content

Improved algorithm complexities for linear temporal logic model checking of pushdown systems

  • Stony Brook University

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

7 Scopus citations

Abstract

This paper presents a novel implementation strategy for linear temporal logic (LTL) model checking of pushdown systems (PDS). The model checking problem is formulated intuitively in terms of evaluation of Datalog rules. We use a systematic and fully automated method to generate a specialized algorithm and data structures directly from the rules. The generated implementation employs an incremental approach that considers one fact at a time and uses a combination of linked and indexed data structures for facts. We provide precise time complexity for the model checking problem; it is computed automatically and directly from the rules. We obtain a more precise and simplified complexity analysis, as well as improved algorithm understanding.

Original languageEnglish
Title of host publicationVerification, Model Checking, and Abstract Interpretation - 7th International Conference, VMCAI 2006, Proceedings
Pages190-206
Number of pages17
StatePublished - 2006
Event7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2006 - Charleston, SC, United States
Duration: Jan 8 2006Jan 10 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3855 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2006
Country/TerritoryUnited States
CityCharleston, SC
Period01/8/0601/10/06

Fingerprint

Dive into the research topics of 'Improved algorithm complexities for linear temporal logic model checking of pushdown systems'. Together they form a unique fingerprint.

Cite this