1226 search results - page 64 / 246 » Proofs, Programs and Abstract Complexity |
125
click to vote
APLAS
2001
ACM
15 years 6 months ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
118
click to vote
GI
2009
Springer
15 years 7 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
142
click to vote
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and concurrent composition, related by an inequational form of the exchange la...
110
click to vote
IH
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We have developed the first hardware and software (intellectual property) metering scheme that enables reliable low overhead proofs for the number of manufactured parts a...
122
click to vote
FMOODS
2008
15 years 4 months ago
2008
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...