Verification of Locally Tight Programs

04/18/2022
by   Jorge Fandinno, et al.
0

ANTHEM is a proof assistant that can be used for verifying the correctness of tight programs in the input language of the answer set grounder GRINGO with respect to specifications expressed by first-order formulas. We define the concept of a locally tight program and prove that the verification process used by ANTHEM is applicable in this more general setting. Unlike tightness, the local tightness condition allows some forms of recursion. In particular, some programs describing effects of actions are locally tight. Under consideration for publication in Theory and Practice of Logic Programming

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2020

From Well Structured Transition Systems to Program Verification

We describe the use of the theory of WSTS for verifying programs....
research
08/05/2020

Verifying Tight Logic Programs with anthem and Vampire

This paper continues the line of research aimed at investigating the rel...
research
07/22/2022

CoqQ: Foundational Verification of Quantum Programs

CoqQ is a framework for reasoning about quantum programs in the Coq proo...
research
06/04/2021

Verification Tools for Checking some kinds of Testability

A locally testable language L is a language with the property that for s...
research
04/26/2018

First-order answer set programming as constructive proof search

We propose an interpretation of the first-order answer set programming (...
research
10/24/2019

What's Decidable About Program Verification Modulo Axioms?

We consider the decidability of the verification problem of programs mod...
research
02/13/2018

A Concurrent Constraint Programming Interpretation of Access Permissions

A recent trend in object oriented (OO) programming languages is the use ...

Please sign up or login with your details

Forgot password? Click here to reset