Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

PEPM
2009
ACM

favoriteEmaildiscussreport

93views Software Engineering» more PEPM 2009»

Linear logical approximations

14 years 1 months ago

Linear logical approximations

Download www.cs.cmu.edu

ract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying operational semantics in a bottom-up, linear logic programming language – a technique we call substructural operational semantics (SSOS) – manifestly sound program approximations can be derived by simple and intuitive approximations of the logic program. As examples, we describe how to derive a simple alias analysis, 0CFA, and kCFA analysis from a substructural operational semantics of the relevant languages.

Robert J. Simmons, Frank Pfenning

Real-time Traffic

Approximate Semantics | Exact Semantics | PEPM 2009 | Software Engineering | Substructural Operational Semantics |

claim paper

Related Content

» Linear Approximation of Planar Spatial Databases Using TransitiveClosure Logic

» The Inverse Taylor Expansion Problem in Linear Logic

» Variable ranges in linear constraints

» Reduction Strategies for LeftLinear Term Rewriting Systems

» Approximating the Expressive Power of Logics in Finite Models

» Managing Digital Rights using Linear Logic

» An Analysis of Linear Exponentials Based on Extended Sequents

» Herbrands Theorem Skolemization and Proof Systems for FirstOrder Lukasiewicz Logic

» Control of systems integrating logic dynamics and constraints

Post Info
More Details (n/a)

Added	17 Mar 2010
Updated	17 Mar 2010
Type	Conference
Year	2009
Where	PEPM
Authors	Robert J. Simmons, Frank Pfenning

Comments (0)