Sciweavers

509 search results - page 50 / 102
» On the completeness of compositional reasoning methods
Sort
View
TVLSI
2008
151views more  TVLSI 2008»
13 years 8 months ago
Guest Editorial Special Section on Design Verification and Validation
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
I. Harris, D. Pradhan
IEE
2010
136views more  IEE 2010»
13 years 7 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
LICS
2008
IEEE
14 years 3 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen
FOSSACS
2004
Springer
14 years 2 months ago
Bisimulation on Speed: Lower Time Bounds
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left o...
Gerald Lüttgen, Walter Vogler
JAIR
2002
101views more  JAIR 2002»
13 years 8 months ago
Structured Knowledge Representation for Image Retrieval
We propose a structured approach to the problem of retrieval of images by content and present a description logic that has been devised for the semantic indexing and retrieval of ...
Eugenio Di Sciascio, Francesco M. Donini, Marina M...