Runtime Verification of Spatio-Temporal Specification Language

2021 ◽  
Author(s):  
Tengfei Li ◽  
Jing Liu ◽  
Haiying Sun ◽  
Xiaohong Chen ◽  
Ling Yin ◽  
...  
Keyword(s):  
Runtime Verification ◽  
Specification Language ◽  
Spatio Temporal ◽  
Temporal Specification

scholarly journals A spatio-temporal specification language and its completeness & decidability

2020 ◽  
Vol 9 (1) ◽  
Author(s):  
Tengfei Li ◽  
Jing Liu ◽  
Haiying Sun ◽  
Xiang Chen ◽  
Lipeng Zhang ◽  
...  
Keyword(s):  
Intelligent Transportation System ◽  
Cyber Physical Systems ◽  
Specification Language ◽  
Finite Model ◽  
Critical Systems ◽  
Physical Systems ◽  
Spatial Objects ◽  
Temporal Properties ◽  
Spatio Temporal ◽  
Temporal Specification

AbstractIn the past few years, significant progress has been made on spatio-temporal cyber-physical systems in achieving spatio-temporal properties on several long-standing tasks. With the broader specification of spatio-temporal properties on various applications, the concerns over their spatio-temporal logics have been raised in public, especially after the widely reported safety-critical systems involving self-driving cars, intelligent transportation system, image processing. In this paper, we present a spatio-temporal specification language, STSL PC, by combining Signal Temporal Logic (STL) with a spatial logic S4 u, to characterize spatio-temporal dynamic behaviors of cyber-physical systems. This language is highly expressive: it allows the description of quantitative signals, by expressing spatio-temporal traces over real valued signals in dense time, and Boolean signals, by constraining values of spatial objects across threshold predicates. STSL PC combines the power of temporal modalities and spatial operators, and enjoys important properties such as finite model property. We provide a Hilbert-style axiomatization for the proposed STSL PC and prove the soundness and completeness by the spatio-temporal extension of maximal consistent set and canonical model. Further, we demonstrate the decidability of STSL PC and analyze the complexity of STSL PC. Besides, we generalize STSL to the evolution of spatial objects over time, called STSL OC, and provide the proof of its axiomatization system and decidability.

scholarly journals E-ACSL, a Runtime Verification Tool for Safety and Security of C Programs (tool paper)

10.29007/fpdh ◽  
2018 ◽  
Author(s):  
Julien Signoles ◽  
Nikolai Kosmatov ◽  
Kostyantyn Vorobyov
Keyword(s):  
Formal Specification ◽  
Runtime Verification ◽  
Specification Language ◽  
Formal Specifications ◽  
C Programs ◽  
Verification Tool ◽  
Security Properties ◽  
C Program ◽  
Formal Properties ◽  
Formal Specification Language

This tool paper presents E-ACSL, a runtime verification tool for C programs capable of checking a broad range of safety and security properties expressed using a formal specification language. E-ACSL consumes a C program annotated with formal specifications and generates a new C program that behaves similarly to the original if the formal properties are satisfied, or aborts its execution whenever a property does not hold. This paper presents an overview of E-ACSL and its specification language.

scholarly journals Closing the Gap Between Specification and Programming: VDM++ and Scala

10.29007/2w2f ◽  
2018 ◽  
Author(s):  
Klaus Havelund
Keyword(s):  
Temporal Logic ◽  
Programming Language ◽  
Runtime Verification ◽  
Specification Language ◽  
State Machines ◽  
Closing The Gap ◽  
High Level ◽  
Modern Programming Language

We argue that a modern programming language such as Scala offers a level of succinctness, which makes it suitable for program and systems specification as well as for high-level programming. We illustrate this by comparing the language with the VDM++ specification language. The comparison also identifies areas where Scala perhaps could be improved, inspired by VDM++. We furthermore illustrate Scala's potential as a specification language by augmenting it witha combination of parameterized state machines and temporal logic, defined as a library, thereby forming an expressive but simple runtime verification framework.

scholarly journals Spatio-temporal specification of olfactory bulb interneurons

2007 ◽  
Vol 38 (6) ◽  
pp. 563-569 ◽  
Author(s):  
Serena Bovetti ◽  
Paolo Peretto ◽  
Aldo Fasolo ◽  
Silvia De Marchis
Keyword(s):  
Olfactory Bulb ◽  
Spatio Temporal ◽  
Temporal Specification

scholarly journals Do You Need Infinite Time?

2019 ◽  
Author(s):  
Alessandro Artale ◽  
Andrea Mazzullo ◽  
Ana Ozaki
Keyword(s):  
Temporal Logic ◽  
Planning Process ◽  
Description Logics ◽  
Automated Planning ◽  
Linear Temporal Logic ◽  
Runtime Verification ◽  
Process Modelling ◽  
Infinite Time ◽  
First Order ◽  
Temporal Specification

Linear temporal logic over finite traces is used as a formalism for temporal specification in automated planning, process modelling and (runtime) verification. In this paper, we investigate first-order temporal logic over finite traces, lifting some known results to a more expressive setting. Satisfiability in the two-variable monodic fragment is shown to be EXPSPACE-complete, as for the infinite trace case, while it decreases to NEXPTIME when we consider finite traces bounded in the number of instants. This leads to new complexity results for temporal description logics over finite traces. We further investigate satisfiability and equivalences of formulas under a model-theoretic perspective, providing a set of semantic conditions that characterise when the distinction between reasoning over finite and infinite traces can be blurred. Finally, we apply these conditions to planning and verification.

Sign in / Sign up

Export Citation Format

Share Document