Sciweavers

552 search results - page 81 / 111
» On the Complexity of Join Predicates
Sort
View
FOIKS
2006
Springer
13 years 11 months ago
Consistency Checking Algorithms for Restricted UML Class Diagrams
Abstract. Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical inconsistency easily. This p...
Ken Kaneiwa, Ken Satoh
APAQS
2001
IEEE
13 years 11 months ago
Incremental Fault-Tolerant Design in an Object-Oriented Setting
With the increasing emphasis on dependability in complex, distributed systems, it is essential that system development can be done gradually and at different levels of detail. In ...
Einar Broch Johnsen, Olaf Owe, Ellen Munthe-Kaas, ...
ZUM
2000
Springer
13 years 11 months ago
Retrenchment, Refinement, and Simulation
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
Richard Banach, Michael Poppleton
VLDB
1987
ACM
104views Database» more  VLDB 1987»
13 years 11 months ago
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Georges Gardarin
CAV
2010
Springer
206views Hardware» more  CAV 2010»
13 years 11 months ago
Dynamic Cutoff Detection in Parameterized Concurrent Programs
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
Alexander Kaiser, Daniel Kroening, Thomas Wahl