Heap-bounded assembly language

DOI10.1023/B:JARS.0000021014.79255.33MaRDI QIDQ1826469zbMATH OpenOpenAlexFDO

Authors D. Aspinall, Adriana Compagnoni

Publication date 6 August 2004

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:jars.0000021014.79255.33

zbMATH Keywords

proof-carrying codetyped assembly language

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Stack-based typed assembly language
• A dependently typed assembly language
• Theoretical Computer Science
• Structuring the verification of heap-manipulating programs
• Algorithms and Data Structures

Cited in

(4)

• Stack-based typed assembly language
• Verification, Model Checking, and Abstract Interpretation
• A type system with usage aspects
• A dependently typed assembly language

This page was built for publication: Heap-bounded assembly language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1826469)