Sciweavers

198 search results - page 33 / 40
» Reachability on prefix-recognizable graphs
Sort
View
FMCAD
2009
Springer
14 years 4 months ago
Software model checking via large-block encoding
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
Dirk Beyer, Alessandro Cimatti, Alberto Griggio, M...
APN
2007
Springer
14 years 4 months ago
Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms
In this work, we propose two high-level formalisms, Markov Decision Petri Nets (MDPNs) and Markov Decision Well-formed Nets (MDWNs), useful for the modeling and analysis of distrib...
Marco Beccuti, Giuliana Franceschinis, Serge Hadda...
KBSE
2006
IEEE
14 years 3 months ago
A Portable Compiler-Integrated Approach to Permanent Checking
Program checking technology is now a mature technology, but is not yet used on a large scale. We identify one cause of this gap in the decoupling of checking tools from the everyd...
Eugen-Nicolae Volanschi
LICS
2003
IEEE
14 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
ICSE
2010
IEEE-ACM
14 years 2 months ago
Codebook: discovering and exploiting relationships in software repositories
Large-scale software engineering requires communication and collaboration to successfully build and ship products. We conducted a survey with Microsoft engineers on inter-team coo...
Andrew Begel, Yit Phang Khoo, Thomas Zimmermann