Sciweavers

1018 search results - page 89 / 204
» Abstraction and Refinement in Model Checking
Sort
View
DAC
1996
ACM
13 years 12 months ago
State Reduction Using Reversible Rules
We reduce the state explosion problem in automatic verification of finite-state systems by automatically collapsing subgraphs of the aph into abstract states. The key idea of the ...
C. Norris Ip, David L. Dill
SIGSOFT
2007
ACM
14 years 8 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
MONTEREY
2007
Springer
14 years 1 months ago
Logic-Based Regulatory Conformance Checking
In this paper, we describe an approach to formally assess whether an organization conforms to a body of regulation. Conformance is cast as a model checking question where the regul...
Nikhil Dinesh, Aravind K. Joshi, Insup Lee, Oleg S...
EDOC
2006
IEEE
13 years 11 months ago
A conceptual framework for service modelling
This paper presents a conceptual framework for service modelling and refinement, called the COSMO (COnceptual Service MOdelling) framework. This framework provides concepts to mode...
Dick A. C. Quartel, Maarten W. A. Steen, Stanislav...
ASE
2005
103views more  ASE 2005»
13 years 7 months ago
Component Verification with Automatically Generated Assumptions
Abstract. Model checking is an automated technique that can be used to determine whether a system satisfies certain required properties. The typical approach to verifying propertie...
Dimitra Giannakopoulou, Corina S. Pasareanu, Howar...