Sciweavers

293 search results - page 22 / 59
» Reasoning About States of Probabilistic Sequential Programs
Sort
View
CSFW
2003
IEEE
14 years 25 days ago
Anonymity and Information Hiding in Multiagent Systems
We provide a framework for reasoning about information-hiding requirements in multiagent systems and for reasoning about anonymity in particular. Our framework employs the modal l...
Joseph Y. Halpern, Kevin R. O'Neill
AGP
1995
IEEE
13 years 11 months ago
Domain Independent Ask Approximation in CCP
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
Enea Zaffanella
POPL
2012
ACM
12 years 3 months ago
The marriage of bisimulations and Kripke logical relations
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...
ICLP
2005
Springer
14 years 1 months ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
14 years 1 months ago
Granularity Conscious Modeling for Probabilistic Databases
The convergence of embedded sensor systems and stream query processing suggests an important role for database techniques, in managing data that only partially – and often inacc...
Eirinaios Michelakis, Daisy Zhe Wang, Minos N. Gar...