Pushdown Automata Model Checking
Pushdown Automata Model Checking is a formal verification method that employs a pushdown automaton as a model of computation to algorithmically determine whether a given system specification satisfies desired temporal logic properties, distinguished by its ability to handle infinite-state systems through the manipulation of an unbounded stack.
32
Publications
1.3K
Citations
52
Authors
46
Institutions
Publications per year
2017–2026
1
Parents
32
Formalizing sensitivity in static analysis for intrusion detection
H.H. Feng, Jon Giffin, Yong Yi Huang et al. · 2004 · 162 citations
Model checking probabilistic pushdown automata
Javier Esparza, Antonı́n Kučera, Richard Mayr · 2004 · 124 citations · Full text
A regularity test for pushdown machines
Richard E. Stearns · Information and Control · 1967 · 111 citations
Pushdown Processes: Games and Model Checking
Igor Walukiewicz · BRICS Report Series · 1996 · 93 citations · Full text
1–5 of 32
52
4
h-index
4
h-index
4
h-index
3
h-index
2
h-index
1–5 of 52
46

Centre National de la Recherche Scientifique
Paris, France
5 h-index
8 publications
207 citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
5 h-index
5 publications
119 citations
Université Paris Cité
Paris, France
4 h-index
6 publications
158 citations
University of Stuttgart
Stuttgart, Germany
4 h-index
5 publications
344 citations

Masaryk University
Brno, Czechia
4 h-index
4 publications
275 citations

University of Edinburgh
Edinburgh, United Kingdom
3 h-index
3 publications
107 citations

École Normale Supérieure Paris-Saclay
Gif-sur-Yvette, France
3 h-index
3 publications
182 citations
University of Insubria
Varese, Italy
2 h-index
2 publications
37 citations
1–8 of 46
4 publications · 96 citations
4
h-index
2 publications · 36 citations
2
h-index
ENTCS · 2 publications · 159 citations
2
h-index
2 publications · 124 citations
2
h-index
LMCS · 2 publications · 53 citations
2
h-index
1–5