Sciweavers

525 search results - page 8 / 105
» Using Checkable Types in Automatic Protocol Analysis
Sort
View
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 5 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...
ENTCS
2002
139views more  ENTCS 2002»
13 years 7 months ago
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
Conrado Daws, Marta Z. Kwiatkowska, Gethin Norman
ICLP
2003
Springer
14 years 26 days ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...
ICICS
2004
Springer
14 years 1 months ago
Automatic Covert Channel Analysis of a Multilevel Secure Component
Abstract. The NRL Pump protocol defines a multilevel secure component whose goal is to minimize leaks of information from high level systems to lower level systems, without degrad...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone...
TAP
2008
Springer
153views Hardware» more  TAP 2008»
13 years 7 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif