Systematic abstraction of abstract machines

DOI10.1017/S0956796812000238zbMath1252.68123arXiv1107.3539MaRDI QIDQ3165529

David A. Vanhorn, Matthew Might

Publication date: 29 October 2012

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.3539

zbMATH Keywords

abstract machineabstract interpretationimperative programming languageshigher-order programming languages

Mathematics Subject Classification ID

Related Items (1)

Higher order symbolic execution for contract verification and refutation

Uses Software

• Haskell
• PLT Redex

Cites Work

• Unnamed Item
• Flow analysis of lazy higher-order functional programs
• A functional correspondence between call-by-need evaluators and lazy abstract machines
• A call-by-name lambda-calculus machine
• Control-flow analysis of functional programs
• CFA2: a Context-Free Approach to Control-Flow Analysis
• Abstracting abstract machines
• A concrete framework for environment machines
• Modular set-based analysis from contracts
• Types and trace effects of higher order programs
• Improving flow analyses via ΓCFA
• The Mechanical Evaluation of Expressions
• Control-flow analysis of function calls and returns by abstract interpretation

This page was built for publication: Systematic abstraction of abstract machines