Quantitative reactive modeling and verification
Open Access
- 5 October 2013
- journal article
- research article
- Published by Springer Nature in Computer Science - Research and Development
- Vol. 28 (4) , 331-344
Abstract
Formal verification aims to improve the quality of software by detecting errors before they do harm. At the basis of formal verification is the logical notion of correctness, which purports to capture whether or not a program behaves as desired. We suggest that the boolean partition of software into correct and incorrect programs falls short of the practical need to assess the behavior of software in a more nuanced fashion against multiple criteria. We therefore propose to introduce quantitative fitness measures for programs, specifically for measuring the function, performance, and robustness of reactive programs such as concurrent processes. This article describes the goals of the ERC Advanced Investigator Project QUAREM. The project aims to build and evaluate a theory of quantitative fitness measures for reactive models. Such a theory must strive to obtain quantitative generalizations of the paradigms that have been success stories in qualitative reactive modeling, such as compositionality, property-preserving abstraction and abstraction refinement, model checking, and synthesis. The theory will be evaluated not only in the context of software and hardware engineering, but also in the context of systems biology. In particular, we will use the quantitative reactive models and fitness measures developed in this project for testing hypotheses about the mechanisms behind data from biological experiments.Keywords
This publication has 60 references indexed in Scilit:
- Performance evaluation and model checking join forcesCommunications of the ACM, 2010
- Petri net modelling of biological networksBriefings in Bioinformatics, 2007
- Transactional MemorySynthesis Lectures on Computer Architecture, 2006
- Authors' Answer to the Book Review of Introduction to Evolutionary Computing Published in Issue 12:2Evolutionary Computation, 2004
- An automata-theoretic approach to branching-time model checkingJournal of the ACM, 2000
- Robust timed automata1997
- The complexity of mean payoff games on graphsTheoretical Computer Science, 1996
- Probabilistic predicate transformersACM Transactions on Programming Languages and Systems, 1996
- Task allocation for maximizing reliability of distributed computer systemsIEEE Transactions on Computers, 1992
- Exact stochastic simulation of coupled chemical reactionsThe Journal of Physical Chemistry, 1977