• Corpus ID: 189169917

Proceedings 13 Volume Editors

  title={Proceedings 13 Volume Editors},
  author={Gerhard Goos and Juris Hartmanis and Jan van Leeuwen and David Hutchison and Takeo Kanade and Jon M. Kleinberg and Alfred Kobsa and Friedemann Mattern and John C. Mitchell and C. Pandu Rangan and Bernhard Steffen and Demetri Terzopoulos and Doug J. Tygar and Gerhard Weikum and Guido Gerig Marc Niethammer eds and Stanley Durrleman and Tom Fletcher and Guido Gerig and Marc Niethammer},
Refinement Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209 Niki Vazou, Patrick M. Rondon, and Ranjit Jhala Constraining Delimited Control with Contracts . . . . . . . . . . . . . . . . . . . . . . 229 Asumu Takikawa, T. Stephen Strickland, and Sam Tobin-Hochstadt Session V: Shared-Memory Concurrency and Verification Verifying Concurrent Memory Reclamation Algorithms with Grace . . . . . 249 Alexey Gotsman, Noam Rinetzky, and Hongseok Yang Interleaving and… 

Figures and Tables from this paper


On inter-procedural analysis of programs with lists and data
This work addresses the problem of automatic synthesis of assertions on sequential programs with singly-linked lists containing data over infinite domains such as integers or reals by introducing a mechanism based on unfolding/folding operations allowing to strengthen the analysis in the domain of first-order formulas by theAnalysis in the multisets domain.
Boosting multi-core reachability performance with shared hash tables
The implementation outperforms two state-of-the-art multi-core model checkers, SPIN and DiVinE, by a large margin, while placing fewer constraints on the load balancing and search algorithms.
Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data
This work addresses the problem of checking the entailment between $\textsf{SLAD}$ formulas, which is crucial in performing pre-post condition reasoning, and proposes a sound and powerful procedure that is able to solve this problem for a large class of formulas, beyond the capabilities of existing techniques and tools.
Foundations of Multithreaded, Parallel, and Distributed Programming
The Concurrent Computing Landscape, The Essence of Concurrent Programming, and Applications and Programming Styles: A Synopsis of Axiomatic Semantics are presented.
Decidable logics combining heap structures and data
The effectiveness and practicality of the logic is demonstrated by checking verification conditions generated in proving properties of several heap-manipulating programs, using a tool that combines an MSO decision procedure over trees with an SMT solver for integer constraints.
What's Decidable About Arrays?
This work studies a decision procedure for satisfiability in an expressive fragment of a theory of arrays, which is parameterized by the theories of the array elements, and proves that satisfiability is undecidable for several natural extensions to the fragment.
Heap analysis in the presence of collection libraries
A method to represent collections using an abstraction of their semantics in a manner that allows individual elements in the collections to be identified and is able to represent a notion of progress when iteratively manipulating the contents of a collection.
Distributed Symbolic Model Checking for μ-Calculus
This work significantly extends the scope of properties that can be verified distributively, enabling the checking of much larger designs, and formally proves the correctness of the parallel algorithm.
CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems
  • Radu Mateescu
  • Computer Science
    International Journal on Software Tools for Technology Transfer
  • 2005
The library has been developed within the Cadp verification toolbox using the generic Open/Caesar environment and is currently used for three purposes: on-the-fly equivalence checking modulo five widely used equivalence relations, on- the-fly model checking of regular alternation-free modal μ-calculus, and on-The-fly reduction of state spaces based on τ-confluence.
A Logic-Based Framework for Reasoning about Composite Data Structures
It is proved that the satisfiability problem of CSL is decidable whenever the underlying data logic is dec formidable and that C SL is closed under the computation of the strongest post-condition in the considered class of programs.