Parameterized Dynamic Logic -- Towards A Cyclic Logical Framework for General Program Specification and Verification
Yuanrui Zhang

TL;DR
This paper introduces DLp, a parameterized dynamic logic framework that explicitly models program configurations for flexible, symbolic, and cyclic reasoning about diverse program behaviors, enhancing verification processes.
Contribution
DLp is a novel dynamic logic with explicit program configurations and cyclic proof structures, enabling more general and flexible program specification and verification.
Findings
Formal proof of DLp's soundness
Supports symbolic execution with explicit program states
Reduces complexity in verifying diverse program models
Abstract
We present a theory of parameterized dynamic logic, namely DLp, for specifying and reasoning about a rich set of program models based on their transitional behaviours. Different from most dynamic logics that deal with regular expressions or a particular type of formalisms, DLp introduces a type of labels called "program configurations" as explicit program status for symbolic executions, allowing programs and formulas to be of arbitrary forms according to interested domains. This characteristic empowers dynamic logical formulas with a direct support of symbolic-execution-based reasoning, while still maintaining reasoning based on syntactic structures in traditional dynamic logics through a rule-lifting process. We propose a proof system and build a cyclic preproof structure special for DLp, which guarantees the soundness of infinite proof trees induced by symbolically executing programs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Formal Methods in Verification
