1965 search results - page 4 / 393 » On the analysis of interacting pushdown systems |
ICFP
2012
ACM
11 years 7 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
CAV
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
CAV
2005
Springer
13 years 10 months ago
2005
Springer
Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis to answer “stack-qualified queries”, which answer the question “what data...
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...