On the public citation graph

Toward a foundational typed assembly language

0 signed · 86 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.1002/spe.4380180902openalex-snapshot
Garbage collection in an uncooperative environment
inferredcites →https://doi.org/10.1007/3-540-36133-2_11openalex-snapshot
Trustless Grid Computing in ConCert
inferredcites →https://doi.org/10.1007/3-540-46425-5_24openalex-snapshot
Alias Types
inferredcites →https://doi.org/10.1007/3-540-46425-5_4openalex-snapshot
Flow-Directed Closure Conversion for Typed Languages
inferredcites →https://doi.org/10.1007/3-540-48523-6_4openalex-snapshot
Type Structure for Low-Level Programming Languages
inferredcites →https://doi.org/10.1007/3-540-48660-7_14openalex-snapshot
System Description: Twelf — A Meta-Logical Framework for Deductive Systems
inferredcites →https://doi.org/10.1007/3-540-55602-8_190openalex-snapshot
Implementing the meta-theory of deductive systems
inferredcites →https://doi.org/10.1007/3-540-61055-3_44openalex-snapshot
Mode and termination checking for higher-order logic programs
inferredcites →https://doi.org/10.1016/s0168-0072(98)00047-5openalex-snapshot
Typability and type checking in System F are equivalent and undecidable
inferredcites →https://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferredcites →https://doi.org/10.1017/s0956796801004178openalex-snapshot
Stack-based typed assembly language
inferredcites →https://doi.org/10.1017/s0956796898003086openalex-snapshot
From ML to Ada: Strongly-typed language interoperability via source translation
inferredcites →https://doi.org/10.1109/lics.2002.1029819openalex-snapshot
A syntactic approach to foundational proof-carrying code
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/231379.231394openalex-snapshot
Simple garbage-collector-safety
inferredcites →https://doi.org/10.1145/319301.319345openalex-snapshot
From system F to typed assembly language
inferredcites →https://doi.org/10.1145/325694.325727openalex-snapshot
A semantic model of types and machine instructions for proof-carrying code
inferredcites →https://doi.org/10.1145/349299.349315openalex-snapshot
A certifying compiler for Java
inferredcites →https://doi.org/10.1145/360204.360216openalex-snapshot
Oracle-based checking of untrusted software
inferredcites →https://doi.org/10.1145/507635.507657openalex-snapshot
A dependently typed assembly language

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10930755_8openalex-snapshot
A Coverage Checking Algorithm for LF
inferred← citeshttps://doi.org/10.1007/11532231_5openalex-snapshot
Tabling for Higher-Order Logic Programming
inferred← citeshttps://doi.org/10.1007/11541868_4openalex-snapshot
Mechanized Metatheory for the Masses: The PoplMark Challenge
inferred← citeshttps://doi.org/10.1007/11562931_29openalex-snapshot
Small Proof Witnesses for LF
inferred← citeshttps://doi.org/10.1007/11609773_12openalex-snapshot
A Framework for Certified Program Analysis and Its Applications to Mobile-Code Safety
inferred← citeshttps://doi.org/10.1007/11609773_6openalex-snapshot
A Compositional Logic for Control Flow
inferred← citeshttps://doi.org/10.1007/978-3-030-03592-1_7openalex-snapshot
TWAM: A Certifying Abstract Machine for Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-01760-5openalex-snapshot
Principles of Secure Processor Architecture Design
inferred← citeshttps://doi.org/10.1007/978-3-540-24622-0_4openalex-snapshot
Construction of a Semantic Model for a Typed Assembly Language
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_2openalex-snapshot
Verifying Uniqueness in a Logical Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_29openalex-snapshot
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
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-45085-6_9openalex-snapshot
Foundational Certified Code in a Metalogical Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_51openalex-snapshot
Meta-Logical Frameworks and Formal Digital Libraries
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_7openalex-snapshot
The Twelf Proof Assistant
inferred← citeshttps://doi.org/10.1007/s10817-005-6534-3openalex-snapshot
Verifying Termination and Reduction Properties about Higher-Order Logic Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.09.021openalex-snapshot
A Bidirectional Refinement Type System for LF
inferred← citeshttps://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
inferred← citeshttps://doi.org/10.1017/s0956796807006430openalex-snapshot
Mechanizing metatheory in a logical framework
inferred← citeshttps://doi.org/10.1017/s0956796808006904openalex-snapshot
Modular development of certified program verifiers with a proof assistant,
inferred← citeshttps://doi.org/10.1017/s0956796812000408openalex-snapshot
An insider's look at LF type reconstruction: everything you (n)ever wanted to know
inferred← citeshttps://doi.org/10.1109/lics.2002.1029819openalex-snapshot
A syntactic approach to foundational proof-carrying code
inferred← citeshttps://doi.org/10.1109/tase.2007.28openalex-snapshot
Foundational Typed Assembly Language with Certified Garbage Collection
inferred← citeshttps://doi.org/10.1145/1040294.1040295openalex-snapshot
The open verifier framework for foundational verifiers
inferred← citeshttps://doi.org/10.1145/1040294.1040297openalex-snapshot
Types for describing coordinated data structures
inferred← citeshttps://doi.org/10.1145/1040294.1040302openalex-snapshot
Automated and certified conformance to responsiveness policies
inferred← citeshttps://doi.org/10.1145/1040294.1040303openalex-snapshot
Type-based verification of sssembly language for compiler debugging
inferred← citeshttps://doi.org/10.1145/1086365.1086399openalex-snapshot
Modular verification of concurrent assembly code with dynamic thread creation and termination
inferred← citeshttps://doi.org/10.1145/1090189.1086399openalex-snapshot
Modular verification of concurrent assembly code with dynamic thread creation and termination
inferred← citeshttps://doi.org/10.1145/1111037.1111066openalex-snapshot
Certified assembly programming with embedded code pointers
inferred← citeshttps://doi.org/10.1145/1111320.1111066openalex-snapshot
Certified assembly programming with embedded code pointers
inferred← citeshttps://doi.org/10.1145/1133255.1134028openalex-snapshot
Modular verification of assembly code with stack-based control abstractions
inferred← citeshttps://doi.org/10.1145/1133651.1133653openalex-snapshot
Quantified types in an imperative language
inferred← citeshttps://doi.org/10.1145/1159803.1159825openalex-snapshot
Modular development of certified program verifiers with a proof assistant
inferred← citeshttps://doi.org/10.1145/1159876.1159879openalex-snapshot
ML grid programming with ConCert
inferred← citeshttps://doi.org/10.1145/1190215.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferred← citeshttps://doi.org/10.1145/1190216.1190235openalex-snapshot
A very modal model of a modern, major, general type system
inferred← citeshttps://doi.org/10.1145/1190315.1190325openalex-snapshot
An open framework for foundational proof-carrying code
inferred← citeshttps://doi.org/10.1145/1250734.1250743openalex-snapshot
Certified self-modifying code
inferred← citeshttps://doi.org/10.1145/1273442.1250743openalex-snapshot
Certified self-modifying code
inferred← citeshttps://doi.org/10.1145/1328438.1328443openalex-snapshot
Engineering formal metatheory
inferred← citeshttps://doi.org/10.1145/1328438.1328465openalex-snapshot
A theory of platform-dependent low-level software
inferred← citeshttps://doi.org/10.1145/1328897.1328443openalex-snapshot
Engineering formal metatheory
inferred← citeshttps://doi.org/10.1145/1328897.1328465openalex-snapshot
A theory of platform-dependent low-level software
inferred← citeshttps://doi.org/10.1145/1352582.1352584openalex-snapshot
Foundational certified code in the Twelf metalogical framework
inferred← citeshttps://doi.org/10.1145/1577824.1577831openalex-snapshot
A practical module system for LF
inferred← citeshttps://doi.org/10.1145/1706299.1706322openalex-snapshot
A theory of indirection via approximation
inferred← citeshttps://doi.org/10.1145/1707801.1706322openalex-snapshot
A theory of indirection via approximation
inferred← citeshttps://doi.org/10.1145/1709093.1709094openalex-snapshot
Semantic foundations for typed assembly languages
inferred← citeshttps://doi.org/10.1145/2103621.2103709openalex-snapshot
Formalizing the LLVM intermediate representation for verified program transformations
inferred← citeshttps://doi.org/10.1145/2103656.2103709openalex-snapshot
Formalizing the LLVM intermediate representation for verified program transformations
inferred← citeshttps://doi.org/10.1145/3062341.3062357openalex-snapshot
Levity polymorphism
inferred← citeshttps://doi.org/10.1145/3140587.3062357openalex-snapshot
Levity polymorphism
inferred← citeshttps://doi.org/10.1145/3307650.3322256openalex-snapshot
Bouncer
inferred← citeshttps://doi.org/10.1145/3564785openalex-snapshot
Survey of Approaches and Techniques for Security Verification of Computer Systems
inferred← citeshttps://doi.org/10.1145/3674628openalex-snapshot
Double-Ended Bit-Stealing for Algebraic Data Types
inferred← citeshttps://doi.org/10.1145/780822.781155openalex-snapshot
A provably sound TAL for back-end optimization
inferred← citeshttps://doi.org/10.1145/781131.781155openalex-snapshot
A provably sound TAL for back-end optimization
inferred← citeshttps://doi.org/10.1184/r1/6605852openalex-snapshot
Foundational Typed Assembly Language for Grid Computing
inferred← citeshttps://doi.org/10.13140/rg.2.1.4425.9689openalex-snapshot
Types for DSP Assembler Programs
inferred← citeshttps://doi.org/10.2168/lmcs-6(4:5)2010openalex-snapshot
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
inferred← citeshttps://doi.org/10.2200/s00864ed1v01y201807cac045openalex-snapshot
Principles of Secure Processor Architecture Design
inferred← citeshttps://doi.org/10.4204/eptcs.73.7openalex-snapshot
A coinductive semantics of the Unlimited Register Machine
inferred← citeshttps://doi.org/10.48550/arxiv.1912.03028openalex-snapshot
A Survey on Theorem Provers in Formal Methods
inferred← citeshttps://doi.org/10.5120/cae2017652685openalex-snapshot
Qualitative Assessment of Compiled, Interpreted and Hybrid Programming Languages
inferred← citeshttps://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
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.