Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification

@article{Angelis2019ProvingPO,
  title={Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification},
  author={Emanuele De Angelis and Fabio Fioravanti and Alberto Pettorossi and Maurizio Proietti},
  journal={ArXiv},
  year={2019},
  volume={abs/1907.03999},
  pages={48-75}
}
  • Emanuele De Angelis, Fabio Fioravanti, +1 author Maurizio Proietti
  • Published in CILC 2019
  • Mathematics, Computer Science
  • The proof of a program property can be reduced to the proof of satisfiability of a set of constrained Horn clauses (CHCs) which can be automatically generated from the program and the property. In this paper we have conducted a case study in Horn clause verification by considering several sorting programs with the aim of exploring the effectiveness of a transformation technique which allows us to eliminate inductive data structures such as lists or trees. If this technique is successful, we… CONTINUE READING

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

    References

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

    Transformations of CLP Modules

    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL

    Unfold/Fold Transformation of Logic Programs

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    Solving Constrained Horn Clauses Using Syntax and Data

    VIEW 1 EXCERPT

    The ELDARICA Horn Solver

    VIEW 2 EXCERPTS

    Predicate Pairing for Program Verification

    VIEW 1 EXCERPT