Sciweavers

3991 search results - page 366 / 799
» Bounding homogeneous models
Sort
View
CONCUR
2005
Springer
16 years 1 months ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters
ICALP
2004
Springer
16 years 1 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
TACAS
2004
Springer
94views Algorithms» more  TACAS 2004»
16 years 28 days ago
A Tool for Checking ANSI-C Programs
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
Edmund M. Clarke, Daniel Kroening, Flavio Lerda
CDC
2009
IEEE
103views Control Systems» more  CDC 2009»
16 years 10 days ago
Networked state estimation over a Gilbert-Elliot type channel
Abstract— We characterize the stability and achievable performance of networked estimation under correlated packet losses described by the Gilbert-Elliot model. For scalar contin...
Peter Almstrom, Maben Rabi, Mikael Johansson
CDC
2009
IEEE
125views Control Systems» more  CDC 2009»
16 years 9 days ago
Near-optimal deterministic filtering on the unit circle
— We present a near-optimal deterministic filter for systems that evolve on the unit circle. Unlike suboptimal filtering algorithms that rely on approximations of the system, t...
Paul William Coote, Jochen Trumpf, Robert E. Mahon...