CAV
2009
Springer
14 years 11 months ago
2009
Springer
CAV
2009
Springer
14 years 11 months ago
2009
Springer
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
CAV
2009
Springer
14 years 11 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
CAV
2009
Springer
14 years 11 months ago
2009
Springer
With the availability of multi-core processors and large-scale computing clusters, the study of parallel algorithms has been revived throughout the industry. We present a portfolio...
CAV
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
SAS
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
SAS
2009
Springer
14 years 11 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
SAS
2009
Springer
14 years 11 months ago
2009
Springer
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
SAS
2009
Springer
14 years 11 months ago
2009
Springer
Interpretation of FIFO Replacement Daniel Grund and Jan Reineke Saarland University, Saarbr?ucken, Germany In hard real-time systems, the execution time of programs must be bounded...
SAS
2009
Springer
14 years 11 months ago
2009
Springer
