Logical approximation for program analysis

DOI10.1007/S10990-011-9071-2zbMath1256.68045DBLPjournals/lisp/SimmonsP11OpenAlexW2025317149WikidataQ58158266 ScholiaQ58158266MaRDI QIDQ1929363

Robert J. Simmons, Frank Pfenning

Publication date: 8 January 2013

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Logical_approximation_for_program_analysis/6607040

zbMATH Keywords

program analysisabstract interpretationlogical frameworksordered linear logicsubstructural operational semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Structural Focalization ⋮ Logical approximation for program analysis

Uses Software

• K tool
• K-Maude
• K Prover
• Lolli

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forum: A multiple-conclusion specification logic
• Relating state-based and process-based concurrency through linear logic (full-version)
• The rewriting logic semantics project
• Language in action. Categories, lambdas and dynamic logic
• Flattening and saturation: Two representation changes for generalization
• Logic programming in a fragment of intuitionistic linear logic
• Logical approximation for program analysis
• Uniform proofs as a foundation for logic programming
• Principles and implementation of deductive parsing
• The Mathematics of Sentence Structure
• On the complexity analysis of static analyses
• Linear Logical Algorithms
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• Logic Programming with Focusing Proofs in Linear Logic
• An effective fixpoint semantics for linear logic programs
• Model checking linear logic specifications
• Abstract Interpreters for Free
• K-Maude: A Rewriting Based Tool for Semantics of Programming Languages
• Relating complexity and precision in control flow analysis
• Abstracting abstract machines
• Types for Proofs and Programs
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Linguistic application of first order intuitionistic linear logic

This page was built for publication: Logical approximation for program analysis