Compositional verification of heap-manipulating programs through property-guided learning
Analyzing and verifying heap-manipulating programs automatically is challenging. A key for fighting the complexity is to develop compositional methods. For instance, many existing verifiers for heap-manipulating programs require user-provided specification for each function in the program in order t...
Saved in:
Main Authors: | PHAM, Long H., SUN, Jun, LOC LE, Quang |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2019
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4639 https://ink.library.smu.edu.sg/context/sis_research/article/5642/viewcontent/Pham2019_Chapter_CompositionalVerificationOfHea.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Concolic testing heap-manipulating programs
by: PHAM, Long H., et al.
Published: (2019) -
Enhancing symbolic execution of heap-based programs with separation logic for test input generation
by: PHAM, Long H., et al.
Published: (2019) -
Satisfiability modulo heap-based programs
by: LE, Quang Loc, et al.
Published: (2016) -
Structured specifications for better verification of heap-manipulating programs
by: Gherghina, C., et al.
Published: (2013) -
Automatically refining partial specifications for heap-manipulating programs
by: Qin, S., et al.
Published: (2014)