Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor)
 

Summary: Higher-Order and Symbolic Computation manuscript No.
(will be inserted by the editor)
Logical approximation for program analysis
Robert J. Simmons Frank Pfenning
Received: March 2, 2010 / Revised: November 7, 2010 / Accepted: January 10, 2011
Abstract The abstract interpretation of programs relates the exact semantics of a
programming language to a finite approximation of those semantics. In this article,
we describe an approach to abstract interpretation that is based in logic and logic
programming.
Our approach consists of faithfully representing a transition system within logic
and then manipulating this initial specification to create a logical approximation of
the original specification. The objective is to derive a logical approximation that can
be interpreted as a terminating forward-chaining logic program; this ensures that the
approximation is finite and that, furthermore, an appropriate logic programming in-
terpreter can implement the derived approximation.
We are particularly interested in the specification of the operational semantics of
programming languages in ordered logic, a technique we call substructural operational
semantics (SSOS). We show that manifestly sound control flow and alias analyses
can be derived as logical approximations of the substructural operational semantics of
relevant languages.

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University
Pfenning, Frank - School of Computer Science, Carnegie Mellon University

 

Collections: Computer Technologies and Information Sciences; Mathematics