Sciweavers

283 search results - page 18 / 57
» Effective Program Verification for Relaxed Memory Models
Sort
View
CAV
2004
Springer
154views Hardware» more  CAV 2004»
15 years 8 months ago
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
Jesse D. Bingham, Anne Condon, Alan J. Hu, Shaz Qa...
ILC
2007
Springer
15 years 11 months ago
Towards Model-Checking Programs with Lists
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...
Alain Finkel, Étienne Lozes, Arnaud Sangnie...
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 4 months ago
Algorithmic Verification of Single-Pass List Processing Programs
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...
Rajeev Alur, Pavol Cerný
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
15 years 6 months ago
Parametric inference of memory requirements for garbage collected languages
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...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
15 years 4 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
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...
Geeta Chaudhry, Thomas H. Cormen