The AutoProof Verifier: Usability by non-experts and on standard code
Formal verification tools are often developed by experts for experts; as a result, their usability by programmers with little formal methods experience may be severely limited. In this paper, we discuss this general phenomenon with reference to AutoProof: a tool that can verify the full functional c...
Saved in:
Main Authors: | FURIA, Carlo A., POSKITT, Christopher M., TSCHANNEN, Julian |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2015
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4920 https://ink.library.smu.edu.sg/context/sis_research/article/5923/viewcontent/Furia_PT.F_IDE.2015.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Towards learning and verifying invariants of cyber-physical systems by code mutation
by: CHEN, Yuqi, et al.
Published: (2016) -
Verifying monadic second-order properties of graph programs
by: POSKITT, Christopher M., et al.
Published: (2014) -
Verifying total correctness of graph programs
by: POSKITT, Christopher M., et al.
Published: (2012) -
Towards learning and verifying invariants of cyber-physical systems by code mutation
by: CHEN, Yuqi, et al.
Published: (2016) -
Efficient and verifiable proof of replication with fast fault localization
by: YUAN, Haoran, et al.
Published: (2021)