Sciweavers

4485 search results - page 186 / 897
» Equivalences on Observable Processes
Sort
View
CSFW
2010
IEEE
14 years 2 months ago
Information Flow Monitor Inlining
In recent years it has been shown that dynamic monitoring can be used to soundly enforce information flow policies. For programs distributed in source or bytecode form, the use o...
Andrey Chudnov, David A. Naumann
FORMATS
2009
Springer
14 years 2 months ago
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
Peter Bulychev, Thomas Chatain, Alexandre David, K...
FM
2006
Springer
134views Formal Methods» more  FM 2006»
14 years 1 months ago
Formal Verification of a C Compiler Front-End
This paper presents the formal verification of a compiler front-end that translates a subset of the C language into the Cminor intermediate language. The semantics of the source an...
Sandrine Blazy, Zaynah Dargaye, Xavier Leroy
ICDCSW
2000
IEEE
14 years 1 months ago
Compositional Verification of a Third Generation Mobile Communication Protocol
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
Sari Leppänen, Matti Luukkainen
CSFW
2008
IEEE
14 years 1 days ago
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus
We present a general technique for modeling remote electronic voting protocols in the applied pi-calculus and for automatically verifying their security. In the first part of this...
Michael Backes, Catalin Hritcu, Matteo Maffei