TACAS
2010
Springer
13 years 11 months ago
2010
Springer
TACAS
2010
Springer
13 years 11 months ago
2010
Springer
Information theory provides a range of useful methods to analyse probability distributions and these techniques have been successfully applied to measure information flow and the ...
TACAS
2010
Springer
13 years 11 months ago
2010
Springer
TACAS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
TACAS
2010
Springer
13 years 11 months ago
2010
Springer
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
TACAS
2010
Springer
13 years 11 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
TACAS
2010
Springer
13 years 11 months ago
2010
Springer
TACAS
2010
Springer
13 years 11 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...