Integrating Topological Proofs with Model Checking to Instrument Iterative Design

by   Claudio Menghi, et al.

System development is not a linear, one-shot process. It proceeds through refinements and revisions. To support assurance that the system satisfies its requirements, it is desirable that continuous verification can be performed after each refinement or revision step. To achieve practical adoption, formal system modeling and verification must accommodate continuous verification efficiently and effectively. Our proposal to address this problem is TOrPEDO, a verification approach where models are given via Partial Kripke Structures (PKSs) and requirements are specified as Linear-time Temporal Logic (LTL) properties. PKSs support refinement, by deliberately indicating unspecified parts of the model that are later completed. We support verification in two complementary forms: via model checking and proofs. Model checking is useful to provide counterexamples, i.e., pinpoint model behaviors that violate requirements. Proofs are instead useful since they can explain why requirements are satisfied. In our work, we introduce a specific concept of proof, called topological proof (TP). A TP produces a slice of the original PKS which justifies the property satisfaction. Because models can be incomplete, TOrPEDO supports reasoning on requirements satisfaction, violation, and possible satisfaction (in the case where the satisfaction depends on unknown parts).



There are no comments yet.


page 1

page 2

page 3

page 4


Verification of Continuous-time Markov Chains

In this paper, we fill the long-standing gap in the field of the verific...

N-PAT: A Nested Model-Checker

N-PAT is a new model-checking tool that supports the verification of nes...

Linear-time Temporal Logic with Event Freezing Functions

Formal properties represent a cornerstone of the system-correctness proo...

Any-horizon uniform random sampling and enumeration of constrained scenarios for simulation-based formal verification

Model-based approaches to the verification of non-terminating Cyber-Phys...

Bayesian Verification under Model Uncertainty

Machine learning enables systems to build and update domain models based...

Bayesian Verification of Chemical Reaction Networks

We present a data-driven verification approach that determines whether o...

Behavioural Preorders on Stochastic Systems - Logical, Topological, and Computational Aspects

Computer systems can be found everywhere: in space, in our homes, in our...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.