On the public citation graph

Stack-based Typed Assembly Language

https://doi.org/10.1007/bfb0055511
0 signed · 83 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-54444-5_83openalex-snapshot
Standard ML of New Jersey
inferredcites →https://doi.org/10.1007/bf01807505openalex-snapshot
Callee-save registers in continuation-passing style
inferredcites →https://doi.org/10.1016/0890-5401(91)90055-7openalex-snapshot
Inheritance as implicit coercion
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1017/s095679680000157xopenalex-snapshot
Empirical and analytic study of stack versus heap cost for languages with closures
inferredcites →https://doi.org/10.1093/comjnl/6.4.308openalex-snapshot
The Mechanical Evaluation of Expressions
inferredcites →https://doi.org/10.1145/13310.13333openalex-snapshot
ORBIT: an optimizing compiler for scheme
inferredcites →https://doi.org/10.1145/143165.143205openalex-snapshot
Unboxed objects and polymorphic typing
inferredcites →https://doi.org/10.1145/174675.174710openalex-snapshot
Memory subsystem performance of programs using copying garbage collection
inferredcites →https://doi.org/10.1145/174675.177855openalex-snapshot
Implementation of the typed call-by-value λ-calculus using a stack of regions
inferredcites →https://doi.org/10.1145/199448.199452openalex-snapshot
Using functor categories to generate intermediate code
inferredcites →https://doi.org/10.1145/199448.199517openalex-snapshot
A formal model and specification language for procedure calling conventions
inferredcites →https://doi.org/10.1145/210126.210129openalex-snapshot
Memory system performance of programs with intensive heap allocation
inferredcites →https://doi.org/10.1145/231379.231414openalex-snapshot
TIL
inferredcites →https://doi.org/10.1145/237721.237771openalex-snapshot
From region inference to von Neumann machines via region representation inference
inferredcites →https://doi.org/10.1145/237721.237791openalex-snapshot
Typed closure conversion
inferredcites →https://doi.org/10.1145/258948.258958openalex-snapshot
Flexible representation analysis
inferredcites →https://doi.org/10.1145/258948.258961openalex-snapshot
Foundations for the implementation of higher-order subtyping
inferredcites →https://doi.org/10.1145/258949.258952openalex-snapshot
Strongly typed flow-directed representation transformations (extended abstract)
inferredcites →https://doi.org/10.1145/268946.268954openalex-snapshot
From system F to typed assembly language
inferredcites →https://doi.org/10.1145/268946.268959openalex-snapshot
A type system for Java bytecode subroutines
inferredcites →https://doi.org/10.1145/75277.75303openalex-snapshot
Continuation-passing, closure-passing style
inferredcites →https://doi.org/10.1145/800087.802786openalex-snapshot
Continuation-based multiprocessing
inferredcites →https://doi.org/10.1145/93542.93554openalex-snapshot
Representing control in the presence of first-class continuations
inferredcites →https://doi.org/10.1145/93548.93554openalex-snapshot
Representing control in the presence of first-class continuations
inferredcites →https://doi.org/10.1145/989393.989414openalex-snapshot
Orbit
inferredcites →https://doi.org/10.18130/v36r2hopenalex-snapshot
A Formal Model for Procedure Calling Conventions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.369openalex-snapshot
Confined types in Java
inferred← citeshttps://doi.org/10.1007/10705424_20openalex-snapshot
The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code
inferred← citeshttps://doi.org/10.1007/11547662_12openalex-snapshot
Using Dependent Types to Certify the Safety of Assembly Code
inferred← citeshttps://doi.org/10.1007/11560586_29openalex-snapshot
A Typed Assembly Language for Non-interference
inferred← citeshttps://doi.org/10.1007/11741060_3openalex-snapshot
Information Flow Analysis for a Typed Assembly Language with Polymorphic Stacks
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_22openalex-snapshot
Typestate Checking of Machine Code
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_23openalex-snapshot
Proof-Directed De-compilation of Low-Level Code
inferred← citeshttps://doi.org/10.1007/3-540-45332-6_1openalex-snapshot
Sound and Complete Elimination of Singleton Kinds
inferred← citeshttps://doi.org/10.1007/3-540-45332-6_5openalex-snapshot
Scalable Certification for Typed Assembly Language
inferred← citeshttps://doi.org/10.1007/3-540-45332-6_7openalex-snapshot
Alias Types for Recursive Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_26openalex-snapshot
Typing Assembly Programs with Explicit Forwarding
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_24openalex-snapshot
Alias Types
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_26openalex-snapshot
Language-Based Security
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_4openalex-snapshot
Type Structure for Low-Level Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-24622-0_15openalex-snapshot
Certifying Temporal Properties for Compiled C Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_18openalex-snapshot
safeDpi: A Language for Controlling Mobile Code
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_15openalex-snapshot
A Type Theory for Krivine-Style Evaluation and Compilation
inferred← citeshttps://doi.org/10.1007/978-3-540-40965-6_2openalex-snapshot
Kernel Mode Linux: Toward an Operating System Protected by a Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_11openalex-snapshot
Efficient Inference of Static Types for Java Bytecode
inferred← citeshttps://doi.org/10.1007/978-3-540-45213-3_2openalex-snapshot
Safe Code – It’s Not Just for Applets Anymore
inferred← citeshttps://doi.org/10.1007/978-3-540-76929-3_3openalex-snapshot
Compiling C Programs into a Strongly Typed Assembly Language
inferred← citeshttps://doi.org/10.1007/978-3-642-14577-3_24openalex-snapshot
Designing for Audit: A Voting Machine with a Tiny TCB
inferred← citeshttps://doi.org/10.1007/978-3-642-27705-4_3openalex-snapshot
Integrated Semantics of Intermediate-Language C and Macro-Assembler for Pervasive Formal Verification of Operating Systems and Hypervisors from VerisoftXT
inferred← citeshttps://doi.org/10.1007/bfb0055421openalex-snapshot
C--: A portable assembly language
inferred← citeshttps://doi.org/10.1007/s10990-011-9077-9openalex-snapshot
Mnemonics: type-safe bytecode generation at run time
inferred← citeshttps://doi.org/10.1007/s11432-011-4300-1openalex-snapshot
A verifiable low-level concurrent programming model based on colored Petri nets
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00201-8openalex-snapshot
Automated techniques for provably safe mobile code
inferred← citeshttps://doi.org/10.1016/s1007-0214(07)70176-1openalex-snapshot
Verification of concurrent assembly programs with a Petri net based safety policy
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81012-0openalex-snapshot
Flow Analytic Type System for Array Bound Checks
inferred← citeshttps://doi.org/10.1017/s0956796801004178openalex-snapshot
Stack-based typed assembly language
inferred← citeshttps://doi.org/10.1023/a:1010039502678openalex-snapshot
inferred← citeshttps://doi.org/10.1023/b:jars.0000021012.97318.e9openalex-snapshot
A Syntactic Approach to Foundational Proof-Carrying Code
inferred← citeshttps://doi.org/10.1023/b:jars.0000021014.79255.33openalex-snapshot
Heap-Bounded Assembly Language
inferred← citeshttps://doi.org/10.1109/csac.2002.1176312openalex-snapshot
Malicious code detection for open firmware
inferred← citeshttps://doi.org/10.1109/csf.2019.00030openalex-snapshot
Static Enforcement of Security in Runtime Systems
inferred← citeshttps://doi.org/10.1109/discex.2000.825043openalex-snapshot
Automated techniques for provably safe mobile code
inferred← citeshttps://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferred← citeshttps://doi.org/10.1109/lics.2003.1210043openalex-snapshot
Reasoning about hierarchical storage
inferred← citeshttps://doi.org/10.1109/qsic.2006.42openalex-snapshot
Modularly Certified Dynamic Storage Allocation in SCAP
inferred← citeshttps://doi.org/10.1109/scam.2001.972683openalex-snapshot
Using data flow analysis to infer type information in Java bytecode
inferred← citeshttps://doi.org/10.1109/tase.2009.17openalex-snapshot
The Logical Approach to Low-Level Stack Reasoning
inferred← citeshttps://doi.org/10.1145/1273920.1273922openalex-snapshot
Formalizing and verifying semantic type soundness of a simple compiler
inferred← citeshttps://doi.org/10.1145/1706356.1706361openalex-snapshot
Mnemonics
inferred← citeshttps://doi.org/10.1145/268946.268954openalex-snapshot
From system F to typed assembly language
inferred← citeshttps://doi.org/10.1145/277650.277752openalex-snapshot
The design and implementation of a certifying compiler
inferred← citeshttps://doi.org/10.1145/2814270.2814280openalex-snapshot
Disjointness domains for fine-grained aliasing
inferred← citeshttps://doi.org/10.1145/292540.292549openalex-snapshot
A simple, comprehensive type system for Java bytecode subroutines
inferred← citeshttps://doi.org/10.1145/319301.319345openalex-snapshot
From system F to typed assembly language
inferred← citeshttps://doi.org/10.1145/325694.325727openalex-snapshot
A semantic model of types and machine instructions for proof-carrying code
inferred← citeshttps://doi.org/10.1145/325694.325728openalex-snapshot
A type system for expressive security policies
inferred← citeshttps://doi.org/10.1145/349299.349315openalex-snapshot
A certifying compiler for Java
inferred← citeshttps://doi.org/10.1145/360204.360228openalex-snapshot
Typing a multi-language intermediate code
inferred← citeshttps://doi.org/10.1145/363911.363915openalex-snapshot
Standard fixpoint iteration for Java bytecode verification
inferred← citeshttps://doi.org/10.1145/508791.508978openalex-snapshot
Verification caching
inferred← citeshttps://doi.org/10.1145/512529.512563openalex-snapshot
Region-based memory management in cyclone
inferred← citeshttps://doi.org/10.1201/9781420040579.ch20openalex-snapshot
Compiling Safe Mobile Code
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.