Sciweavers

40 search results - page 1 / 8
» Axioms for Recursion in Call-by-Value
Sort
View
FOSSACS
2001
Springer
13 years 9 months ago
Axioms for Recursion in Call-by-Value
Masahito Hasegawa, Yoshihiko Kakutani
CADE
2010
Springer
13 years 6 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold
APLAS
2011
ACM
12 years 5 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
MSCS
2006
100views more  MSCS 2006»
13 years 5 months ago
Modified bar recursion
Modified bar recursion has been used to give a realizability interpretation of the classical axioms of countable and dependent choice. In this paper we survey the main results con...
Ulrich Berger, Paulo Oliva
ISSAC
2007
Springer
142views Mathematics» more  ISSAC 2007»
13 years 11 months ago
Fast arithmetic for triangular sets: from theory to practice
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
Xin Li, Marc Moreno Maza, Éric Schost