Sciweavers

1760 search results - page 1 / 352
» Program Analysis Using Weighted Pushdown Systems
Sort
View
FSTTCS
2007
Springer
13 years 11 months ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd
ESOP
2010
Springer
14 years 2 months ago
Weighted Dynamic Pushdown Networks
We develop a generic framework for the analysis of programs with recursive procedures and dynamic process creation. To this end we combine the approach of weighted pushdown systems...
Alexander Wenner
PEPM
2010
ACM
14 years 1 months ago
Conditional weighted pushdown systems and applications
Pushdown systems are well understood as abstract models of programs with (recursive) procedures. Reps et al. recently extended pushdown systems into weighted pushdown systems, whi...
Xin Li, Mizuhito Ogawa
CAV
2005
Springer
110views Hardware» more  CAV 2005»
13 years 10 months ago
Extended Weighted Pushdown Systems
Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis to answer “stack-qualified queries”, which answer the question “what data...
Akash Lal, Thomas W. Reps, Gogul Balakrishnan
RP
2009
Springer
124views Control Systems» more  RP 2009»
13 years 11 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez