Sciweavers

90 search results - page 10 / 18
» Exploiting purity for atomicity
Sort
View
APLAS
2010
ACM
13 years 7 months ago
Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...
Soonho Kong, Yungbum Jung, Cristina David, Bow-Yaw...
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 7 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
JCS
2007
141views more  JCS 2007»
13 years 7 months ago
Compositional information flow security for concurrent programs
We present a general unwinding framework for the definition of information flow security properties of concurrent programs, described in a simple imperative language enriched wi...
Annalisa Bossi, Carla Piazza, Sabina Rossi
JUCS
2007
109views more  JUCS 2007»
13 years 7 months ago
On Ranking RDF Schema Elements (and its Application in Visualization)
Abstract: Ranking is a ubiquitous requirement whenever we confront a large collection of atomic or interrelated artifacts. This paper elaborates on this issue for the case of RDF s...
Yannis Tzitzikas, Dimitris Kotzinos, Yannis Theoha...
DC
2002
13 years 7 months ago
Handling message semantics with Generic Broadcast protocols
Message ordering is a fundamental abstraction in distributed systems. However, ordering guarantees are usually purely "syntactic," that is, message "semantics" ...
Fernando Pedone, André Schiper