Sciweavers

13383 search results - page 17 / 2677
» Abstractions from proofs
Sort
View
ICTAC
2004
Springer
14 years 3 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 10 months ago
A Single-Instance Incremental SAT Formulation of Proof- and Counterexample-Based Abstraction
nd Counterexample-Based Abstraction Niklas Een, Alan Mishchenko EECS Department, University of California Berkeley, USA. Nina Amla Cadence Research Laboratroy Berkeley, USA. This p...
Niklas Eén, Alan Mishchenko, Nina Amla
APAL
2002
56views more  APAL 2002»
13 years 9 months ago
Proof theory in the abstract
eory in the Abstract J. M. E. Hyland June 7, 2001 Dedicated to Anne Troelstra on the occasion of his 60th birthday: with great affection and respect, this small tribute to his infl...
J. M. E. Hyland
ICA3PP
2010
Springer
14 years 2 months ago
Strategy-Proof Dynamic Resource Pricing of Multiple Resource Types on Federated Clouds
Abstract. There is growing interest in large-scale resource sharing with emerging architectures such as cloud computing, where globally distributed and commoditized resources can b...
Marian Mihailescu, Yong Meng Teo
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 10 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs