APML: An Architecture Proof Modeling Language

07/08/2019
by   Diego Marmsoler, et al.
0

To address the increasing size and complexity of modern software systems, compositional verification separates the verification of single components from the verification of their composition. In architecture-based verification, the former is done using Model Checking, while this does not seem to be the case in general the latter is done using interactive theorem proving (ITP). As of today, however, architects are usually not trained in using a full-fledged interactive theorem prover. Thus, to bridge the gap between ITP and the architecture domain, we developed APML: an architecture proof modeling language. APML allows one to sketch proofs about component composition at the level of architecture using notations similar to Message Sequence Charts. With this paper, we introduce APML: We describe the language, show its soundness and completeness for the verification of architecture contracts, and provide an algorithm to map an APML proof to a corresponding proof for the interactive theorem prover Isabelle. Moreover, we describe its implementation in terms of an Eclipse/EMF modeling application, demonstrate it by means of a running example, and evaluate it in terms of a larger case study. Although our results are promising, the case study also reveals some limitations, which lead to new directions for future work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/30/2020

Teaching Interactive Proofs to Mathematicians

This work discusses an approach to teach to mathematicians the importanc...
research
05/15/2019

holpy: Interactive Theorem Proving in Python

The design of modern proof assistants is faced with several sometimes co...
research
01/04/2021

Lassie: HOL4 Tactics by Example

Proof engineering efforts using interactive theorem proving have yielded...
research
02/10/2022

Vehicle: Interfacing Neural Network Verifiers with Interactive Theorem Provers

Verification of neural networks is currently a hot topic in automated th...
research
05/04/2023

Towards a Scalable Proof Engine: A Performant Prototype Rewriting Primitive for Coq

We address the challenges of scaling verification efforts to match the i...
research
08/19/2021

Towards an Automatic Proof of Lamport's Paxos

Lamport's celebrated Paxos consensus protocol is generally viewed as a c...
research
11/19/2021

Modeling and Analysis of the Landing Gear System with the Generalized Contracts

Nowadays, there are several complex systems in different sectors such as...

Please sign up or login with your details

Forgot password? Click here to reset