Sciweavers

279 search results - page 11 / 56
» Invariant Patterns for Program Reasoning
Sort
View
LOPSTR
1994
Springer
13 years 11 months ago
Using Call/Exit Analysis for Logic Program Transformation
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
Dmitri Boulanger, Maurice Bruynooghe
PODS
2008
ACM
158views Database» more  PODS 2008»
14 years 7 months ago
Local Hoare reasoning about DOM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse...
FOSSACS
2007
Springer
14 years 1 months ago
Logical Reasoning for Higher-Order Functions with Local State
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
Nobuko Yoshida, Kohei Honda, Martin Berger
LFCS
1992
Springer
13 years 11 months ago
Strictness Logic and Polymorphic Invariance
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
P. N. Benton
KR
2004
Springer
14 years 25 days ago
Discovering State Invariants
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of disco...
Fangzhen Lin