Sciweavers

11 search results - page 2 / 3
» Using Counterexamples for Improving the Precision of Reachab...
Sort
View
FORMATS
2009
Springer
13 years 9 months ago
Stochastic Games for Verification of Probabilistic Timed Automata
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
ERSHOV
2006
Springer
13 years 7 months ago
Verifying Generalized Soundness of Workflow Nets
We improve the decision procedure from [10] for the problem of generalized soundness of workflow nets. A workflow net is generalized sound iff every marking reachable from an initi...
Kees M. van Hee, Olivia Oanea, Natalia Sidorova, M...
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 12 days ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
LCPC
2005
Springer
13 years 11 months ago
Concurrency Analysis for Parallel Programs with Textually Aligned Barriers
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
Amir Kamil, Katherine A. Yelick
DATE
2009
IEEE
163views Hardware» more  DATE 2009»
14 years 5 days ago
Fixed points for multi-cycle path detection
—Accurate timing analysis is crucial for obtaining the optimal clock frequency, and for other design stages such as power analysis. Most methods for estimating propagation delay ...
Vijay D'Silva, Daniel Kroening