Sciweavers

2873 search results - page 255 / 575
» Model Checking and the Mu-calculus
Sort
View
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
15 years 2 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
DBSEC
2010
196views Database» more  DBSEC 2010»
15 years 1 months ago
Preserving Integrity and Confidentiality of a Directed Acyclic Graph Model of Provenance
Abstract. This paper describes how to preserve integrity and confidentiality of a directed acyclic graph (DAG) model of provenance database. We show a method to preserve integrity ...
Amril Syalim, Takashi Nishide, Kouichi Sakurai
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
15 years 8 months ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...
136
Voted
TSE
2011
114views more  TSE 2011»
14 years 11 months ago
Loupe: Verifying Publish-Subscribe Architectures with a Magnifying Lens
Abstract— The Publish-Subscribe (P/S) communication paradigm fosters high decoupling among distributed components. This facilitates the design of dynamic applications, but also i...
Luciano Baresi, Carlo Ghezzi, Luca Mottola
CHARME
2005
Springer
120views Hardware» more  CHARME 2005»
15 years 10 months ago
How Thorough Is Thorough Enough?
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...
Arie Gurfinkel, Marsha Chechik