156 search results - page 3 / 32 » Proving Failure in Functional Logic Programs |
116
Voted
ICFP
1999
ACM
15 years 2 months ago
1999
ACM
Functional logic languages combine the operational principles of the most important declarative programming paradigms, namely functional and logic programming. Inductively sequent...
71
Voted
EMSOFT
2007
Springer
15 years 4 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
104
click to vote
ACL2
2006
ACM
15 years 1 months ago
2006
ACM
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...
88
Voted
LOPSTR
2009
Springer
15 years 4 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
78
Voted
ENTCS
2006
14 years 10 months ago
2006
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a numbe...