Sciweavers

329 search results - page 17 / 66
» Complementing Computational Protocol Analysis with Formal Sp...
Sort
View
CCS
2008
ACM
13 years 9 months ago
Towards provable secure neighbor discovery in wireless networks
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocol...
Marcin Poturalski, Panagiotis Papadimitratos, Jean...
COMCOM
1998
117views more  COMCOM 1998»
13 years 7 months ago
Specification, validation, and verification of time-critical systems
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
Shiuh-Pyng Shieh, Jun-Nan Chen
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 2 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
AINA
2004
IEEE
13 years 11 months ago
Spi2Java: Automatic Cryptographic Protocol Java Code Generation from spi calculus
The aim of this work is to describe a tool (Spi2Java) that automatically generates Java code implementing cryptographic protocols described in the formal specification language sp...
Davide Pozza, Riccardo Sisto, Luca Durante
WDAG
2000
Springer
87views Algorithms» more  WDAG 2000»
13 years 11 months ago
A Probabilistically Correct Leader Election Protocol for Large Groups
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
Indranil Gupta, Robbert van Renesse, Kenneth P. Bi...