Sciweavers

5084 search results - page 348 / 1017
» Proving Possibility Properties
Sort
View
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
16 years 4 hour ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
RTSS
2003
IEEE
15 years 12 months ago
A Consensus Protocol for CAN-Based Systems
Consensus is known to be a fundamental problem in fault-tolerant distributed systems. Solving this problem provides the means for distributed processes to agree on a single value....
George M. de A. Lima, Alan Burns
WORDS
2003
IEEE
15 years 12 months ago
Asynchrony and Real-Time Dependable Computing
We examine how computer system problems can be derived from real application problems, with a particular focus on the relevance of some assumptions, especially those related to co...
Gérard Le Lann
CC
2003
Springer
102views System Software» more  CC 2003»
15 years 12 months ago
Precision in Practice: A Type-Preserving Java Compiler
Popular mobile code architectures (Java and .NET) include verifiers to check for memory safety and other security properties. Since their formats are relatively high level, suppor...
Christopher League, Zhong Shao, Valery Trifonov
FSE
2003
Springer
125views Cryptology» more  FSE 2003»
15 years 12 months ago
On Plateaued Functions and Their Constructions
We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plat...
Claude Carlet, Emmanuel Prouff