Sciweavers

3228 search results - page 15 / 646
» Computationally Sound Proofs
Sort
View
ICFP
2003
ACM
14 years 7 months ago
Representing reductions of NP-complete problems in logical frameworks: a case study
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
Carsten Schürmann, Jatin Shah
POPL
2006
ACM
14 years 7 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
UCS
2007
Springer
14 years 1 months ago
Instant Learning Sound Sensor: Flexible Real-World Event Recognition System for Ubiquitous Computing
We propose a smart sound sensor for building context-aware systems that instantly learn and detect events from various kinds of everyday sounds and environmental noise by using sma...
Yuya Negishi, Nobuo Kawaguchi
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
14 years 2 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
AI
2000
Springer
13 years 7 months ago
Proving theorems by reuse
We investigate the improvement of theorem proving by reusing previously computed proofs. We have developed and implemented the PLAGIATOR system which proves theorems by mathematic...
Christoph Walther, Thomas Kolbe