Sciweavers

1362 search results - page 19 / 273
» Model Checking Large Network Protocol Implementations
Sort
View
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
15 years 1 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...
OOPSLA
2007
Springer
15 years 3 months ago
Modular typestate checking of aliased objects
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...
Kevin Bierhoff, Jonathan Aldrich
BIRTHDAY
2010
Springer
14 years 9 months ago
Model Checking Programmable Router Configurations
Programmable networks offer the ability to customize router behaviour at run time, thus providing new levels of flexibility for network administrators. We have developed a program...
Luca Zanolin, Cecilia Mascolo, Wolfgang Emmerich
68
Voted
FORMATS
2003
Springer
15 years 2 months ago
Discrete-Time Rewards Model-Checked
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
Suzana Andova, Holger Hermanns, Joost-Pieter Katoe...
PST
2004
14 years 10 months ago
Syntax-based Vulnerability Testing of Frame-based Network Protocols
Syntax-based vulnerability testing is a static black-box testing method for protocol implementations. It involves testing the Implementation Under Test (IUT) with a large number o...
Oded Tal, Scott Knight, Tom Dean