Sciweavers

PEPM
2009
ACM

Linear logical approximations

14 years 8 months ago
Linear logical approximations
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
Added 17 Mar 2010
Updated 17 Mar 2010
Type Conference
Year 2009
Where PEPM
Authors Robert J. Simmons, Frank Pfenning
Comments (0)