Sciweavers

967 search results - page 58 / 194
» Building a Calculus of Data Structures
Sort
View
ENTCS
2007
98views more  ENTCS 2007»
13 years 7 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
CGO
2006
IEEE
14 years 1 months ago
Selecting Software Phase Markers with Code Structure Analysis
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
Jeremy Lau, Erez Perelman, Brad Calder
WWW
2004
ACM
14 years 8 months ago
A novel heterogeneous data integration approach for p2p semantic link network
This paper proposes a novel approach to integrate heterogeneous data in P2P networks. The approach includes a tool for building P2P semantic link networks, mechanisms for peer sch...
Hai Zhuge, Jie Liu
DOLAP
1999
ACM
14 years 13 hour ago
starER: A Conceptual Model for Data Warehouse Design
Modeling data warehouses is a complex task focusing, very often, into internal structures and implementation issues. In this paper we argue that, in order to accurately reflect the...
Nectaria Tryfona, Frank Busborg, Jens G. Borch Chr...
DMDW
2003
134views Management» more  DMDW 2003»
13 years 9 months ago
Using Design Guidelines to Improve Data Warehouse Logical Design
Data Warehouse-(DW) logical design often start with a conceptual schema and then generates relational structures. Applying this approach implies to cope with two main aspects: (i) ...
Verónika Peralta, Raul Ruggia