Sciweavers

2024 search results - page 263 / 405
» A Formal Model of Multi-agent Computations
Sort
View
SACRYPT
2004
Springer
105views Cryptology» more  SACRYPT 2004»
15 years 4 months ago
Provably Secure Masking of AES
A general method to secure cryptographic algorithm implementations against side-channel attacks is the use of randomization techniques and, in particular, masking. Roughly speaking...
Johannes Blömer, Jorge Guajardo, Volker Krumm...
DAC
2009
ACM
15 years 4 months ago
Non-cycle-accurate sequential equivalence checking
We present a novel technique for Sequential Equivalence Checking (SEC) between non-cycle-accurate designs. The problem is routinely encountered in verifying the correctness of a s...
Pankaj Chauhan, Deepak Goyal, Gagan Hasteer, Anmol...
FM
1999
Springer
161views Formal Methods» more  FM 1999»
15 years 3 months ago
On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems
We present novel techniques for efficient controller synthesis for untimed and timed systems with respect to invariance and reachability properties. In the untimed case, we give al...
Stavros Tripakis, Karine Altisen
LICS
1996
IEEE
15 years 3 months ago
The Theory of Hybrid Automata
Ahybrid automatonis a formalmodelfor a mixeddiscrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically...
Thomas A. Henzinger
DALT
2007
Springer
15 years 3 months ago
Extending Propositional Logic with Concrete Domains for Multi-issue Bilateral Negotiation
We present a novel approach to knowledge-based automated one-shot multi-issue bilateral negotiation handling, in a homogeneous setting, both numerical features and non-numerical on...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...