Sciweavers

888 search results - page 73 / 178
» The Power of Temporal Proofs
Sort
View
CRYPTO
2007
Springer
105views Cryptology» more  CRYPTO 2007»
15 years 4 months ago
A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...
Emmanuel Bresson, Yassine Lakhnech, Laurent Mazar&...
JUCS
2007
102views more  JUCS 2007»
14 years 9 months ago
Pedagogical Natural Deduction Systems: the Propositional Case
: This paper introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a ...
Loïc Colson, David Michel
JACM
2002
142views more  JACM 2002»
14 years 9 months ago
Timed regular expressions
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
Eugene Asarin, Paul Caspi, Oded Maler
DATE
2006
IEEE
110views Hardware» more  DATE 2006»
15 years 4 months ago
Online energy-aware I/O device scheduling for hard real-time systems
Much research has focused on power conservation for the processor, while power conservation for I/O devices has received little attention. In this paper, we analyze the problem of...
Hui Cheng, Steve Goddard
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 10 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...