Sciweavers

115 search results - page 1 / 23
» Verifying Probabilistic Procedural Programs
Sort
View
80
Voted
FSTTCS
2004
Springer
15 years 3 months ago
Verifying Probabilistic Procedural Programs
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
Javier Esparza, Kousha Etessami
ICFEM
2010
Springer
14 years 8 months ago
Verifying Heap-Manipulating Programs with Unknown Procedure Calls
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...
Shengchao Qin, Chenguang Luo, Guanhua He, Florin C...
LICS
2003
IEEE
15 years 3 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
JSC
2010
106views more  JSC 2010»
14 years 8 months ago
Verifying pointer safety for programs with unknown calls
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
Chenguang Luo, Florin Craciun, Shengchao Qin, Guan...
111
Voted
ATVA
2007
Springer
162views Hardware» more  ATVA 2007»
15 years 4 months ago
Verifying Heap-Manipulating Programs in an SMT Framework
Automated software verification has made great progress recently, and a key enabler of this progress has been the advances in efficient, automated decision procedures suitable fo...
Zvonimir Rakamaric, Roberto Bruttomesso, Alan J. H...