Monadic second-order incorrectness logic for GP 2

Monadic second-order incorrectness logic for GP 2

Program logics typically reason about an over-approximation of program behaviour to prove the absence of bugs. Recently, program logics have been proposed that instead prove the presence of bugs by means of under-approximate reasoning, which has the promise of better scalability. In this paper, we p...

Full description

Saved in:
Bibliographic Details
Main Authors: POSKITT, Christopher M., PLUMP, Detlef
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2023
Subjects:
Program logics
correctness proofs
under-approximate reasoning
monadic second-order logic
graph transformation
Software Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/7335
https://ink.library.smu.edu.sg/context/sis_research/article/8338/viewcontent/mso_incorrectness_logic_jlamp23.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/7335
https://ink.library.smu.edu.sg/context/sis_research/article/8338/viewcontent/mso_incorrectness_logic_jlamp23.pdf

Similar Items