Sciweavers

10072 search results - page 1401 / 2015
» Composition of Model Programs
Sort
View
198
Voted
ECOOP
2007
Springer
15 years 11 months ago
Non-null References by Default in Java: Alleviating the Nullity Annotation Burden
With the advent of Java 5 annotations, we note a marked increase in the availability of tools that can statically detect potential null dereferences. For such tools to be truly eff...
Patrice Chalin, Perry R. James
193
Voted
PODC
2010
ACM
15 years 11 months ago
Transactional predication: high-performance concurrent sets and maps for STM
Concurrent collection classes are widely used in multi-threaded programming, but they provide atomicity only for a fixed set of operations. Software transactional memory (STM) pr...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
246
Voted
HIPC
2007
Springer
15 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CPAIOR
2004
Springer
15 years 11 months ago
A Global Constraint for Graph Isomorphism Problems
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
Sébastien Sorlin, Christine Solnon
181
Voted
CONCUR
2006
Springer
15 years 11 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
« Prev « First page 1401 / 2015 Last » Next »