Sciweavers

827 search results - page 63 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
DISCEX
2003
IEEE
14 years 3 months ago
Achieving Principled Assuredly Trustworthy Composable Systems and Networks
Huge challenges exist with systems and networks that must dependably satisfy stringent requirements for security, reliability, and other attributes of trustworthiness. Drawing on ...
Peter G. Neumann
POPL
2000
ACM
14 years 2 months ago
Type Systems for Distributed Data Structures
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
Ben Liblit, Alexander Aiken
ICDE
1993
IEEE
118views Database» more  ICDE 1993»
14 years 2 months ago
Entity Identification in Database Integration
The objective of entity identification is to determine the correspondence between object instances from more than one database. This paper ezamines the problem at the instance lev...
Ee-Peng Lim, Jaideep Srivastava, Satya Prabhakar, ...
AAAI
2008
14 years 12 days ago
Computing Minimal Diagnoses by Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
BIRTHDAY
2005
Springer
14 years 1 days ago
A Mobility Calculus with Local and Dependent Types
Abstract. We introduce an ambient-based calculus that combines ambient mobility with process mobility, uses group names to collect ambients with homologous features, and exploits c...
Mario Coppo, Federico Cozzi, Mariangiola Dezani-Ci...