Incorrectness logic for graph programs
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 Author: | POSKITT, Christopher M. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6582 https://ink.library.smu.edu.sg/context/sis_research/article/7585/viewcontent/incorrectness_logic_icgt21.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Monadic second-order incorrectness logic for GP 2
by: POSKITT, Christopher M., et al.
Published: (2023) -
A graph-based semantics workbench for concurrent Asynchronous programs
by: CORRODI, Claudio, et al.
Published: (2016) -
An interference-free programming model for network objects
by: SCHILL, Mischael, et al.
Published: (2016) -
PerfLearner: learning from bug reports to understand and generate performance test frames
by: HAN, Xue, et al.
Published: (2018) -
Bug characteristics in blockchain systems: A large-scale empirical study
by: WAN, Zhiyuan, et al.
Published: (2017)