Sciweavers

2138 search results - page 281 / 428
» Logics for the Relational Syllogistic
Sort
View
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
14 years 2 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
AMSTERDAM
2009
13 years 8 months ago
There Is Something about Might
In this paper we present an alternative interpretation of statements of epistemic possibility, which does not induce a consistency test on a common ground, as in (Veltman 1996), bu...
Paul Dekker
ICSE
2008
IEEE-ACM
14 years 11 months ago
Detecting model inconsistency through operation-based model construction
Nowadays, large-scale industrial software systems may involve hundreds of developers working on hundreds of different but related models representing parts of the same system spec...
Xavier Blanc, Isabelle Mounier, Alix Mougenot, Tom...
VLSID
2008
IEEE
149views VLSI» more  VLSID 2008»
14 years 10 months ago
NBTI Degradation: A Problem or a Scare?
Negative Bias Temperature Instability (NBTI) has been identified as a major and critical reliability issue for PMOS devices in nano-scale designs. It manifests as a negative thres...
Kewal K. Saluja, Shriram Vijayakumar, Warin Sootka...
CADE
2003
Springer
14 years 10 months ago
Foundational Certified Code in a Metalogical Framework
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
Karl Crary, Susmit Sarkar