Sciweavers

Share
ACTA
2005
90views more  ACTA 2005»
8 years 4 months ago
MOMI: a calculus for mobile mixins
MoMi (Mobile Mixins) is a coordination language for mobile processes that communicate and exchange object-oriented code in a distributed context. MoMi's key idea is structuri...
Lorenzo Bettini, Betti Venneri, Viviana Bono
SAC
2006
ACM
8 years 4 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
SIAMSC
2008
108views more  SIAMSC 2008»
8 years 4 months ago
Automated Code Generation for Discontinuous Galerkin Methods
A compiler approach for generating low-level computer code from high-level input for discontinuous Galerkin finite element forms is presented. The input language mirrors convention...
Kristian B. Ølgaard, Anders Logg, Garth N. ...
FUIN
2007
99views more  FUIN 2007»
8 years 4 months ago
Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code
Proof-carryingcode provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set o...
Amy P. Felty
FFA
2007
62views more  FFA 2007»
8 years 4 months ago
On the parameters of r-dimensional toric codes
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...
Diego Ruano
JUCS
2006
103views more  JUCS 2006»
8 years 4 months ago
An Object Model for Interoperable Systems
Abstract: Most modern computer applications should run on heterogeneous platforms and, moreover, objects and respective code should be easily interchangeable between distinct platf...
Alcides Calsavara, Aaron Borges, Leonardo Nunes, D...
JSAC
2006
63views more  JSAC 2006»
8 years 4 months ago
Generalized pairwise complementary codes with set-wise uniform interference-free windows
Abstract--This paper introduces an approach to generate generalized pairwise complementary (GPC) codes, which offer a uniform interference free windows (IFWs) across the entire cod...
Hsiao-Hwa Chen, Yu-Ching Yeh, Xi Zhang, Aiping Hua...
JPDC
2006
83views more  JPDC 2006»
8 years 4 months ago
Virtual Leashing: Creating a computational foundation for software protection
We introduce Virtual Leashing,1 a new technique for software protection and control. The leashing process removes small fragments of code, pervasive throughout the application, an...
Ori Dvir, Maurice Herlihy, Nir Shavit
ENTCS
2007
91views more  ENTCS 2007»
8 years 4 months ago
Dynamic Reverse Code Generation for Backward Execution
The need for backward execution in debuggers has been raised a number of times. Backward execution helps a user naturally think backwards and, in turn, easily locate the cause of ...
Jooyong Lee
ECCC
2007
88views more  ECCC 2007»
8 years 4 months ago
Combinatorial Construction of Locally Testable Codes
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...
Or Meir
books