Logic Column 12: Logical Verification and Equational Verification
Riccardo Pucella
Abstract
This article examines two approaches to verification, one based on using a logic for expressing properties of a system, and one based on showing the system equivalent to a simpler system that obviously has whatever property is of interest. Using examples such as process calculi and regular programs, the relationship between these two approaches is explored.
Create a lesson
Related papers
Timed Games under Environmental Interference with Real-Time Objectives
Andrea Manini, Matteo Rossi, Pierluigi San Pietro
Executable Specifications in Transition Algebra
Daniel Găină, Adrián Riesco, Ionuţ Ţuţu
Essential Unitarity for Higher-Order Quantum Computation (Extended Abstract)
Samson Abramsky, Radha Jagadeesan
Sundance: A Simple SMT Solver for Program Verification
Amar Shah, Benjamin F. Jones, Can Cebeci et al.
Global Trace Condition for Injective Transition Graphs
Stefano Berardi, Ugo de'Liguoro, Daniel Osorio-Valencia
Aero-VPA: Few-Step Flow-Matching Control over Non-Reconstructive JEPA Latents for Agile Flight on Edge Hardware
Yeonseok Lee