Sciweavers

199 search results - page 11 / 40
» Denotations for Classical Proofs - Preliminary Results
Sort
View
TCS
2008
13 years 7 months ago
Seminormal rings (following Thierry Coquand)
The Traverso-Swan theorem says that a reduced ring A is seminormal if and only if the natural homomorphism Pic A Pic A[X] is an isomorphism ([18, 17]). We give here all the detai...
Henri Lombardi, Claude Quitté
DBPL
1995
Springer
106views Database» more  DBPL 1995»
13 years 11 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
POPL
2008
ACM
14 years 8 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
LOGCOM
2002
105views more  LOGCOM 2002»
13 years 7 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
Alberto Artosi, Guido Governatori, Antonino Rotolo
FC
2005
Springer
143views Cryptology» more  FC 2005»
14 years 1 months ago
Risk Assurance for Hedge Funds Using Zero Knowledge Proofs
Abstract. This work introduces a new tool for a fund manager to verifiably communicate portfolio risk characteristics to an investor. We address the classic dilemma: How can an in...
Michael Szydlo