Sciweavers

1073 search results - page 186 / 215
» Formal Program Development with Approximations
Sort
View
SCP
2011
255views Communications» more  SCP 2011»
13 years 2 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
CCS
2011
ACM
12 years 7 months ago
Trace equivalence decision: negative tests and non-determinism
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...
CAV
2012
Springer
265views Hardware» more  CAV 2012»
11 years 10 months ago
An Axiomatic Memory Model for POWER Multiprocessors
The growing complexity of hardware optimizations employed by multiprocessors leads to subtle distinctions among allowed and disallowed behaviors, posing challenges in specifying th...
Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Kayv...
SIGSOFT
2007
ACM
14 years 8 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 8 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...