Removing Unnecessary Variables from Horn Clause Verification Conditions

@inproceedings{Angelis2016RemovingUV,
  title={Removing Unnecessary Variables from Horn Clause Verification Conditions},
  author={Emanuele De Angelis and Fabio Fioravanti and Alberto Pettorossi and Maurizio Proietti},
  booktitle={HCVS@ETAPS},
  year={2016}
}
  • Emanuele De Angelis, Fabio Fioravanti, +1 author Maurizio Proietti
  • Published in HCVS@ETAPS 2016
  • Computer Science
  • Verification conditions (VCs) are logical formulas whose satisfiability guarantees program correctness. We consider VCs in the form of constrained Horn clauses (CHC) which are automatically generated from the encoding of (an interpreter of) the operational semantics of the programming language. VCs are derived through program specialization based on the unfold/fold transformation rules and, as it often happens when specializing interpreters, they contain unnecessary variables, that is… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    1
    Twitter Mention

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES

    Redundant Argument Filtering of Logic Programs

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    2014):Program Verification via Iterated Specialization

    • E. De Angelis, F. Fioravanti, A. Pettorossi, M. Proietti
    • Science of Computer Programming
    • 2014
    VIEW 1 EXCERPT

    Abstract Interpretation of PIC Programs through Logic Programming

    VIEW 1 EXCERPT