Sciweavers

30 search results - page 3 / 6
» tacas 2007
Sort
View
TACAS
2007
Springer
110views Algorithms» more  TACAS 2007»
14 years 1 months ago
Counterexamples in Probabilistic Model Checking
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
Tingting Han, Joost-Pieter Katoen
TACAS
2007
Springer
136views Algorithms» more  TACAS 2007»
14 years 1 months ago
Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
This paper studies the effect of bisimulation minimisation in model checking of monolithic discrete-time and continuous-time Markov chains as well as variants thereof with rewards...
Joost-Pieter Katoen, Tim Kemna, Ivan S. Zapreev, D...
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
14 years 1 months ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
TACAS
2007
Springer
118views Algorithms» more  TACAS 2007»
14 years 1 months ago
Checking Pedigree Consistency with PCS
Abstract. Many important problems in bioinformatics and genetics require analyses that are NP-complete. For example, one of the basic problems facing researchers that analyze pedig...
Panagiotis Manolios, Marc Galceran Oms, Sergi Oliv...
TACAS
2007
Springer
117views Algorithms» more  TACAS 2007»
14 years 1 months ago
Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning
This paper is concerned with bridging the gap between requirements, provided as a set of scenarios, and conforming design models. The novel aspect of our approach is to exploit lea...
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern...