Internal models of system F for decompilation
From MaRDI portal
Publication:428882
DOI10.1016/J.TCS.2012.02.022zbMATH Open1244.68025OpenAlexW2008950540MaRDI QIDQ428882FDOQ428882
Authors: Stefano Berardi, Makoto Tatsuta 
Publication date: 25 June 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.022
Recommendations
- Analysis of executable software models
- Partitioned memory models for program analysis
- scientific article; zbMATH DE number 1973219
- Verified abstract interpretation techniques for disassembling low-level self-modifying code
- Verified abstract interpretation techniques for disassembling low-level self-modifying code
- scientific article; zbMATH DE number 1708152
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The system \({\mathcal F}\) of variable types, fifteen years later
- Title not available (Why is that?)
- Building continuous webbed models for system F
- A full continuous model of polymorphism
- Simple Types in Type Theory: Deep and Shallow Encodings
- Typed Applicative Structures and Normalization by Evaluation for System F ω
- Constructive natural deduction and its ‘ω-set’ interpretation
- Title not available (Why is that?)
- βη-complete models for System F
- Operational aspects of untyped Normalisation by Evaluation
- Explicit substitutions with de bruijn's levels
- Weak βη-Normalization and Normalization by Evaluation for System F
Cited In (2)
This page was built for publication: Internal models of system F for decompilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428882)
