Advances in Formal Methods for Program Verification and Analysis

The field of formal methods is moving towards the development of more efficient and scalable techniques for program verification and analysis. Researchers are exploring new approaches to model checking, runtime verification, and abstract interpretation, with a focus on improving precision and reducing complexity. One notable trend is the integration of formal methods with other areas of computer science, such as programming languages and software engineering. This has led to the development of new tools and frameworks that can handle real-world programs and systems. Noteworthy papers in this area include: Model Checking as Program Verification by Abstract Interpretation, which introduces a new approach to model checking via abstract interpretation of Kleene Algebras. Monitorability for the Modal mu-Calculus over Systems with Data, which studies the monitorability of an extension of the modal mu-calculus that allows one to express properties of the data flow. Verification of the Release-Acquire Semantics, which tackles the verification problem of checking whether all allowed program runs are consistent with a memory model.

Sources

Model Checking as Program Verification by Abstract Interpretation (Extended Version)

An Execution Model for RICE

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory

Compiling Metric Temporal Answer Set Programming

Verification of the Release-Acquire Semantics

System ASPMT2SMT:Computing ASPMT Theories by SMT Solvers

Solving Package Management via Hypergraph Dependency Resolution

Built with on top of