Sciweavers

479 search results - page 89 / 96
» The theory and calculus of aliasing
Sort
View
ISCI
2008
93views more  ISCI 2008»
13 years 7 months ago
Safety, domain independence and translation of complex value database queries
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
Hong-Cheu Liu, Jeffrey Xu Yu, Weifa Liang
ENTCS
2007
126views more  ENTCS 2007»
13 years 7 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
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
LMCS
2006
79views more  LMCS 2006»
13 years 7 months ago
Computably Based Locally Compact Spaces
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
Paul Taylor 0002
CACM
2002
69views more  CACM 2002»
13 years 7 months ago
Software engineering considered harmful
ion, reviews, rigorous procedures, regression testing, metrics, and so forth) have been helpful, but we are still dealing with an intrinsically unsatisfactory situation. Especially...
Dennis de Champeaux