Sciweavers

6167 search results - page 81 / 1234
» Can Refinement be Automated
Sort
View
FMSD
2006
103views more  FMSD 2006»
13 years 11 months ago
Compositional SCC Analysis for Language Emptiness
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita...
CORR
2009
Springer
114views Education» more  CORR 2009»
13 years 9 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol
SIGSOFT
2009
ACM
14 years 12 months ago
Automatic steering of behavioral model inference
Many testing and analysis techniques use finite state models to validate and verify the quality of software systems. Since the specification of such models is complex and timecons...
David Lo, Leonardo Mariani, Mauro Pezzè
POPL
2002
ACM
14 years 11 months ago
Mining specifications
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
Glenn Ammons, James R. Larus, Rastislav Bodí...
CADE
2007
Springer
14 years 11 months ago
Conservative Extensions in the Lightweight Description Logic EL
We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for forma...
Carsten Lutz, Frank Wolter