Sciweavers

117 search results - page 2 / 24
» Using Parameterized Signatures to Express Modular Structure
Sort
View
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
14 years 5 months ago
Algebraic Signatures for Scalable Distributed Data Structures
Signatures detect changes to the data objects. Numerous schemes a known, e.g., the popular hash based SHA-1 standard. We propose a nov scheme we call algebraic signatures. We use ...
Witold Litwin, Thomas J. E. Schwarz
ML
2006
ACM
122views Machine Learning» more  ML 2006»
13 years 10 months ago
Type-safe modular hash-consing
Hash-consing is a technique to share values that are structurally equal. Beyond the obvious advantage of saving memory blocks, hash-consing may also be used to speed up fundamenta...
Jean-Christophe Filliâtre, Sylvain Conchon
ACL2
2006
ACM
13 years 10 months ago
Parameterized congruences in ACL2
Support for congruence-based rewriting is built into ACL2. This capability allows ACL2 to treat certain predicate relations ”just like equality” under appropriate conditions a...
David Greve
ENTCS
2008
121views more  ENTCS 2008»
13 years 4 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
ENTCS
2008
114views more  ENTCS 2008»
13 years 4 months ago
Term-graph Rewriting in Tom Using Relative Positions
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...
Emilie Balland, Paul Brauner