Pushdown specifications

Orna Kupferman; Nir Piterman; Moshe Y. Vardi

doi:10.1007/3-540-36078-6_18

Pushdown specifications

Orna Kupferman, Nir Piterman, Moshe Y. Vardi

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

38 Scopus citations

Abstract

Traditionally, model checking is applied to finite-state systems and regular specifications. While researchers have successfully extended the applicability of model checking to infinite-state systems, almost all existing work still consider regular specification formalisms. There are, however, many interesting non-regular properties one would like to model check. In this paper we study model checking of pushdown specifications. Our specification formalism is nondeterministic pushdown parity tree automata (PD-NPT).We show that the model-checking problem for regular systems and PD-NPT specifications can be solved in time exponential in the system and the specification. Our model-checking algorithm involves a new solution to the nonemptiness problem of nondeterministic pushdown tree automata, where we improve the best known upper bound from a triple-exponential to a single exponential. We also consider the model-checking problem for context-free systems and PD-NPT specifications and show that it is undecidable.

Original language	English
Title of host publication	Logic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings
Editors	Matthias Baaz, Andrei Voronkov
Publisher	Springer Verlag
Pages	262-277
Number of pages	16
ISBN (Print)	3540000100, 9783540000105
DOIs	https://doi.org/10.1007/3-540-36078-6_18
State	Published - 2002
Event	9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002 - Tbilisi, Georgia Duration: 14 Oct 2002 → 18 Oct 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2514
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002
Country/Territory	Georgia
City	Tbilisi
Period	14/10/02 → 18/10/02

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

Access to Document

10.1007/3-540-36078-6_18

Cite this

Kupferman, O., Piterman, N., & Vardi, M. Y. (2002). Pushdown specifications. In M. Baaz, & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings (pp. 262-277). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2514). Springer Verlag. https://doi.org/10.1007/3-540-36078-6_18

Kupferman, Orna ; Piterman, Nir ; Vardi, Moshe Y. / Pushdown specifications. Logic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings. editor / Matthias Baaz ; Andrei Voronkov. Springer Verlag, 2002. pp. 262-277 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3d8f810dd3034e339fb1ec35504e370c,

title = "Pushdown specifications",

abstract = "Traditionally, model checking is applied to finite-state systems and regular specifications. While researchers have successfully extended the applicability of model checking to infinite-state systems, almost all existing work still consider regular specification formalisms. There are, however, many interesting non-regular properties one would like to model check. In this paper we study model checking of pushdown specifications. Our specification formalism is nondeterministic pushdown parity tree automata (PD-NPT).We show that the model-checking problem for regular systems and PD-NPT specifications can be solved in time exponential in the system and the specification. Our model-checking algorithm involves a new solution to the nonemptiness problem of nondeterministic pushdown tree automata, where we improve the best known upper bound from a triple-exponential to a single exponential. We also consider the model-checking problem for context-free systems and PD-NPT specifications and show that it is undecidable.",

author = "Orna Kupferman and Nir Piterman and Vardi, {Moshe Y.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002 ; Conference date: 14-10-2002 Through 18-10-2002",

year = "2002",

doi = "10.1007/3-540-36078-6_18",

language = "אנגלית",

isbn = "3540000100",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "262--277",

editor = "Matthias Baaz and Andrei Voronkov",

booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings",

address = "גרמניה",

}

Kupferman, O, Piterman, N & Vardi, MY 2002, Pushdown specifications. in M Baaz & A Voronkov (eds), Logic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2514, Springer Verlag, pp. 262-277, 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002, Tbilisi, Georgia, 14/10/02. https://doi.org/10.1007/3-540-36078-6_18

Pushdown specifications. / Kupferman, Orna; Piterman, Nir; Vardi, Moshe Y.
Logic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings. ed. / Matthias Baaz; Andrei Voronkov. Springer Verlag, 2002. p. 262-277 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2514).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Pushdown specifications

AU - Kupferman, Orna

AU - Piterman, Nir

AU - Vardi, Moshe Y.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

N2 - Traditionally, model checking is applied to finite-state systems and regular specifications. While researchers have successfully extended the applicability of model checking to infinite-state systems, almost all existing work still consider regular specification formalisms. There are, however, many interesting non-regular properties one would like to model check. In this paper we study model checking of pushdown specifications. Our specification formalism is nondeterministic pushdown parity tree automata (PD-NPT).We show that the model-checking problem for regular systems and PD-NPT specifications can be solved in time exponential in the system and the specification. Our model-checking algorithm involves a new solution to the nonemptiness problem of nondeterministic pushdown tree automata, where we improve the best known upper bound from a triple-exponential to a single exponential. We also consider the model-checking problem for context-free systems and PD-NPT specifications and show that it is undecidable.

AB - Traditionally, model checking is applied to finite-state systems and regular specifications. While researchers have successfully extended the applicability of model checking to infinite-state systems, almost all existing work still consider regular specification formalisms. There are, however, many interesting non-regular properties one would like to model check. In this paper we study model checking of pushdown specifications. Our specification formalism is nondeterministic pushdown parity tree automata (PD-NPT).We show that the model-checking problem for regular systems and PD-NPT specifications can be solved in time exponential in the system and the specification. Our model-checking algorithm involves a new solution to the nonemptiness problem of nondeterministic pushdown tree automata, where we improve the best known upper bound from a triple-exponential to a single exponential. We also consider the model-checking problem for context-free systems and PD-NPT specifications and show that it is undecidable.

UR - http://www.scopus.com/inward/record.url?scp=84954427251&partnerID=8YFLogxK

U2 - 10.1007/3-540-36078-6_18

DO - 10.1007/3-540-36078-6_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84954427251

SN - 3540000100

SN - 9783540000105

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 262

EP - 277

BT - Logic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings

A2 - Baaz, Matthias

A2 - Voronkov, Andrei

PB - Springer Verlag

T2 - 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2002

Y2 - 14 October 2002 through 18 October 2002

ER -

Kupferman O, Piterman N, Vardi MY. Pushdown specifications. In Baaz M, Voronkov A, editors, Logic for Programming, Artificial Intelligence, and Reasoning - 9th International Conference, LPAR 2002, Proceedings. Springer Verlag. 2002. p. 262-277. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-36078-6_18

Pushdown specifications

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this