On the public citation graph
Certified and efficient instruction scheduling: application to interlocked VLIW processors
0 signed · 37 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11813040_31openalex-snapshot
Formal Verification of a C Compiler Front-End
inferredcites →https://doi.org/10.1007/bf01205182openalex-snapshot
The multiflow trace scheduling compiler
inferredcites →https://doi.org/10.1007/bf01407931openalex-snapshot
Dataflow analysis of array and scalar references
inferredcites →https://doi.org/10.1007/s10817-009-9155-4openalex-snapshot
A Formally Verified Compiler Back-end
inferredcites →https://doi.org/10.1109/tc.1981.1675827openalex-snapshot
Trace Scheduling: A Technique for Global Microcode Compaction
inferredcites →https://doi.org/10.1145/1159876.1159880openalex-snapshot
Type-safe modular hash-consing
inferredcites →https://doi.org/10.1145/1538788.1538814openalex-snapshot
Formal verification of a realistic compiler
inferredcites →https://doi.org/10.1145/178243.178249openalex-snapshot
Division by invariant integers using multiplication
inferredcites →https://doi.org/10.1145/2908080.2908109openalex-snapshot
Verified peephole optimizations for CompCert
inferredcites →https://doi.org/10.1145/3126528openalex-snapshot
Complete and Practical Universal Instruction Selection
inferredcites →https://doi.org/10.1145/3332373openalex-snapshot
Combinatorial Register Allocation and Instruction Scheduling
inferredcites →https://doi.org/10.1145/360248.360252openalex-snapshot
Symbolic execution and program testing
inferredcites →https://doi.org/10.1145/800046.801649openalex-snapshot
Very Long Instruction Word architectures and the ELI-512
inferredcites →https://doi.org/10.4230/oasics.ppes.2011.59openalex-snapshot
Towards Formally Verified Optimizing Compilation in Flight Control Software
inferredcites →https://doi.org/10.5860/choice.32-0950openalex-snapshot
Synthesis and optimization of digital circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_8openalex-snapshot
The Trusted Computing Base of the CompCert Verified Compiler
inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_9openalex-snapshot
Formally Verified EVM Block-Optimizations
inferred← citeshttps://doi.org/10.1007/978-3-031-38828-6_3openalex-snapshot
Testing a Formally Verified Compiler
inferred← citeshttps://doi.org/10.1007/978-3-032-23456-8_13openalex-snapshot
Multi-dimensional Cost-Driven LDSP Instruction Scheduling Optimization
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_13openalex-snapshot
Towards Formally Verified Smart Contracts Compilation
inferred← citeshttps://doi.org/10.1007/s10009-024-00760-3openalex-snapshot
Pragmatics of formally verified yet efficient static analysis, in particular, for formally verified compilers
inferred← citeshttps://doi.org/10.1109/arith54963.2022.00032openalex-snapshot
Formally verified 32- and 64-bit integer division using double-precision floating-point arithmetic
inferred← citeshttps://doi.org/10.1109/docs63458.2024.10704552openalex-snapshot
Progressive Simulated Annealing Algorithm for the Pipeline Allocation Problem of Protocol Independent Switch Architecture Chips
inferred← citeshttps://doi.org/10.1109/fccm53951.2022.9786208openalex-snapshot
Resource Sharing for Verified High-Level Synthesis
inferred← citeshttps://doi.org/10.1109/micro56248.2022.00044openalex-snapshot
GCD2: A Globally Optimizing Compiler for Mapping DNNs to Mobile DSPs
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3536803openalex-snapshot
Secure Optimizations on Ethereum Bytecode Jump-Free Sequences
inferred← citeshttps://doi.org/10.1145/3461648.3463850openalex-snapshot
Simple, light, yet formally verified, global common subexpression elimination and loop-invariant code motion
inferred← citeshttps://doi.org/10.1145/3485494openalex-snapshot
Formal verification of high-level synthesis
inferred← citeshttps://doi.org/10.1145/3497775.3503679openalex-snapshot
Formally verified superblock scheduling
inferred← citeshttps://doi.org/10.1145/3529507openalex-snapshot
Formally Verified Loop-Invariant Code Motion and Assorted Optimizations
inferred← citeshttps://doi.org/10.1145/3622799openalex-snapshot
Formally Verifying Optimizations with Block Simulations
inferred← citeshttps://doi.org/10.1145/3636501.3636952openalex-snapshot
Memory Simulations, Security and Optimization in a Verified Compiler
inferred← citeshttps://doi.org/10.1145/3689739openalex-snapshot
Fully Verified Instruction Scheduling
inferred← citeshttps://doi.org/10.1145/3797905.3807840openalex-snapshot
GRASP: Optimizing VLIW Instruction Scheduling via Graph Reinforcement Learning
inferred← citeshttps://doi.org/10.1145/3810954openalex-snapshot
LASM: Extensible Competitive Scheduling Framework for VLIW Assembly Optimization
inferred← citeshttps://doi.org/10.70675/4ca8962fz96b1z4291zbc7bz64918999dbe3openalex-snapshot
Optimized and formally-verified compilation for a VLIW processor
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.