.png){kind=icon}
Return
Dependent Assertion Logic for Modular Software Verification
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-031-98208-8_3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Software is often not designed for formal specification using method contracts (without source refactoring). As solution, we propose dependent assertions, a generalization of method contracts. Our formalization uses the propositional dynamic logic PDL but with Dijkstra's dynamic indices instead of programs inside modal operators. For deductive verification based on a new symbolic execution approach, we outline a sequent calculus to prove basic dependent assertions, including loop invariants. Finally, we can use any (D)PDL solver to prove modular contracts from basic dependencies and other contracts.
Keywords:
PROPOSITIONAL DYNAMIC LOGIC
Journal
T
IF:
0
Papers:
17
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more