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...
Saved in:
Main Authors: | POSKITT, Christopher M., PLUMP, Detlef |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2023
|
Subjects: | |
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 |
Similar Items
-
Incorrectness logic for graph programs
by: POSKITT, Christopher M.
Published: (2021) -
Verifying monadic second-order properties of graph programs
by: POSKITT, Christopher M., et al.
Published: (2014) -
A Hoare calculus for graph programs
by: POSKITT, Christopher M., et al.
Published: (2010) -
Verifying total correctness of graph programs
by: POSKITT, Christopher M., et al.
Published: (2012) -
A theory of regular MSC languages
by: Henriksen, J.G., et al.
Published: (2013)