skip to main content
10.1145/3092282.3092300acmconferencesArticle/Chapter ViewAbstractPublication PagesicseConference Proceedingsconference-collections
short-paper

Formal verification of data-intensive applications through model checking modulo theories

Published: 13 July 2017 Publication History

Abstract

We present our efforts on the formalization and automated formal verification of data-intensive applications based on the Storm technology, a well known and pioneering framework for developing streaming applications. The approach is based on the so-called array-based systems formalism, introduced by Ghilardi et al., a suitable abstraction of infinite-state systems that we used to model the runtime behavior of Storm-based applications. The formalization consists of quantified formulae belonging to a certain fragment of first-order logic to symbolically represent array-based systems.The formalization consists of quantified first-order formulae symbolically representing array-based systems. The verification consists in checking whether some safety property holds or not for the system. Both formalization and verification are performed in the same framework, namely the state-of-the-art Cubicle model checker.

References

[1]
R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–235, 1994.
[2]
M. M. Bersani, M. Rossi, and P. San Pietro. A tool for deciding the satisfiability of continuous-time metric temporal logic. In Proc. of TIME, pages 99–106, 2013.
[3]
A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Proceedings of STACS, volume 1563 of LNCS, pages 323–333, 1999.
[4]
G. Casale, D. Ardagna, M. Artac, F. Barbier, E. D. Nitto, A. Henry, G. Iuhasz, C. Joubert, J. Merseguer, V. I. Munteanu, J. Perez, D. Petcu, M. Rossi, C. Sheridan, I. Spais, and D. Vladuˇsiˇc. DICE: Quality-driven development of data-intensive cloud applications. In Proc. of MiSE, pages 78–83, 2015.
[5]
S. Ghilardi, E. Nicolini, S. Ranise, and D. Zucchelli. Towards SMT model checking of array-based systems. In Proc. of IJCAR, pages 67–82, 2008.
[6]
F. Marconi, M. M. Bersani, M. Erascu, and M. Rossi. Towards the formal verification of data-intensive applications through metric temporal logic. In Proc. of ICFEM, pages 193–209, 2016.
[7]
Abstract 1 Introduction 2 Preliminaries 3 Modeling Assumptions 4 Formalization and Verification 4.1 Challenges 5 Conclusions and Results References

Cited By

View all
  • (2020)Formal verification of ontology transformation for distribution network information model based on meta‐model theoryIET Cyber-Physical Systems: Theory & Applications10.1049/iet-cps.2020.00185:4(388-393)Online publication date: 10-Nov-2020

Index Terms

  1. Formal verification of data-intensive applications through model checking modulo theories

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SPIN 2017: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software
    July 2017
    199 pages
    ISBN:9781450350778
    DOI:10.1145/3092282
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 13 July 2017

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Array-based systems
    2. Data-intensive applications
    3. Formal verification
    4. Storm technology
    5. infinite-state model checking

    Qualifiers

    • Short-paper

    Funding Sources

    Conference

    ISSTA '17
    Sponsor:

    Upcoming Conference

    ICSE 2025

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)5
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 15 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2020)Formal verification of ontology transformation for distribution network information model based on meta‐model theoryIET Cyber-Physical Systems: Theory & Applications10.1049/iet-cps.2020.00185:4(388-393)Online publication date: 10-Nov-2020

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media