Sciweavers

523 search results - page 87 / 105
» On the Power of Quantum Proofs
Sort
View
FSTTCS
2003
Springer
15 years 5 months ago
An Equational Theory for Transactions
Abstract. Transactions are commonly described as being ACID: Allor-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID pr...
Andrew P. Black, Vincent Cremet, Rachid Guerraoui,...
TPHOL
2002
IEEE
15 years 4 months ago
Free-Style Theorem Proving
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
David Delahaye
FSTTCS
1999
Springer
15 years 4 months ago
Hoare Logic for Mutual Recursion and Local Variables
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
David von Oheimb
KBSE
1998
IEEE
15 years 4 months ago
Specification-based Browsing of Software Component Libraries
Specification-based retrieval provides exact contentoriented access to component libraries but requires too much deductive power. Specification-based browsing evades this bottlene...
B. Fischer
KBSE
1997
IEEE
15 years 4 months 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