Sciweavers

105 search results - page 7 / 21
» A General Composition Theorem for Secure Reactive Systems
Sort
View
OOPSLA
2007
Springer
14 years 1 months ago
Synthesizing reactive systems from LSC requirements using the play-engine
Live Sequence Charts (LSCs) is a scenario-based language for modeling object-based reactive systems with liveness properties. A tool called the Play-Engine allows users to create ...
Hillel Kugler, Cory Plock, Amir Pnueli
CSFW
2012
IEEE
11 years 10 months ago
Securing Interactive Programs
Abstract—This paper studies the foundations of informationflow security for interactive programs. Previous research assumes that the environment is total, that is, it must alway...
Willard Rafnsson, Daniel Hedin, Andrei Sabelfeld
ESORICS
2002
Springer
14 years 7 months ago
Confidentiality-Preserving Refinement is Compositional - Sometimes
Confidentiality-preserving refinement describes a relation between a specification and an implementation that ensures that all confidentiality properties required in the specificat...
Thomas Santen, Maritta Heisel, Andreas Pfitzmann
EMSOFT
2004
Springer
14 years 1 months ago
Reactive process networks
Data flow process networks are a good model of computation for streaming multimedia applications incorporating audio, video and/or graphics streams. Process networks are concurre...
Marc Geilen, Twan Basten
CSFW
2005
IEEE
14 years 1 months ago
A Cryptographically Sound Dolev-Yao Style Security Proof of an Electronic Payment System
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
Michael Backes, Markus Dürmuth