283 search results - page 18 / 57 » Effective Program Verification for Relaxed Memory Models |
91
Voted
CAV
2004
Springer
15 years 3 months ago
2004
Springer
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
106
click to vote
ILC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We aim at checking safety and temporal properties over models representing the behavior of programs manipulating dynamic singly-linked lists. The properties we consider n...
124
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
107
click to vote
IWMM
2010
Springer
15 years 1 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
96
Voted
ALGORITHMICA
2006
14 years 11 months ago
2006
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...