Sciweavers

3 search results - page 1 / 1
» A case study in proof based synthesis of algorithms on monot...
Sort
View
IWFM
1998
13 years 6 months ago
Formal Engineering of the Bitonic Sort using PVS
In this paper, we present a proof that the bitonic sort is sound using PVS, a powerful specification and verification environment. First, we briefly introduce this well-known para...
Raphaël Couturier
CORR
2011
Springer
192views Education» more  CORR 2011»
12 years 12 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 4 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram