Sciweavers

827 search results - page 13 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
SP
1998
IEEE
162views Security Privacy» more  SP 1998»
13 years 12 months ago
Complete, Safe Information Flow with Decentralized Labels
The growing use of mobile code in downloaded applications and servlets has increased interest in robust mechanisms for ensuring privacy and secrecy. Information flow control is in...
Andrew C. Myers, Barbara Liskov
CONCUR
2006
Springer
13 years 11 months ago
A Complete Axiomatic Semantics for the CSP Stable-Failures Model
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
Yoshinao Isobe, Markus Roggenbach
ICASSP
2011
IEEE
12 years 11 months ago
Reconstructing completely overlapped notes from musical mixtures
In mixtures of musical sounds, the problem of overlapped harmonics poses a significant challenge to source separation. Common Amplitude Modulation (CAM) is one of the most effect...
Jinyu Han, Bryan Pardo
CADE
2008
Springer
14 years 8 months ago
Towards Fully Automated Axiom Extraction for Finite-Valued Logics
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
Dalmo Mendonca, João Marcos
APAL
2006
66views more  APAL 2006»
13 years 7 months ago
The Skolemization of existential quantifiers in intuitionistic logic
In this paper an alternative Skolemization method is introduced that for a large class of formulas is sound and complete with respect to intuitionistic logic. This class extends t...
Matthias Baaz, Rosalie Iemhoff