Skip to main content
SpringerLink
Log in

Computer Aided Verification

24th International Conference, CAV 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. P. Madhusudan

    1. Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sanjit A. Seshia

    1. Dept. of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast track conference proceedings
  • State-of-the-art report

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

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

Included in the following conference series:

Conference proceedings info: CAV 2012.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

About this book

This book constitutes the refereed proceedings of the 24th International Conference on Computer Aided Verification, CAV 2012, held in Berkeley, CA, USA in July 2012. The 38 regular and 20 tool papers presented were carefully reviewed and selected from 185 submissions. The papers are organized in topical sections on automata and synthesis, inductive inference and termination, abstraction, concurrency and software verification, biology and probabilistic systems, embedded and control systems, SAT/SMT solving and SMT-based verification, timed and hybrid systems, hardware verification, security, verification and synthesis, and tool demonstration.

Similar content being viewed by others

Keywords

Table of contents (64 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Synthesis and Some of Its Challenges

      • Wolfgang Thomas
      Pages 1-1

    2. Model Checking Cell Biology

      • David L. Dill
      Pages 2-2

  3. Invited Tutorials

    1. Synthesizing Programs with Constraint Solvers

      • Rastislav Bodik, Emina Torlak
      Pages 3-3

    2. IC3 and beyond: Incremental, Inductive Verification

      • Aaron R. Bradley
      Pages 4-4

    3. Formal Verification of Genetic Circuits

      • Chris J. Myers
      Pages 5-5

    4. From C to Infinity and Back: Unbounded Auto-active Verification with VCC

      • Michał Moskal
      Pages 6-6

  4. Automata and Synthesis

    1. Deterministic Automata for the (F,G)-Fragment of LTL

      • Jan Křetínský, Javier Esparza
      Pages 7-22

    2. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types

      • Tomáš Brázdil, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný
      Pages 23-38

    3. ACTL ∩ LTL Synthesis

      • Rüdiger Ehlers
      Pages 39-54

  5. Inductive Inference and Termination

    1. Learning Boolean Functions Incrementally

      • Yu-Fang Chen, Bow-Yaw Wang
      Pages 55-70

    2. Interpolants as Classifiers

      • Rahul Sharma, Aditya V. Nori, Alex Aiken
      Pages 71-87

    3. Termination Analysis with Algorithmic Learning

      • Wonchan Lee, Bow-Yaw Wang, Kwangkeun Yi
      Pages 88-104

    4. Automated Termination Proofs for Java Programs with Cyclic Data

      • Marc Brockschmidt, Richard Musiol, Carsten Otto, Jürgen Giesl
      Pages 105-122

    5. Proving Termination of Probabilistic Programs Using Patterns

      • Javier Esparza, Andreas Gaiser, Stefan Kiefer
      Pages 123-138

  6. Abstraction

    1. The Gauge Domain: Scalable Analysis of Linear Inequality Invariants

      • Arnaud J. Venet
      Pages 139-154

    2. Diagnosing Abstraction Failure for Separation Logic–Based Analyses

      • Josh Berdine, Arlen Cox, Samin Ishtiaq, Christoph M. Wintersteiger
      Pages 155-173

    3. A Method for Symbolic Computation of Abstract Operations

      • Aditya Thakur, Thomas Reps
      Pages 174-192

    4. Leveraging Interpolant Strength in Model Checking

      • Simone Fulvio Rollini, Ondrej Sery, Natasha Sharygina
      Pages 193-209

  7. Concurrency and Software Verification

    1. Detecting Fair Non-termination in Multithreaded Programs

      • Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi, Akash Lal
      Pages 210-226
Back to top

Other volumes

  1. Computer Aided Verification

Editors and Affiliations

  • Dept. of Computer Science, University of Illinois at Urbana-Champaign, Urbana, USA

    P. Madhusudan

  • Dept. of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, USA

    Sanjit A. Seshia

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation