Sciweavers

348 search results - page 46 / 70
» Verification of Language Based Fault-Tolerance
Sort
View
WOODPECKER
2001
13 years 10 months ago
Proposal for a formal foundation of RM-ODP concepts
Abstract. This paper presents an approach for formalizing the RM-ODP (Reference Model for Open Distributed Processing), an ISO and ITU standard. The goal of this formalization is t...
Andrey Naumenko, Alain Wegmann, Guy Genilloud, Wil...
FC
2010
Springer
169views Cryptology» more  FC 2010»
13 years 11 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
POPL
2006
ACM
14 years 8 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
CCS
2008
ACM
13 years 10 months ago
Verifiable functional purity in java
Proving that particular methods within a code base are functionally pure--deterministic and side-effect free--would aid verification of security properties including function inve...
Matthew Finifter, Adrian Mettler, Naveen Sastry, D...
SIGSOFT
2005
ACM
14 years 9 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich