Sciweavers

5055 search results - page 193 / 1011
» Relative Timing
Sort
View
TCS
1998
15 years 6 months ago
Proving Possibility Properties
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
Leslie Lamport
165
Voted
SERA
2007
Springer
16 years 15 days ago
A Formal Approach to Test the Robustness of Embedded Systems using Behaviour Analysis
Robustness is an important feature required for embedded systems. This paper presents a methodology to test robustness of such systems. We investigate system behaviour aspects. We...
Antoine Rollet, Fares Saad-Khorchef
FSE
2005
Springer
98views Cryptology» more  FSE 2005»
15 years 12 months ago
New Attacks Against Reduced-Round Versions of IDEA
In this paper, we describe a sequence of simple, yet efficient chosen-plaintext (or chosen-ciphertext) attacks against reduced-round versions of IDEA (with 2, 2.5, 3, 3.5, and 4 ro...
Pascal Junod
ICDT
1995
ACM
105views Database» more  ICDT 1995»
15 years 10 months ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
143
Voted
GCC
2003
Springer
15 years 11 months ago
A Collaborative Multimedia Authoring System
We developed a SMIL-based collaborative multimedia authoring tool supporting a mechanism for conceptually representing the temporal relations between different media. Among the ma...
Mee Young Sung, Do Hyung Lee