Sciweavers

163 search results - page 24 / 33
» Type Systems for Useless-Variable Elimination
Sort
View
LOGCOM
2006
90views more  LOGCOM 2006»
13 years 6 months ago
ATL Satisfiability is Indeed EXPTIME-complete
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...
Dirk Walther, Carsten Lutz, Frank Wolter, Michael ...
ISSRE
2002
IEEE
13 years 11 months ago
Toward A Quantifiable Definition of Software Faults
An important aspect of developing models relating the number and type of faults in a software system to a set of structural measurement is defining what constitutes a fault. By de...
John C. Munson, Allen P. Nikora
SPATIALCOGNITION
2000
Springer
13 years 10 months ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
14 years 8 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias
ICDE
2008
IEEE
154views Database» more  ICDE 2008»
14 years 8 months ago
Butterfly: Protecting Output Privacy in Stream Mining
Abstract-- Privacy preservation in data mining demands protecting both input and output privacy. The former refers to sanitizing the raw data itself before performing mining. The l...
Ting Wang, Ling Liu