Sciweavers

63 search results - page 12 / 13
» Predicate Abstraction via Symbolic Decision Procedures
Sort
View
FORTE
2003
13 years 5 months ago
Generation of All Counter-Examples for Push-Down Systems
We present a new, on-the-fly algorithm that given a push-down model representing a sequential program with (recursive) procedure calls and an extended finite-state automaton repr...
Samik Basu, Diptikalyan Saha, Yow-Jian Lin, Scott ...
CADE
2011
Springer
12 years 4 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
13 years 9 months ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart
SCN
2010
Springer
187views Communications» more  SCN 2010»
13 years 2 months ago
Searching Keywords with Wildcards on Encrypted Data
Abstract. A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption ke...
Saeed Sedghi, Peter van Liesdonk, Svetla Nikova, P...
CADE
2009
Springer
14 years 5 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...