Sciweavers

783 search results - page 21 / 157
» Compositional Reasoning in Model Checking
Sort
View
IEE
2010
136views more  IEE 2010»
13 years 6 months ago
Assume-guarantee verification of software components in SOFA 2 framework
A key problem in compositional model checking of software systems is that typical model checkers accept only closed systems (runnable programs) and therefore a component cannot be ...
Pavel Parizek, Frantisek Plasil
LPNMR
2001
Springer
14 years 4 days ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
CSL
2006
Springer
13 years 7 months ago
Infinite State Model-Checking of Propositional Dynamic Logics
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
Stefan Göller, Markus Lohrey
RR
2007
Springer
14 years 1 months ago
Web Services Discovery and Constraints Composition
The most promising feature of the Web services platform is its ability to form new (composite) services by combining the capabilities of already existing (component) services. The ...
Debmalya Biswas
CAV
2005
Springer
173views Hardware» more  CAV 2005»
14 years 1 months ago
Building Your Own Software Model Checker Using the Bogor Extensible Model Checking Framework
Model checking has proven to be an effective technology for verification and debugging in hardware and more recently in software domains. We believe that recent trends in both th...
Matthew B. Dwyer, John Hatcliff, Matthew Hoosier, ...