Desired computer-program properties can be described by logical formulas called verification conditions. Different mathematically-equivalent forms of these verification conditions can have a great impact on the performance of an automatic theorem prover that tries to discharge them. This paper presents a simple weakest-precondition understanding of the ESC/Java technique for generating verifica...

Abstract Many problems in program verification, Model Checking, and type inference are naturally expressed as satisfiability of a verification condition fragment First-Order Logic called Constrained Horn Clauses (CHC). This transforms analysis tasks to the realm first order into SMT solvers. In this paper, we give brief overview how CHCs capture for sequential imperative programs, discuss CHC s...

We propose a novel framework of program and invariant synthesis called neural network-guided synthesis. first show that, by suitably designing training networks, we can extract logical formulas over integers from the weights biases trained networks. Based on idea, have implemented tool to synthesize positive/negative examples implication constraints, obtained promising experimental results. als...

Relational program logics are formalisms for specifying and verifying properties about two programs or two runs of the same program. These properties range from correctness of compiler optimizations or equivalence between two implementations of an abstract data type, to properties like non-interference or determinism. Yet the current technology for relational verification remains underdeveloped...

We explore an approach to verification of programs via program transformation applied to an interpreter of a programming language. A specialization technique known as Turchin’s supercompilation is used to specialize some interpreters with respect to the program models. We show that several safety properties of functional programs modeling a class of cache coherence protocols can be proved by a ...