Sciweavers

5084 search results - page 599 / 1017
» Proving Possibility Properties
Sort
View
CAV
2010
Springer
187views Hardware» more  CAV 2010»
15 years 10 months ago
Fences in Weak Memory Models
We present a class of relaxed memory models, defined in Coq, parameterised by the chosen permitted local reorderings of reads and writes, and the visibility of inter- and intra-pr...
Jade Alglave, Luc Maranget, Susmit Sarkar, Peter S...
CSFW
2010
IEEE
15 years 10 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
15 years 10 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
DAC
2009
ACM
15 years 10 months ago
Reduction techniques for synchronous dataflow graphs
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
Marc Geilen
ESOP
2009
Springer
15 years 10 months ago
Existential Quantification for Variant Ownership
Ownership types characterize the topology of objects in the heap, through a characterization of the context to which an object belongs. They have been used to support reasoning, me...
Nicholas R. Cameron, Sophia Drossopoulou