Sciweavers

5255 search results - page 461 / 1051
» Formal Methods for Privacy
Sort
View
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 7 months ago
Polymorphic Fractional Capabilities
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
Hirotoshi Yasuoka, Tachio Terauchi
POPL
2007
ACM
16 years 7 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
POPL
2004
ACM
16 years 7 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
CADE
2008
Springer
16 years 7 months ago
On Automating the Calculus of Relations
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
Georg Struth, Peter Höfner
POPL
2010
ACM
16 years 4 months ago
Verified just-in-time compiler on x86
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
Magnus O. Myreen