Sciweavers

1711 search results - page 127 / 343
» Completing pseudojump operators
Sort
View
ECAI
2006
Springer
13 years 11 months ago
Elaborating Domain Descriptions
Abstract. In this work we address the problem of elaborating domain descriptions (alias action theories), in particular those that are expressed in dynamic logic. We define a gener...
Andreas Herzig, Laurent Perrussel, Ivan José...
FSE
2000
Springer
128views Cryptology» more  FSE 2000»
13 years 11 months ago
Ciphertext Only Reconstruction of Stream Ciphers Based on Combination Generators
This paper presents an operational reconstruction technique of most stream ciphers. We primarily expose it for key-stream generators which consist of several linear feedback shift ...
Anne Canteaut, Eric Filiol
ASPDAC
2005
ACM
142views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Bridging fault testability of BDD circuits
Abstract— In this paper we study the testability of circuits derived from Binary Decision Diagrams (BDDs) under the bridging fault model. It is shown that testability can be form...
Junhao Shi, Görschwin Fey, Rolf Drechsler
DLT
1993
13 years 9 months ago
Rewriting Extended Regular Expressions
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
Valentin M. Antimirov, Peter D. Mosses
FUIN
2008
74views more  FUIN 2008»
13 years 8 months ago
A P Systems Flat Form Preserving Step-by-step Behaviour
Starting from a compositional operational semantics of transition P Systems we have previously defined, we face the problem of developing an axiomatization that is sound and comple...
Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...