1226 search results - page 36 / 246 » Proofs, Programs and Abstract Complexity |
110
click to vote
TPHOL
2002
IEEE
15 years 6 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
CORR
2002
Springer
15 years 1 months ago
2002
Springer
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
118
click to vote
CSFW
2007
IEEE
15 years 8 months ago
2007
IEEE
mplementations for Typed Session Abstractions Ricardo Corin1,2,3 Pierre-Malo Deni´elou1,2 C´edric Fournet1,2 Karthikeyan Bhargavan1,2 James Leifer1 1 MSR-INRIA Joint Centre 2 Mic...
107
click to vote
BIRTHDAY
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
100
click to vote
CADE
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...