Sciweavers

114 search results - page 20 / 23
» Algebraic Translations, Correctness and Algebraic Compiler C...
Sort
View
BIRTHDAY
2004
Springer
15 years 5 months ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira
TPHOL
2003
IEEE
15 years 5 months ago
Program Extraction from Large Proof Developments
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
Luís Cruz-Filipe, Bas Spitters
RSA
2006
74views more  RSA 2006»
14 years 11 months ago
Robust locally testable codes and products of codes
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
Eli Ben-Sasson, Madhu Sudan
MICS
2008
87views more  MICS 2008»
14 years 11 months ago
Spurious Disambiguation Errors and How to Get Rid of Them
The disambiguation approach to the input of formulae enables users of mathematical assistants to type correct formulae in a terse syntax close to the usual ambiguous mathematical n...
Claudio Sacerdoti Coen, Stefano Zacchiroli
FDTC
2010
Springer
138views Cryptology» more  FDTC 2010»
14 years 9 months ago
A Continuous Fault Countermeasure for AES Providing a Constant Error Detection Rate
Many implementations of cryptographic algorithms have shown to be susceptible to fault attacks. For some of them, countermeasures against specific fault models have been proposed. ...
Marcel Medwed, Jörn-Marc Schmidt