Sciweavers

456 search results - page 28 / 92
» A Proof System for Abstract Non-interference
Sort
View
MCU
2007
123views Hardware» more  MCU 2007»
13 years 10 months ago
Study of Limits of Solvability in Tag Systems
Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. Thi...
Liesbeth De Mol
LICS
1994
IEEE
14 years 22 days ago
Subtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
Gordon D. Plotkin, Martín Abadi, Luca Carde...
EGCDMAS
2004
147views ECommerce» more  EGCDMAS 2004»
13 years 10 months ago
Should We Prove Security Policies Correct?
Security policies are abstract descriptions of how a system should behave to be secure. They typically express what is obligatory, permitted, or forbidden in the system. When the s...
Sebastiano Battiato, Giampaolo Bella, Salvatore Ri...
SEFM
2009
IEEE
14 years 3 months ago
Implementation Correctness of a Real-Time Operating System
—In the modern car, electronic devices are even employed for safety-critical missions like brake control, where failures might cost human lives. Among various approaches to incre...
Matthias Daum, Norbert Schirmer, Mareike Schmidt
CADE
2006
Springer
14 years 9 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...