Sciweavers

235 search results - page 31 / 47
» Well-behaved Translations between Structural Operational Sem...
Sort
View
PLDI
2010
ACM
14 years 22 days ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
PODS
2007
ACM
142views Database» more  PODS 2007»
14 years 7 months ago
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
DSS
2006
93views more  DSS 2006»
13 years 7 months ago
Merging workflows: A new perspective on connecting business processes
This paper describes the concept of workflow merge and methods for merging business processes. We grouped merges in four categories according to the type of merge: sequential, par...
Shuang Sun, Akhil Kumar, John Yen
RIA
2006
84views more  RIA 2006»
13 years 7 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier
LICS
2000
IEEE
14 years 1 days ago
Precongruence Formats for Decorated Trace Preorders
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats ...
Bard Bloom, Wan Fokkink, Rob J. van Glabbeek