Sciweavers

665 search results - page 48 / 133
» The Theory of Hybrid Automata
Sort
View
EUROCRYPT
2006
Springer
14 years 11 days ago
The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
In this paper we examine the security criteria for a KEM and a DEM that are sufficient for the overall hybrid encryption scheme to be plaintext-aware in the standard model. We appl...
Alexander W. Dent
ITICSE
2005
ACM
14 years 2 months ago
A prolog toolkit for formal languages and automata
This paper describes the first version of P (read “P flat”), a collection of Prolog predicates that aims to provide a pedagogical implementation of concepts and algorithms t...
Michel Wermelinger, Artur Miguel Dias
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
14 years 1 months ago
A computable type theory for control systems
— In this paper, we develop a theory of computable types suitable for the study of control systems. The theory uses type-two effectivity as the underlying computational model, bu...
Pieter Collins
FORTE
1997
13 years 10 months ago
Refusal Testing for Classes of Transition Systems with Inputs and Outputs
This paper presents a testing theory that is parameterised with assumptions about the way implementations communicate with their environment. In this way some existing testing the...
Lex Heerink, Jan Tretmans
LATA
2009
Springer
14 years 3 months ago
On the Average Size of Glushkov's Automata
Abstract. Glushkov’s algorithm builds an ε-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of t...
Cyril Nicaud