Enhancing Inductive Entailment Proofs in Separation Logic with Lemma Synthesis

10/17/2017
by   Quang Loc Le, et al.
0

This paper presents an approach to lemma synthesis to support advanced inductive entailment procedures based on separation logic. We first propose a mechanism where lemmas are automatically proven and systematically applied. The lemmas may include universal guard and/or unknown predicate. While the former is critical for expressivity, the latter is essential for supporting relationships between multiple predicates. We further introduce lemma synthesis to support (i) automated inductive reasoning together with frame inference and (ii) theorem exploration. For (i) we automatically discover and prove auxiliary lemmas during an inductive proof; and for (ii) we automatically generate a useful set of lemmas to relate user-defined or system-generated predicates. We have implemented our proposed approach into an existing verification system and tested its capability in inductive reasoning and theorem exploration. The experimental results show that the enhanced system can automatically synthesize useful lemmas to facilitate reasoning on a broad range of non-trivial inductive proofs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/26/2017

Automated Lemma Synthesis in Symbolic-Heap Separation Logic

The symbolic-heap fragment of separation logic has been actively develop...
research
09/07/2021

Conjectures, Tests and Proofs: An Overview of Theory Exploration

A key component of mathematical reasoning is the ability to formulate in...
research
10/02/2022

An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic

An efficient entailment proof system is essential to compositional verif...
research
09/21/2020

Synthesizing Lemmas for Inductive Reasoning

Recursively defined structures and properties about them are naturally e...
research
01/04/2012

Sciduction: Combining Induction, Deduction, and Structure for Verification and Synthesis

Even with impressive advances in automated formal methods, certain probl...
research
06/16/2019

Self-organized inductive reasoning with NeMuS

Neural Multi-Space (NeMuS) is a weighted multi-space representation for ...
research
03/28/2014

E-Generalization Using Grammars

We extend the notion of anti-unification to cover equational theories an...

Please sign up or login with your details

Forgot password? Click here to reset