Sciweavers

1018 search results - page 136 / 204
» Abstraction and Refinement in Model Checking
Sort
View
FMSD
2008
110views more  FMSD 2008»
13 years 8 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
IANDC
2010
83views more  IANDC 2010»
13 years 6 months ago
Static analysis of topology-dependent broadcast networks
Broadcast semantics poses significant challenges over point-to-point communication when it comes to formal modelling and analysis. Current approaches to analysing broadcast netwo...
Sebastian Nanz, Flemming Nielson, Hanne Riis Niels...
CAV
2009
Springer
157views Hardware» more  CAV 2009»
14 years 8 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...
IPPS
1999
IEEE
14 years 5 days ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund
EDOC
2006
IEEE
13 years 11 months ago
Combining Analysis of Unstructured Workflows with Transformation to Structured Workflows
Abstract-- Analysis of workflows in terms of structural correctness is important for ensuring the quality of workflow models. Typically, this analysis is only one step in a larger ...
Rainer Hauser, Michael Friess, Jochen Malte Kü...