Proving or Disproving likely Invariants with Constraint Reasoning

Simple item page
dc.creatorDenmat, Tristan
dc.creatorGotlieb, Arnaud
dc.creatorDucasse, Mireille
dc.date2005-08-24
dc.date.accessioned2026-07-07T03:23:22Z
dc.date.available2026-07-07T03:23:22Z
dc.descriptionA program invariant is a property that holds for every execution of the program. Recent work suggest to infer likely-only invariants, via dynamic analysis. A likely invariant is a property that holds for some executions but is not guaranteed to hold for all executions. In this paper, we present work in progress addressing the challenging problem of automatically verifying that likely invariants are actual invariants. We propose a constraint-based reasoning approach that is able, unlike other approaches, to both prove or disprove likely invariants. In the latter case, our approach provides counter-examples. We illustrate the approach on a motivating example where automatically generated likely invariants are verified.
dc.descriptionIn A. Serebrenik and S. Munoz-Hernandez (editors), Proceedings of the 15th Workshop on Logic-based methods in Programming Environments October 2005, Sitges. cs.PL/0508078
dc.identifierhttps://arxiv.org/abs/cs/0508108
dc.identifierhttp://arxiv.org/abs/cs/0508108
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32917
dc.subjectSoftware Engineering
dc.subjectProgramming Languages
dc.subjectD.2.6
dc.titleProving or Disproving likely Invariants with Constraint Reasoning
dc.typetext

Files

Collections

arXiv