Sciweavers

780 search results - page 84 / 156
» Reasoning about sets using redescription mining
Sort
View
97
Voted
CAV
2007
Springer
173views Hardware» more  CAV 2007»
15 years 6 months ago
Array Abstractions from Proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Ranjit Jhala, Kenneth L. McMillan
CHI
2004
ACM
16 years 1 months ago
A constraint satisfaction approach to predicting skilled interactive cognition
In this paper we report a new approach to generating predictions about skilled interactive cognition. The approach, which we call Cognitive Constraint Modeling, takes as input a d...
Alonso H. Vera, Andrew Howes, Michael McCurdy, Ric...
104
Voted
LOGCOM
2007
126views more  LOGCOM 2007»
15 years 17 days ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
ICSE
2011
IEEE-ACM
14 years 4 months ago
Inference of field initialization
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
Fausto Spoto, Michael D. Ernst
104
Voted
SEC
2001
15 years 2 months ago
Security Analysis of the Cliques Protocols Suites: First Results
: The Cliques protocols are extensions of the Diffie-Hellman key exchange protocol to a group setting. In this paper, we are analysing the A-GDH.2 suite that is intended to allow a...
Olivier Pereira, Jean-Jacques Quisquater