Sciweavers

8582 search results - page 166 / 1717
» Here or There
Sort
View
LOPSTR
2000
Springer
15 years 10 months ago
A formal framework for synthesis and verification of logic programs
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
Alessandro Avellone, Mauro Ferrari, Camillo Fioren...
PADL
2000
Springer
15 years 10 months ago
Programming Deep Concurrent Constraint Combinators
Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as...
Christian Schulte
RTA
2000
Springer
15 years 10 months ago
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
Jordi Levy, Mateu Villaret
TYPES
2000
Springer
15 years 10 months ago
An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma
Higman's lemma has a very elegant, non-constructive proof due to Nash-Williams [NW63] using the so-called minimal-bad-sequence argument. The objective of the present paper is ...
Monika Seisenberger
ZUM
2000
Springer
15 years 10 months ago
Formal Methods for Industrial Products
We have recently completed the specication and security proof of a large, industrial scale application. The application is security critical, and the modelling and proof were done ...
Susan Stepney, David Cooper