Sciweavers

615 search results - page 69 / 123
» High-Level Nondeterministic Abstractions in
Sort
View
ICALP
2005
Springer
15 years 7 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
SPIN
2005
Springer
15 years 7 months ago
Symbolic Model Checking for Asynchronous Boolean Programs
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
Byron Cook, Daniel Kroening, Natasha Sharygina
ECAL
2003
Springer
15 years 6 months ago
Contextual Random Boolean Networks
Abstract. We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [1] as models of contextual deterministic discrete dynamical systems. We show that ch...
Carlos Gershenson, Jan Broekaert, Diederik Aerts
CP
2001
Springer
15 years 6 months ago
A Temporal Concurrent Constraint Programming Calculus
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
Catuscia Palamidessi, Frank D. Valencia
ISRR
2001
Springer
140views Robotics» more  ISRR 2001»
15 years 6 months ago
The Evolution of a Robot Soccer Team
Abstract. This paper traces four years of evolution of the UNSW team in the RoboCup Sony legged robot league. The lessons learned in the creation of a competitive team are instruct...
Claude Sammut, Bernhard Hengst