A logic and decision procedure for predicate abstraction of heap-manipulating programs

Science of Computer Programming, 1998

1996

2003

Recent advances in boolean satisabilit y (SAT) solvers have made it possible to solve structured formulas on the order of a million variables. In this work we show how to ecien tly transform program analysis problems directly into SAT in- stances. The translation is similar to generating verication conditions, but we avoid exponential growth by introducing temporary variables in place

Theory and Practice of Logic Programming, 2015

Many recent analyses for conventional imperative programs begin by transforming programs into logic programs, capitalising on existing LP analyses and simple LP semantics. We propose using logic programs as an intermediate program representation throughout the compilation process. With restrictions ensuring determinism and single-modedness, a logic program can easily be transformed to machine language or other low-level language, while maintaining the simple semantics that makes it suitable as a language for program analysis and transformation. We present a simple LP language that enforces determinism and single-modedness, and show that it makes a convenient program representation for analysis and transformation.

Texts in Theoretical Computer Science. An EATCS Series, 2002

1998

En este trabajo, presentamos un operador de contracción para el caso de programas lógicos. La clase de programas tratados es la de programas lógicos normales extendidos con la negación clásica. Es decir, dichos programas contemplan tanto la negación por falla (NAF) y la negación clásica. El operador de contracción está basado en la contracción Kernel [2] de la Teoría de Cambio de creencias.

Comput. Sci. J. Moldova, 2018

A parameterized algebraic theory of instruction sequences, objects that represent the behaviours produced by instruction sequences under execution, and objects that represent the behaviours exhibited by the components of the execution environment of instruction sequences is the basis of a line of research in which issues relating to a wide variety of subjects from computer science have been rigorously investigated thinking in terms of instruction sequences. In various papers that belong to this line of research, use is made of an instantiation of this theory in which the basic instructions are instructions to read out and alter the content of Boolean registers and the components of the execution environment are Boolean registers. In this paper, we give a simplified presentation of the most general such instantiated theory.

Boolean Models and Methods in Mathematics, Computer Science, and Engineering, 2010

ACM Transactions on Programming Languages and Systems, 2010