VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
We propose Considerate Reasoning, a novel specification and verification technique based on object invariants. This technique supports succinct specifications of implementations wh...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
We present an automatic verification procedure based on RGSep that is suitable for reasoning about fine-grained concurrent heapmanipulating programs. The procedure computes a set o...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types),...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Device drivers often keep data in multiple data structures simultaneously while embedding list or tree related records into the records containing the actual data; this r...
VMCAI
2010
Springer
14 years 2 months ago
2010
Springer
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...