96 search results - page 5 / 20 » Analyzing recursive programs using a fixed-point calculus |
CC
2003
Springer
14 years 3 months ago
2003
Springer
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pas...
CSL
2006
Springer
14 years 1 months ago
2006
Springer
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
POST
2012
12 years 5 months ago
2012
Provenance is an increasing concern due to the revolution in sharing and processing scientific data on the Web and in other computer systems. It is proposed that many computer sys...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
APLAS
2006
ACM
14 years 3 months ago
2006
ACM
We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our developme...