Model-checking pushdown systems
S Schwoon - 2002 - mediatum.ub.tum.de
The thesis investigates an approach to automated software verification based on pushdown
systems. Pushdown systems are, roughly speaking, transition systems whose states include …
systems. Pushdown systems are, roughly speaking, transition systems whose states include …
A temporal logic of nested calls and returns
Abstract Model checking of linear temporal logic (LTL) specifications with respect to
pushdown systems has been shown to be a useful tool for analysis of programs with …
pushdown systems has been shown to be a useful tool for analysis of programs with …
Demand-driven alias analysis for C
X Zheng, R Rugina - Proceedings of the 35th annual ACM SIGPLAN …, 2008 - dl.acm.org
This paper presents a demand-driven, flow-insensitive analysisalgorithm for answering may-
alias queries. We formulate thecomputation of alias queries as a CFL-reachability problem …
alias queries. We formulate thecomputation of alias queries as a CFL-reachability problem …
Analysis of recursive state machines
Recursive state machines (RSMs) enhance the power of ordinary state machines by
allowing vertices to correspond either to ordinary states or to potentially recursive …
allowing vertices to correspond either to ordinary states or to potentially recursive …
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
K Etessami, M Yannakakis - Journal of the ACM (JACM), 2009 - dl.acm.org
We define Recursive Markov Chains (RMCs), a class of finitely presented denumerable
Markov chains, and we study algorithms for their analysis. Informally, an RMC consists of a …
Markov chains, and we study algorithms for their analysis. Informally, an RMC consists of a …
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
K Etessami, M Yannakakis - STACS 2005: 22nd Annual Symposium on …, 2005 - Springer
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state
Markov chains with the ability to invoke other Markov chains in a potentially recursive …
Markov chains with the ability to invoke other Markov chains in a potentially recursive …
Analysis of recursive state machines
Recursive state machines (RSMs) enhance the power of ordinary state machines by
allowing vertices to correspond either to ordinary states or to potentially recursive …
allowing vertices to correspond either to ordinary states or to potentially recursive …
Automated verification of a randomized distributed consensus protocol using cadence SMV and PRISM?
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving
agreement among N asynchronous processes that communicate via read/write shared …
agreement among N asynchronous processes that communicate via read/write shared …
Incremental algorithms for inter-procedural analysis of safety properties
CL Conway, KS Namjoshi, D Dams… - … Aided Verification: 17th …, 2005 - Springer
Automaton-based static program analysis has proved to be an effective tool for bug finding.
Current tools generally re-analyze a program from scratch in response to a change in the …
Current tools generally re-analyze a program from scratch in response to a change in the …
CFLOBDDs: Context-free-language ordered binary decision diagrams
This article presents a new compressed representation of Boolean functions, called
CFLOBDDs (for Context-Free-Language Ordered Binary Decision Diagrams). They are …
CFLOBDDs (for Context-Free-Language Ordered Binary Decision Diagrams). They are …