117 search results - page 17 / 24 » Program Extraction from Classical Proofs |
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
ENTCS
2008
13 years 7 months ago
2008
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
AAECC
2005
Springer
13 years 7 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
PLDI
2003
ACM
14 years 27 days ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...