Sciweavers

240 search results - page 14 / 48
» Infinite trace equivalence
Sort
View
BIRTHDAY
2003
Springer
14 years 1 months ago
Fair Equivalence Relations
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
EUROCRYPT
2006
Springer
14 years 10 days ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 5 months ago
Precedence Automata and Languages
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
Violetta Lonati, Dino Mandrioli, Matteo Pradella
IE
2007
13 years 10 months ago
Then, suddenly, I was moved: nostalgia and the media history of games
Gaming has a past; it cannot escape the rearticulation of genres, traditions and images of its history. The haunting of the present is all the more visible here than in other form...
Christian McCrea
LICS
2000
IEEE
14 years 1 months ago
Precongruence Formats for Decorated Trace Preorders
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats ...
Bard Bloom, Wan Fokkink, Rob J. van Glabbeek