Sciweavers

10715 search results - page 19 / 2143
» From Tests to Proofs
Sort
View
124
Voted
ENTCS
2002
129views more  ENTCS 2002»
15 years 1 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
BIRTHDAY
2003
Springer
15 years 7 months ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
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...
Krishna V. Palem
107
Voted
ESOP
2010
Springer
15 years 11 months ago
Logical Concurrency Control From Sequential Proofs
G. Ramalingam, Jyotirmoy V. Deshmukh, Kapil Vaswan...
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
15 years 8 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...