PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Flattening and Saturation: Two Representation Changes for Generalization
Machine Learning - Special issue on evaluating and changing representation
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
A linear logic view of gamma style computations as proof searches
Coordination programming
Linear logic programming with an ordered context
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automated protocol verification in linear logic
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
On the complexity analysis of static analyses
Journal of the ACM (JACM)
Linguistic Applications of First Order Intuitionistic Linear Logic
Journal of Logic, Language and Information
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Algorithms for Equality and Unification in the Presence of Notational Definitions
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Higher-order rewriting with dependent types (lambda calculus)
Higher-order rewriting with dependent types (lambda calculus)
Automating the meta theory of deductive systems
Automating the meta theory of deductive systems
Ordered linear logic and applications
Ordered linear logic and applications
Higher-order linear logic programming of categorial deduction
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
An effective fixpoint semantics for linear logic programs
Theory and Practice of Logic Programming
Model checking linear logic specifications
Theory and Practice of Logic Programming
Context-sensitive program analysis as database queries
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Monadic concurrent linear logic programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
The rewriting logic semantics project
Theoretical Computer Science
Relating complexity and precision in control flow analysis
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Substructural Operational Semantics as Ordered Logic Programming
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
Strictly declarative specification of sophisticated points-to analyses
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Abstract interpreters for free
SAS'10 Proceedings of the 17th international conference on Static analysis
K-Maude: a rewriting based tool for semantics of programming languages
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Testing concurrent systems: an interpretation of intuitionistic logic
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A logical correspondence between natural semantics and abstract machines
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
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 interpreter 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.