Sciweavers

4485 search results - page 40 / 897
» Equivalences on Observable Processes
Sort
View
ENTCS
2008
118views more  ENTCS 2008»
13 years 8 months ago
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
There are two ways to define a semantics for process algebras: either directly by means of an equivalence relation or by means of a preorder whose kernel is the desired equivalenc...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...
PODS
2009
ACM
134views Database» more  PODS 2009»
14 years 9 months ago
Equivalence of nested queries with mixed semantics
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
David DeHaan
ICALP
1999
Springer
14 years 28 days ago
Simulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
Antonín Kucera, Richard Mayr
WCRE
1995
IEEE
14 years 6 days ago
Observed Idiosyncracies of Relational Database Designs
Several processes have been advanced in the literature for reverse engineering of relational databases. The inputs to these processes are relational tables and available contextua...
Michael R. Blaha, William J. Premerlani
ESEM
2010
ACM
13 years 8 months ago
A comprehensive characterization of NLP techniques for identifying equivalent requirements
Though very important in software engineering, linking artifacts of the same type (clone detection) or of different types (traceability recovery) is extremely tedious, error-prone...
Davide Falessi, Giovanni Cantone, Gerardo Canfora