Sciweavers

3658 search results - page 555 / 732
» The logic of proofs, semantically
Sort
View
FOSSACS
2004
Springer
15 years 12 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
ISCIS
2003
Springer
15 years 11 months ago
Design and Implementation of a Secure Group Communication Protocol on a Fault Tolerant Ring
In this paper, we describe a secure group communication protocol for a fault-tolerant synchronous ring. Our protocol, named Secure Synchronous Ring Protocol (SSRP), integrates a se...
Özgür Saglam, Mehmet E. Dalkilç, ...
ACNS
2010
Springer
150views Cryptology» more  ACNS 2010»
15 years 11 months ago
Regulatory Compliant Oblivious RAM
Abstract. We introduce WORM-ORAM, a first mechanism that combines Oblivious RAM (ORAM) access privacy and data confidentiality with Write Once Read Many (WORM) regulatory data re...
Bogdan Carbunar, Radu Sion
VL
2000
IEEE
115views Visual Languages» more  VL 2000»
15 years 11 months ago
SD2: A Sound and Complete Diagrammatic Reasoning System
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
John Howse, Fernando Molina, John Taylor
POPL
1999
ACM
15 years 10 months ago
A Core Calculus of Dependency
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency commo...
Martín Abadi, Anindya Banerjee, Nevin Heint...