1760 search results - page 5 / 352 » Program Analysis Using Weighted Pushdown Systems |
162
click to vote
CONCUR
1997
Springer
15 years 8 months ago
1997
Springer
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 re...
223
click to vote
FSTTCS
2010
Springer
15 years 1 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...
117
click to vote
PLDI
2009
ACM
15 years 11 months ago
2009
ACM
Unchecked errors are especially pernicious in operating system file management code. Transient or permanent hardware failures are inevitable, and error-management bugs at the fi...
135
click to vote
FORTE
2003
15 years 5 months ago
2003
We present a new, on-the-fly algorithm that given a push-down model representing a sequential program with (recursive) procedure calls and an extended finite-state automaton repr...
137
click to vote
QEST
2008
IEEE
15 years 10 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...