This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
This poster describes an integrated set of stories and story-based activities that we have used in product development in IBM Software Group's Lotus product organizations. We...
Majie Zeller, Sandra L. Kogan, Michael J. Muller, ...
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
entation theory, Dung's abstract framework provides a unifying view of several alternative semantics based on the notion of extension. In this context, we propose a general r...
Pietro Baroni, Massimiliano Giacomin, Giovanni Gui...
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
Boudewijn R. Haverkort, Lucia Cloth, Holger Herman...