4036 search results - page 271 / 808 » Formal Methods |
168
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
ion Refinement for Quantified Array Assertions Mohamed Nassim Seghir1, , Andreas Podelski1 , and Thomas Wies1,2 1 University of Freiburg, Germany 2 EPFL, Switzerland Abstract. We p...
172
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...
158
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...
284
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...
160
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...