DeepAI AI Chat
Log In Sign Up

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

09/03/2019

Average-based Robustness for Continuous-Time Signal Temporal Logic

We propose a new robustness score for continuous-time Signal Temporal Lo...
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...
07/29/2021

A Sketch of a Proof-Theoretic Semantics for Necessity

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

Executable Interval Temporal Logic Specifications

In this paper the reversibility of executable Interval Temporal Logic (I...
06/12/2020

Pointer Data Structure Synthesis from Answer Set Programming Specifications

We develop an inductive proof-technique to generate imperative programs ...
06/14/2022

Measuring Inconsistency in Declarative Process Specifications

We address the problem of measuring inconsistency in declarative process...
02/18/2021

Verifying Probabilistic Specifications with Functional Lagrangians

We propose a general framework for verifying input-output specifications...