Skip to main content
SpringerLink
Log in
Book cover

Tools and Algorithms for the Construction and Analysis of Systems

17th International Conference, TACAS 2011, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26--April 3, 2011, Proceedings

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Parosh Aziz Abdulla

    1. Dept. of Information Technology, University of Uppsala, Uppsala, Sweden

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. K. Rustan M. Leino

    1. Microsoft Research, Redmond, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • fast-track conference proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6605)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: TACAS 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (34 papers)

  1. Front Matter

    Download chapter PDF

  2. Reliable Software Development: Analysis-Aware Design

    1. Reliable Software Development: Analysis-Aware Design

      • Gerard J. Holzmann
      Pages 1-2

    2. Transition Invariants and Transition Predicate Abstraction for Program Termination

      • Andreas Podelski, Andrey Rybalchenko
      Pages 3-10

  3. Memory Models and Consistency

    1. Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models

      • Jabob Burnim, Koushik Sen, Christos Stergiou
      Pages 11-25

    2. Compositionality Entails Sequentializability

      • Pranav Garg, P. Madhusudan
      Pages 26-40

    3. Litmus: Running Tests against Hardware

      • Jade Alglave, Luc Maranget, Susmit Sarkar, Peter Sewell
      Pages 41-44

  4. Invariants and Termination

    1. Canonized Rewriting and Ground AC Completion Modulo Shostak Theories

      • Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala
      Pages 45-59

    2. Invariant Generation in Vampire

      • Kryštof Hoder, Laura Kovács, Andrei Voronkov
      Pages 60-64

    3. Enforcing Structural Invariants Using Dynamic Frames

      • Diego Garbervetsky, Daniel Gorín, Ariel Neisen
      Pages 65-80

    4. Loop Summarization and Termination Analysis

      • Aliaksei Tsitovich, Natasha Sharygina, Christoph M. Wintersteiger, Daniel Kroening
      Pages 81-95

  5. Timed and Probabilistic Systems

    1. Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata

      • Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen
      Pages 96-111

    2. Quantitative Multi-objective Verification for Probabilistic Systems

      • Vojtěch Forejt, Marta Kwiatkowska, Gethin Norman, David Parker, Hongyang Qu
      Pages 112-127

    3. Efficient CTMC Model Checking of Linear Real-Time Objectives

      • Benoît Barbot, Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre
      Pages 128-142

  6. Interpolations and SAT-Solvers

    1. Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic

      • Alberto Griggio, Thi Thieu Hoa Le, Roberto Sebastiani
      Pages 143-157

    2. Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems

      • Tino Teige, Martin Fränzle
      Pages 158-172

    3. Specification-Based Program Repair Using SAT

      • Divya Gopinath, Muhammad Zubair Malik, Sarfraz Khurshid
      Pages 173-188

    4. Optimal Base Encodings for Pseudo-Boolean Constraints

      • Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp
      Pages 189-204

  7. Learning

    1. Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference

      • Yungbum Jung, Wonchan Lee, Bow-Yaw Wang, Kwangkuen Yi
      Pages 205-219

    2. Next Generation LearnLib

      • Maik Merten, Bernhard Steffen, Falk Howar, Tiziana Margaria
      Pages 220-223

  8. Model Checking

    1. Applying CEGAR to the Petri Net State Equation

      • Harro Wimmel, Karsten Wolf
      Pages 224-238
Back to top

Other volumes

  1. Tools and Algorithms for the Construction and Analysis of Systems

Keywords

About this book

This book constitutes the refereed proceedings of the 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2011, held in Saarbrücken, Germany, March 26—April 3, 2011, as part of ETAPS 2011, the European Joint Conferences on Theory and Practice of Software. The 32 revised full papers presented were carefully reviewed and selected from 112 submissions. The papers are organized in topical sections on memory models and consistency, invariants and termination, timed and probabilistic systems, interpolations and SAT-solvers, learning, model checking, games and automata, verification, and probabilistic systems.

Editors and Affiliations

  • Dept. of Information Technology, University of Uppsala, Uppsala, Sweden

    Parosh Aziz Abdulla

  • Microsoft Research, Redmond, USA

    K. Rustan M. Leino

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation