Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Jointly deployed aspects may interact with each other. While some interactions might be intended, unintended interactions (interferences) can break a program. Detecting and resolv...
Research on web mashups and visual languages share an interest in human-centered computing. Both research communities are concerned with supporting programming by everyday, techni...
M. Cameron Jones, Elizabeth F. Churchill, Michael ...
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
Abstract. We present a well-founded semantics for deductive objectoriented database (dood) languages by applying the alternating- xpoint characterization of the well-founded model ...