Formal Verification and System Assurance

Report on Current Developments in Formal Verification and System Assurance

General Direction of the Field

The recent advancements in formal verification and system assurance reflect a significant shift towards more sophisticated, automated, and context-aware methodologies. The field is increasingly focused on integrating advanced logical frameworks with practical applications, particularly in cyber-physical systems and autonomous technologies. Key developments include the adaptation of temporal logics for runtime verification, the extension of formal methods to handle imperfect information, and the automation of semantic analysis in system assurance cases. These innovations aim to enhance the robustness and reliability of complex systems by detecting nuanced violations of safety properties early in the development cycle and by providing scalable solutions to verification challenges.

Innovative Work and Results

The use of Event Calculus and Answer Set Programming for early validation of system requirements stands out for its potential to significantly reduce the cost of fixing specification errors. This methodology not only facilitates deductive and abductive reasoning on a conceptual level but also addresses scalability issues through novel techniques.

Another notable advancement is the extension of runtime verification to accommodate scenarios with imperfect information, which is crucial for autonomous systems operating in real-world environments. This work not only updates the verification pipeline to handle rational monitoring but also demonstrates its implementation in robotic systems, showcasing its practical applicability.

Noteworthy Papers

  • "Early Validation of High-level System Requirements with Event Calculus and Answer Set Programming" introduces a groundbreaking approach for early detection of safety violations, significantly reducing development costs.
  • "Runtime Verification via Rational Monitor with Imperfect Information" extends traditional runtime verification to handle imperfect data, enhancing the reliability of autonomous systems in real-world scenarios.

Sources

Early Validation of High-level System Requirements with Event Calculus and Answer Set Programming

Branching Bisimilarity for Processes with Time-outs

Proving Cutoff Bounds for Safety Properties in First-Order Logic

Runtime Verification via Rational Monitor with Imperfect Information

Invariants for One-Counter Automata with Disequality Tests

Automating Semantic Analysis of System Assurance Cases using Goal-directed ASP

CTL* Verification and Synthesis using Existential Horn Clauses

The Bright Side of Timed Opacity

Greybox Learning of Languages Recognizable by Event-Recording Automata

LOUD: Synthesizing Strongest and Weakest Specifications

Input-based Framework for Three-valued Abstraction Refinement

A Formal, Symbolic Analysis of the Matrix Cryptographic Protocol Suite

Tamgram: A Frontend for Large-scale Protocol Modeling in Tamarin