Constraint specialisation in Horn clause verification

B Kafle, JP Gallagher - Proceedings of the 2015 Workshop on Partial …, 2015 - dl.acm.org
We present a method for specialising the constraints in constrained Horn clauses with
respect to a goal. We use abstract interpretation to compute a model of a query-answer …

Proving the equivalence of higher-order terms by means of supercompilation

I Klyuchnikov, S Romanenko - International Andrei Ershov Memorial …, 2009 - Springer
One of the applications of supercompilation is proving properties of programs. We focus in
this paper on a specific task: proving term equivalence for a higher-order lazy functional …

Monotonic abstraction: on efficient verification of parameterized systems

PA Abdulla, G Delzanno, NB Henda… - International Journal of …, 2009 - World Scientific
We introduce the simple and efficient method of monotonic abstraction to prove safety
properties for parameterized systems with linear topologies. A process in the system is a …

Optimal decentralized controllers for spatially invariant systems

P Voulgaris, G Bianchini… - Proceedings of the 39th …, 2000 - ieeexplore.ieee.org
We consider the problem of optimal H/sub 2/design of semi-decentralized controllers for a
special class of spatially distributed systems. This class includes spatially invariant and …

A Java supercompiler and its application to verification of cache-coherence protocols

AV Klimov - Perspectives of Systems Informatics: 7th International …, 2010 - Springer
Abstract The Java Supercompiler (JScp) is a specializer of Java programs based on the
Turchin's supercompilation method and extended to support imperative and object-oriented …

Proving correctness of imperative programs by linearizing constrained Horn clauses

E De Angelis, F Fioravanti, A Pettorossi… - Theory and Practice of …, 2015 - cambridge.org
We present a method for verifying the correctness of imperative programs which is based on
the automated transformation of their specifications. Given a program prog, we consider a …

Solving coverability problem for monotonic counter systems by supercompilation

AV Klimov - Perspectives of Systems Informatics: 8th International …, 2012 - Springer
We put the program transformation method known as supercompilation in the context of
works on counter systems, well-structured transition systems, Petri nets, etc. Two classic …

Towards verification via supercompilation

A Lisitsa, A Nemytykh - 29th Annual International Computer …, 2005 - ieeexplore.ieee.org
Supercompilation, or supervised compilation is a technique for program specialization,
optimization and, more generally, program transformation. We present an idea to use …

[PDF][PDF] Automatic verification of counter systems via domain-specific multi-result supercompilation

AV Klimov, IG Klyuchnikov, SA Romanenko - Preprint, 2012 - pat.keldysh.ru
We consider an application of supercompilation to the analysis of counter systems. Multi-
result supercompilation enables us to find the best versions of the analysis by generating a …

A note on specialization of interpreters

A Lisitsa, AP Nemytykh - … International Symposium on Computer Science in …, 2007 - Springer
Given a program with two arguments p (x, y). Let the first argument x 0 be fixed. The aim of
program specialization with respect to the known x 0 is to construct an optimized program P …