4340 search results - page 344 / 868 » Formal Methods and Cryptography |
176
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
160
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
290
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
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...
304
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
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...
165
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
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...