Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Verified Software: Tools, Theories, Experiments

VSTTE 2012: Verified Software: Theories, Tools, Experiments pp 162Cite as

  1. Home
  2. Verified Software: Theories, Tools, Experiments
  3. Conference paper
The Marriage of Exploration and Deduction

The Marriage of Exploration and Deduction

  • Rupak Majumdar19 
  • Conference paper
  • 904 Accesses

Part of the Lecture Notes in Computer Science book series (LNPSE,volume 7152)

Abstract

State space exploration based on abstraction and refinement has been the cornerstone of several successful software verification tools from the last decade. While these tools have made impressive progress in verifying control-dominant properties of code, most prominently in the domain of device drivers, their applications to more data-intensive properties have been limited. In particular, we focus on parameterized systems, which define infinite families of systems, one for each value of the parameter. Many real-life software systems, for example, memory management units or cache coherence protocols can be modeled as parameterized systems (parameterized, e.g., by the number of processes and memory locations), We want to perform uniform verification of parameterized systems, where we show a formula is an invariant of every member in the parameterized family.

Keywords

  • Parameterized System
  • Model Checker
  • Decision Procedure
  • Parameterized Family
  • Memory Location

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

Author information

Authors and Affiliations

  1. Max-Planck Institute for Software Systems, Germany

    Rupak Majumdar

Authors
  1. Rupak Majumdar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. MS 301-285, 4800 Oak Grove Drive, 91109, Pasadena, CA, USA

    Rajeev Joshi

  2. ETH Zürich, Universitätstr. 6, 8092, Zürich, Switzerland

    Peter Müller

  3. Department of Computer Science, University of Freiburg, Georges-Köhler-Allee 52, 79110, Freiburg, Germany

    Andreas Podelski

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Majumdar, R. (2012). The Marriage of Exploration and Deduction. In: Joshi, R., Müller, P., Podelski, A. (eds) Verified Software: Theories, Tools, Experiments. VSTTE 2012. Lecture Notes in Computer Science, vol 7152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27705-4_13

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-27705-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27704-7

  • Online ISBN: 978-3-642-27705-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature