Reachability Analysis of Pushdown Automata: Application to Model-Checking


We apply the symbolic analysis principle to pushdown systems We represent possibly in nite sets of con gurations of such systems by means of nite state automata In order to reason in a uniform way about analysis problems involving both existential and universal path quanti ca tion such as model checking for branching time logics we consider the more general… (More)
DOI: 10.1007/3-540-63141-0_10


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

659 Citations

Semantic Scholar estimates that this publication has 659 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics