97 search results - page 5 / 20 » The Higher-Order Recursive Path Ordering |
86
Voted
CSL
2009
Springer
15 years 4 months ago
2009
Springer
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
64
Voted
PLILP
1993
Springer
15 years 1 months ago
1993
Springer
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
TPHOL
2005
IEEE
15 years 3 months ago
2005
IEEE
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
74
Voted
ESOP
2009
Springer
15 years 1 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
APLAS
2010
ACM
14 years 9 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...