Sciweavers

VMCAI
2010
Springer
14 years 9 months ago
Complexity Bounds for the Verification of Real-Time Software
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...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
VMCAI
2010
Springer
14 years 9 months ago
RGSep Action Inference
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...
Viktor Vafeiadis
VMCAI
2010
Springer
14 years 9 months ago
Collections, Cardinalities, and Relations
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
Kuat Yessenov, Ruzica Piskac, Viktor Kuncak
VMCAI
2010
Springer
14 years 9 months ago
Shape Analysis with Reference Set Relations
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...
Mark Marron, Rupak Majumdar, Darko Stefanovic, Dee...
VMCAI
2010
Springer
14 years 9 months ago
Invariant and Type Inference for Matrices
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),...
Thomas A. Henzinger, Thibaud Hottelier, Laura Kov&...
VMCAI
2010
Springer
14 years 9 months ago
Abstract Threads
Shuvendu K. Lahiri, Alexander Malkis, Shaz Qadeer
VMCAI
2010
Springer
14 years 9 months ago
Shape Analysis of Low-Level C with Overlapping Structures
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...
Jörg Kreiker, Helmut Seidl, Vesal Vojdani
VMCAI
2010
Springer
14 years 9 months ago
Temporal Reasoning for Procedural Programs
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...
Rajeev Alur, Swarat Chaudhuri
VMCAI
2010
Springer
14 years 9 months ago
Model-Checking In-Lined Reference Monitors
Abstract. A technique for elegantly expressing In-lined Reference Monitor (IRM) certification as model-checking is presented and implemented. In-lined Reference Monitors (IRM'...
Meera Sridhar, Kevin W. Hamlen
VMCAI
2010
Springer
14 years 9 months ago
Shape Analysis in the Absence of Pointers and Structure
Shape analyses (Chase et al. 1990, Sagiv et al. 2002) discover properties of dynamic and/or mutable structures. We ask, "Is there an equivalent to shape analysis for purely fu...
Matthew Might