Sciweavers

55 search results - page 6 / 11
» scp 2008
Sort
View
SCP
2010
108views more  SCP 2010»
13 years 5 months ago
Combining dynamic and static slicing for analysing assembler
One of the most challenging tasks a programmer can face is attempting to analyse and understand a legacy assembler system. Many features of assembler make analysis difficult, and ...
Martin P. Ward, Hussein Zedan
DAM
1999
132views more  DAM 1999»
13 years 7 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
SCP
2008
89views more  SCP 2008»
13 years 7 months ago
A challenge for atomicity verification
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary type T for one writer and one reader by means of 4 unsafe variables of type T , th...
Wim H. Hesselink
SCP
2008
115views more  SCP 2008»
13 years 7 months ago
Goto elimination in program algebra
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...
Thuy Duong Vu
SCP
1998
138views more  SCP 1998»
13 years 7 months ago
A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
Roberto Bagnara