Sciweavers

989 search results - page 140 / 198
» Pebbling and Proofs of Work
Sort
View
KBSE
1997
IEEE
14 years 6 days ago
NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
Johann Schumann, Bernd Fischer 0002
PODS
1997
ACM
124views Database» more  PODS 1997»
14 years 5 days ago
Languages for Relational Databases over Interpreted Structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
TPHOL
1994
IEEE
14 years 3 days ago
Trustworthy Tools for Trustworthy Programs: A Verified Verification Condition Generator
Verification Condition Generator (VCG) tools have been effective in simplifying the task of proving programs correct. However, in the past these VCG tools have in general not thems...
Peter V. Homeier, David F. Martin
PEPM
1993
ACM
14 years 2 days ago
Tutorial on Specialisation of Logic Programs
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
John P. Gallagher
KR
1992
Springer
14 years 2 days ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden