Crimp is introduced, a generic higher-order function formalised over a non-standard separation algebra that can be instantiated to capture diverse order-invariant properties of varied imperative data structures and gives rise to a natural separation logic, indexical separation logic, for localising and reflecting state updates without inductive proof.
This work presents a deductive verification framework based on a weighted assertion language and an intermediate verification language, whose weight domains are ordered structures with implication and coimplication, which let verification conditions express lower- and upper-bound obligations internally.
Emma Ahrens, Samuel Rode, Philipp Schröer et al.· 0 citations
This work introduces DueList, an abstraction-refinement approach geared towards list reasoning, which is implemented on top of off-the-shelf SMT solvers and extends reasoning facilities of existing solvers, allowing to conclude about the (un)satisfiability of a larger range of problems, while outperforming existing sol...
Pierre Goutagny, Aymeric Fromherz, Raphaël Monat· 0 citations
A QuickCheck testing method based on generating and shrinking random execution traces based on checking if the first and last terms of a generated trace share the same deterministic normal form that efficiently finds counterexamples and enables fast, robust shrinking.
Koen Claessen· Proc. ACM Program. Lang.· 0 citations
A coNEXPTIME upper bound for the validity problem of RmbC and a coNP-hardness lower bound are established, and coNP-completeness for the principal extensions containing one of the six minimal explosive pairs are proved.
Modelling of mutable state spaces and precisely describing how variables are manipulated in a program is a fundamental problem in compositional verification. Though we can make use of the embedded abstract syntax of a program for such analysis, this runs contrary to the shallow-embedding approach, and hampers efficient...
Simon Foster, Carlos Isasa, Christian Pardillo Laursen· 0 citations
This work considers a definitional fragment of Temporal Equilibrium Logic, which allows to capture temporal rules that contain complex (implication-free) temporal formulas in rule bodies, and shows how the set of all stable models of a theory can be represented as a non-deterministic finite state automaton (NFA).
M. Šimkus· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
