Sciweavers

632 search results - page 3 / 127
» Proving Invariants of Functional Programs
Sort
View
JFP
2006
91views more  JFP 2006»
13 years 6 months ago
A reflective functional language for hardware design and theorem proving
This paper introduces reFLect, a functional programming language with reflection features intended for applications in hardware design and verification. The reFLect language is st...
Jim Grundy, Thomas F. Melham, John W. O'Leary
CAV
2005
Springer
135views Hardware» more  CAV 2005»
13 years 11 months ago
Linear Ranking with Reachability
We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving ...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
CADE
2008
Springer
14 years 6 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
ICALP
2010
Springer
13 years 6 months ago
What Is a Pure Functional?
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl
ACL2
2006
ACM
13 years 10 months ago
Quantification in tail-recursive function definitions
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Sandip Ray