Sciweavers

99 search results - page 19 / 20
» Towards a Unifying Theory of Logical and Probabilistic Reaso...
Sort
View
CSL
2007
Springer
13 years 11 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
LICS
2009
IEEE
14 years 3 days ago
Trace Semantics is Fully Abstract
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
Sumit Nain, Moshe Y. Vardi
PODS
2008
ACM
174views Database» more  PODS 2008»
14 years 5 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
LICS
2003
IEEE
13 years 10 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
POPL
2005
ACM
14 years 5 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula