Necessity Specifications for Robustness

09/17/2022
by   Julian Mackay, et al.
0

Robust modules guarantee to do only what they are supposed to do - even in the presence of untrusted, malicious clients, and considering not just the direct behaviour of individual methods, but also the emergent behaviour from calls to more than one method. Necessity is a language for specifying robustness, based on novel necessity operators capturing temporal implication, and a proof logic that derives explicit robustness specifications from functional specifications. Soundness and an exemplar proof are mechanised in Coq.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/03/2019

Average-based Robustness for Continuous-Time Signal Temporal Logic

We propose a new robustness score for continuous-time Signal Temporal Lo...
research
12/21/2022

RobTL: A Temporal Logic for the Robustness of Cyber-Physical Systems

We propose the Robustness Temporal Logic (RobTL), a novel temporal logic...
research
07/29/2021

A Sketch of a Proof-Theoretic Semantics for Necessity

This paper considers proof-theoretic semantics for necessity within Dumm...
research
05/07/2021

Executable Interval Temporal Logic Specifications

In this paper the reversibility of executable Interval Temporal Logic (I...
research
06/14/2022

Measuring Inconsistency in Declarative Process Specifications

We address the problem of measuring inconsistency in declarative process...
research
04/04/2023

Signal Temporal Logic Meets Convex-Concave Programming: A Structure-Exploiting SQP Algorithm for STL Specifications

This study considers the control problem with signal temporal logic (STL...
research
08/25/2022

A logical theory for conditional weak ontic necessity based on context update

Weak ontic necessity is the ontic necessity expressed by “should” or “ou...

Please sign up or login with your details

Forgot password? Click here to reset