Sciweavers

1948 search results - page 333 / 390
» Formalizing Mirror Theory
Sort
View
ICFP
2004
ACM
14 years 10 months ago
Verification of safety properties for concurrent assembly code
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
Dachuan Yu, Zhong Shao
SAC
2010
ACM
14 years 4 months ago
Web-based graphical querying of databases through an ontology: the Wonder system
Biological scientists have made large amounts of data available on the Web, which can be accessed by canned or precomputed queries presented via web forms. To satisfy further info...
Diego Calvanese, C. Maria Keet, Werner Nutt, Maria...
EDBT
2009
ACM
136views Database» more  EDBT 2009»
14 years 4 months ago
On the comparison of microdata disclosure control algorithms
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
OOPSLA
2009
Springer
14 years 4 months ago
Self type constructors
Bruce and Foster proposed the language LOOJ, an extension of Java with the notion of MyType, which represents the type of a self reference and changes its meaning along with inher...
Chieri Saito, Atsushi Igarashi
ATAL
2007
Springer
14 years 4 months ago
Reasoning about judgment and preference aggregation
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...