Sciweavers

637 search results - page 97 / 128
» The Case for Abstracting Security Policies
Sort
View
DATE
2009
IEEE
139views Hardware» more  DATE 2009»
15 years 8 months ago
Reliable mode changes in real-time systems with fixed priority or EDF scheduling
Abstract—Many application domains require adaptive realtime embedded systems that can change their functionality over time. In such systems it is not only necessary to guarantee ...
Nikolay Stoimenov, Simon Perathoner, Lothar Thiele
TAP
2009
Springer
178views Hardware» more  TAP 2009»
15 years 8 months ago
Dynamic Symbolic Execution for Testing Distributed Objects
Abstract. This paper extends dynamic symbolic execution to distributed and concurrent systems. Dynamic symbolic execution can be used in software testing to systematically identify...
Andreas Griesmayer, Bernhard K. Aichernig, Einar B...
ICALP
2005
Springer
15 years 7 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
CSL
2006
Springer
15 years 5 months ago
Relating Two Standard Notions of Secrecy
Abstract. Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s sh...
Véronique Cortier, Michaël Rusinowitch...
ENTCS
2007
168views more  ENTCS 2007»
15 years 1 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...