Lightweight specification and analysis of dynamic systems with rich configurations
Open Access
- 1 November 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 373-383
Abstract
Model-checking is increasingly popular in the early phases of the software development process. To establish the correctness of a software design one must usually verify both structural and behavioral (or temporal) properties. Unfortunately, most specification languages, and accompanying model-checkers, excel only in analyzing either one or the other kind. This limits their ability to verify dynamic systems with rich configurations: systems whose state space is characterized by rich structural properties, but whose evolution is also expected to satisfy certain temporal properties. To address this problem, we first propose Electrum, an extension of the Alloy specification language with temporal logic operators, where both rich configurations and expressive temporal properties can easily be defined. Two alternative model-checking techniques are then proposed, one bounded and the other unbounded, to verify systems expressed in this language, namely to verify that every desirable temporal property holds for every possible configuration.Keywords
This publication has 26 references indexed in Scilit:
- Formal semantics, modular specification, and symbolic verification of product-line behaviourScience of Computer Programming, 2014
- Model checking software product lines with SNIPInternational Journal on Software Tools for Technology Transfer, 2012
- Using lightweight modeling to understand chordACM SIGCOMM Computer Communication Review, 2012
- Relational Reasoning via SMT SolvingLecture Notes in Computer Science, 2011
- Efficient Analysis of DynAlloy SpecificationsACM Transactions on Software Engineering and Methodology, 2007
- 9 First-order modal logic2007
- A type system for object modelsACM SIGSOFT Software Engineering Notes, 2004
- Feature integration using a feature constructScience of Computer Programming, 2001
- Decidable fragments of first-order temporal logicsAnnals of Pure and Applied Logic, 2000
- Symbolic Model Checking without BDDs1999