10715 search results - page 141 / 2143 » Proofs from Tests |
APAL
2005
13 years 10 months ago
2005
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
LICS
2010
IEEE
13 years 9 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
CEFP
2009
Springer
13 years 8 months ago
2009
Springer
Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. ...
ICSEA
2007
IEEE
14 years 5 months ago
2007
IEEE
Test case generation is an expensive, tedious, and errorprone process in software testing. In this paper, test case generation is accomplished using an Extended Finite State Machi...
CSEE
2004
Springer
14 years 4 months ago
2004
Springer
Domain testing is a stratified sampling strategy for choosing a few test cases from the near infinity of candidate test cases. The strategy goes under several names, such as equiv...