On the public citation graph

C formalised in HOL

0 signed · 143 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-48737-9_3openalex-snapshot
Proving Java Type Soundness
inferredcites →https://doi.org/10.1007/3-540-55602-8_217openalex-snapshot
PVS: A prototype verification system
inferredcites →https://doi.org/10.1007/3-540-56992-8_17openalex-snapshot
The semantics of the C programming language
inferredcites →https://doi.org/10.1007/3-540-57826-9_124openalex-snapshot
Reasoning with the formal definition of standard ML in HOL
inferredcites →https://doi.org/10.1007/3-540-57826-9_131openalex-snapshot
A broader class of trees for recursive type definitions for HOL
inferredcites →https://doi.org/10.1007/3-540-58450-1_48openalex-snapshot
Trustworthy tools for trustworthy programs: A verified verification condition generator
inferredcites →https://doi.org/10.1007/3-540-60275-5openalex-snapshot
Higher Order Logic Theorem Proving and Its Applications
inferredcites →https://doi.org/10.1007/3-540-60275-5_66openalex-snapshot
Inductive definitions: Automation and application
inferredcites →https://doi.org/10.1007/978-1-4419-8598-9openalex-snapshot
A Theory of Objects
inferredcites →https://doi.org/10.1007/978-1-4612-3658-0_10openalex-snapshot
Mechanizing Programming Logics in Higher Order Logic
inferredcites →https://doi.org/10.1007/bf00264021openalex-snapshot
Proof rules for gotos
inferredcites →https://doi.org/10.1007/bf00289468openalex-snapshot
Axiomatic approach to side effects and general jumps
inferredcites →https://doi.org/10.1007/bf01214623openalex-snapshot
Exits in the refinement calculus
inferredcites →https://doi.org/10.1007/bfb0053388openalex-snapshot
Java is type safe — Probably
inferredcites →https://doi.org/10.1016/s0167-6423(97)00030-0openalex-snapshot
A sound polymorphic type system for a dialect of C
inferredcites →https://doi.org/10.1016/s1571-0661(04)80013-6openalex-snapshot
Bisimilarity as a Theory of Functional Programming
inferredcites →https://doi.org/10.1093/comjnl/38.2.162openalex-snapshot
Binary Decision Diagrams as a HOL derived rule
inferredcites →https://doi.org/10.1109/hicss.1998.656295openalex-snapshot
Formal verification of secure programs in the presence of side effects
inferredcites →https://doi.org/10.1109/hol.1991.596299openalex-snapshot
A Package For Inductive Relation Definitions In HOL
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/154766.155580openalex-snapshot
The development of the C language
inferredcites →https://doi.org/10.1145/193173.195297openalex-snapshot
LCLint
inferredcites →https://doi.org/10.1145/227595.227603openalex-snapshot
Automated proofs of object code for a widely used microprocessor
inferredcites →https://doi.org/10.1145/231379.231389openalex-snapshot
Static detection of dynamic memory errors
inferredcites →https://doi.org/10.1145/234313.234418openalex-snapshot
Type systems
inferredcites →https://doi.org/10.1145/263699.263712openalex-snapshot
Proof-carrying code
inferredcites →https://doi.org/10.1145/359104.359106openalex-snapshot
Social processes and proofs of theorems and programs
inferredcites →https://doi.org/10.1145/4472.4474openalex-snapshot
Side effects and aliasing can have simple axiomatic descriptions
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11541868_1openalex-snapshot
On the Correctness of Operating System Kernels
inferred← citeshttps://doi.org/10.1007/11591191_33openalex-snapshot
A Unified Memory Model for Pointers
inferred← citeshttps://doi.org/10.1007/11813040_31openalex-snapshot
Formal Verification of a C Compiler Front-End
inferred← citeshttps://doi.org/10.1007/11916277_25openalex-snapshot
Verification Condition Generation Via Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_28openalex-snapshot
Automating Type Soundness Proofs via Decision Procedures and Guided Reductions
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_23openalex-snapshot
Functional Procedures in Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-45927-8_20openalex-snapshot
Timing UDP: Mechanized Semantics for Sockets, Threads, and Failures
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_13openalex-snapshot
Verifying BDD Algorithms through Monadic Interpretation
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_10openalex-snapshot
Deterministic Expressions in C
inferred← citeshttps://doi.org/10.1007/978-1-4419-5998-0_5openalex-snapshot
Operational Semantics and Assertional Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-030-02146-7_10openalex-snapshot
IsaK-Static: A Complete Static Semantics of $$\mathbb {K}$$
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_18openalex-snapshot
Compiling Sandboxes: Formally Verified Software Fault Isolation
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_3openalex-snapshot
Semi-automated Reasoning About Non-determinism in C Expressions
inferred← citeshttps://doi.org/10.1007/978-3-030-85315-0_10openalex-snapshot
A Complete Semantics of $$\mathbb {K}$$ and Its Translation to Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_4openalex-snapshot
Two Mechanisations of WebAssembly 1.0
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_4openalex-snapshot
Aliasing Restrictions of C11 Formalized in Coq
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_36openalex-snapshot
Formal C Semantics: CompCert and the C Standard
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_24openalex-snapshot
A Precise and Abstract Memory Model for C Using Symbolic Values
inferred← citeshttps://doi.org/10.1007/978-3-319-22102-1_5openalex-snapshot
A Concrete Memory Model for CompCert
inferred← citeshttps://doi.org/10.1007/978-3-319-33600-8_28openalex-snapshot
A Super Industrial Application of PSGraph
inferred← citeshttps://doi.org/10.1007/978-3-319-66107-0_6openalex-snapshot
CompCertS: A Memory-Aware Verified C Compiler Using Pointer as Integer Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_18openalex-snapshot
Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_26openalex-snapshot
A Verification Environment for Sequential Imperative Programs in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_12openalex-snapshot
Verification-Oriented Language C-Light and Its Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_15openalex-snapshot
HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_18openalex-snapshot
Lightweight Separation
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_1openalex-snapshot
A Sound Semantics for OCaml light
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_27openalex-snapshot
Certifiable Specification and Verification of C Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_1openalex-snapshot
The Rewriting Logic Semantics Project: A Progress Report
inferred← citeshttps://doi.org/10.1007/978-3-642-27705-4_2openalex-snapshot
A Certified Multi-prover Verification Condition Generator
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_29openalex-snapshot
Development of the Computer Language Classification Knowledge Portal
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_17openalex-snapshot
Separation Logic for Non-local Control Flow and Block Scope Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-38853-8_9openalex-snapshot
Model Checking Memory-Related Properties of Hardware/Software Co-designs
inferred← citeshttps://doi.org/10.1007/978-3-662-44202-9_23openalex-snapshot
An Executable Formal Semantics of PHP
inferred← citeshttps://doi.org/10.1007/s10703-010-0098-5openalex-snapshot
Reasoning about memory layouts
inferred← citeshttps://doi.org/10.1007/s10817-008-9098-1openalex-snapshot
A Mechanical Analysis of Program Verification Strategies
inferred← citeshttps://doi.org/10.1007/s10817-009-9120-2openalex-snapshot
Formal Verification of C Systems Code
inferred← citeshttps://doi.org/10.1007/s10817-009-9122-0openalex-snapshot
Formal Memory Models for the Verification of Low-Level Operating-System Code
inferred← citeshttps://doi.org/10.1007/s10817-009-9142-9openalex-snapshot
HOL-Boogie—An Interactive Prover-Backend for the Verifying C Compiler
inferred← citeshttps://doi.org/10.1007/s10817-009-9144-7openalex-snapshot
Computer Assisted Reasoning
inferred← citeshttps://doi.org/10.1007/s10817-013-9289-2openalex-snapshot
A Framework for the Verification of Certifying Computations
inferred← citeshttps://doi.org/10.1007/s10817-016-9369-1openalex-snapshot
A Formal C Memory Model for Separation Logic
inferred← citeshttps://doi.org/10.1007/s10817-017-9439-zopenalex-snapshot
A Verified CompCert Front-End for a Memory Model Supporting Pointer Arithmetic and Uninitialised Data
inferred← citeshttps://doi.org/10.1007/s10817-018-9496-yopenalex-snapshot
CompCertS: A Memory-Aware Verified C Compiler Using a Pointer as Integer Semantics
inferred← citeshttps://doi.org/10.1007/s12046-009-0002-4openalex-snapshot
Operating system verification—An overview
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.040openalex-snapshot
Pervasive Compiler Verification – From Verified Programs to Verified Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.041openalex-snapshot
Structured Types and Separation Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.09.057openalex-snapshot
Separation Logic Verification of C Programs with an SMT Solver
inferred← citeshttps://doi.org/10.1016/j.ic.2013.08.004openalex-snapshot
The rewriting logic semantics project: A progress report
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.06.004openalex-snapshot
Modular inference of subprogram contracts for safety checking
inferred← citeshttps://doi.org/10.1016/j.procs.2010.04.018openalex-snapshot
From BSP routines to high-performance ones: Formal verification of a transformation case
inferred← citeshttps://doi.org/10.1016/j.scico.2010.03.007openalex-snapshot
Formal specification of MPI 2.0: Case study in specifying a practical concurrent programming API
inferred← citeshttps://doi.org/10.1016/j.scico.2017.06.006openalex-snapshot
Verifying cyber attack properties
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102597openalex-snapshot
Automated model extraction: From non-deterministic C code to active objects
inferred← citeshttps://doi.org/10.1109/access.2019.2905428openalex-snapshot
FEther: An Extensible Definitional Interpreter for Smart-Contract Verifications in Coq
inferred← citeshttps://doi.org/10.1109/acsd.2013.21openalex-snapshot
Prototyping a Concurrency Model
inferred← citeshttps://doi.org/10.1109/compsac.2006.85openalex-snapshot
Verifying Java Programs By Theorem Prover HOL
inferred← citeshttps://doi.org/10.1109/iccd.2005.110openalex-snapshot
Towards the formal verification of lower system layers in automotive systems
inferred← citeshttps://doi.org/10.1109/iccd.2005.42openalex-snapshot
Dealing with I/O devices in the context of pervasive system verification
inferred← citeshttps://doi.org/10.1109/ictai.2018.00079openalex-snapshot
A Formally Verified Validator for Classical Planning Problems and Solutions
inferred← citeshttps://doi.org/10.1109/secpri.2002.1004369openalex-snapshot
Improving computer security using extended static checking
inferred← citeshttps://doi.org/10.1109/sefm.2005.11openalex-snapshot
Building verification condition generators by compositional extensions
inferred← citeshttps://doi.org/10.1109/sefm.2005.51openalex-snapshot
Towards the formal verification of a C0 compiler: code generation and implementation correctness
inferred← citeshttps://doi.org/10.1109/spw.2015.33openalex-snapshot
The Correctness-Security Gap in Compiler Optimization
inferred← citeshttps://doi.org/10.1145/1133373.1133383openalex-snapshot
Rigour is good for you and feasible
inferred← citeshttps://doi.org/10.1145/1190215.1190234openalex-snapshot
Types, bytes, and separation logic
inferred← citeshttps://doi.org/10.1145/1328408.1328417openalex-snapshot
Mechanical verification of refactorings
inferred← citeshttps://doi.org/10.1145/1328438.1328465openalex-snapshot
A theory of platform-dependent low-level software
inferred← citeshttps://doi.org/10.1145/2103621.2103719openalex-snapshot
An executable formal semantics of C with applications
inferred← citeshttps://doi.org/10.1145/2145816.2145825openalex-snapshot
Extending a C-like language for portable SIMD programming
inferred← citeshttps://doi.org/10.1145/2517349openalex-snapshot
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
inferred← citeshttps://doi.org/10.1145/2517349.2522720openalex-snapshot
From L3 to seL4 what have we learnt in 20 years of L4 microkernels?
inferred← citeshttps://doi.org/10.1145/2535838.2535878openalex-snapshot
An operational and axiomatic semantics for non-determinism and sequence points in C
inferred← citeshttps://doi.org/10.1145/2676724.2693571openalex-snapshot
A Typed C11 Semantics for Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1145/2737924.2737979openalex-snapshot
Defining the undefinedness of C
inferred← citeshttps://doi.org/10.1145/2737924.2738005openalex-snapshot
A formal C memory model supporting integer-pointer casts
inferred← citeshttps://doi.org/10.1145/2893177openalex-snapshot
L4 Microkernels
inferred← citeshttps://doi.org/10.1145/2908080.2908081openalex-snapshot
Into the depths of C: elaborating the de facto standards
inferred← citeshttps://doi.org/10.1145/3243650openalex-snapshot
Engineering with Logic
inferred← citeshttps://doi.org/10.1145/3290380openalex-snapshot
Exploring C semantics and pointer provenance
inferred← citeshttps://doi.org/10.1145/360204.360228openalex-snapshot
Typing a multi-language intermediate code
inferred← citeshttps://doi.org/10.1145/3704858openalex-snapshot
Progressful Interpreters for Efficient WebAssembly Mechanisation
inferred← citeshttps://doi.org/10.1145/3705593openalex-snapshot
Formal Verification of Just-in-Time Compilation
inferred← citeshttps://doi.org/10.1145/3705593.3705594openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3705593.3705595openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1145/3705593.3705596openalex-snapshot
Background on Just-in-Time Compilation
inferred← citeshttps://doi.org/10.1145/3705593.3705597openalex-snapshot
Background on the CompCert Compiler
inferred← citeshttps://doi.org/10.1145/3705593.3705598openalex-snapshot
Designing Formally Verified JITs
inferred← citeshttps://doi.org/10.1145/3705593.3705599openalex-snapshot
Formally Verified Speculative Optimizations
inferred← citeshttps://doi.org/10.1145/3705593.3705600openalex-snapshot
Formal Verification of Impure Coq JITs
inferred← citeshttps://doi.org/10.1145/3705593.3705601openalex-snapshot
Formal Verification of a JIT Backend Compiler
inferred← citeshttps://doi.org/10.1145/3705593.3705602openalex-snapshot
Assessment
inferred← citeshttps://doi.org/10.1145/3705593.3705603openalex-snapshot
Conclusion
inferred← citeshttps://doi.org/10.1145/3705593.3705604openalex-snapshot
Relating the Developments to the Book
inferred← citeshttps://doi.org/10.1145/3705593.3705605openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1145/3705593.3705606openalex-snapshot
Authors’ Biography/Index
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.23.319.304openalex-snapshot
High-level Proofs about Low-level Programs
inferred← citeshttps://doi.org/10.14778/3151113.3151116openalex-snapshot
A formal semantics of SQL queries, its validation, and applications
inferred← citeshttps://doi.org/10.19153/cleiej.9.2.7openalex-snapshot
A semantics for while with break, continue and goto
inferred← citeshttps://doi.org/10.22028/d291-25913openalex-snapshot
Verification of the C0 compiler implementation on the source code level
inferred← citeshttps://doi.org/10.22028/d291-25982openalex-snapshot
The correctness of a distributed real-time system
inferred← citeshttps://doi.org/10.22028/d291-25991openalex-snapshot
Compiler verification in the context of pervasive system verification
inferred← citeshttps://doi.org/10.26190/unsworks/17396openalex-snapshot
Automated proof-producing abstraction of C code
inferred← citeshttps://doi.org/10.26190/unsworks/17927openalex-snapshot
Formal memory models for verifying C systems code
inferred← citeshttps://doi.org/10.26190/unsworks/18974openalex-snapshot
Formal Verification of a Component Platform
inferred← citeshttps://doi.org/10.26190/unsworks/23844openalex-snapshot
Verification of programs in virtual memory using separation logic
inferred← citeshttps://doi.org/10.26190/unsworks/519openalex-snapshot
OS verification - now!
inferred← citeshttps://doi.org/10.3103/s0146411615070123openalex-snapshot
Developing a self-applicable verification system. Theory and practice
inferred← citeshttps://doi.org/10.4304/jsw.1.3.1-13openalex-snapshot
Incremental Implementation of Syntax Driven Logics
inferred← citeshttps://doi.org/10.48456/tr-566openalex-snapshot
Formal verification of probabilistic algorithms
inferred← citeshttps://doi.org/10.48456/tr-624openalex-snapshot
TCP, UDP, and Sockets: rigorous and experimentally-validated behavioural specification Volume 1: Overview
inferred← citeshttps://doi.org/10.48550/arxiv.1509.03339openalex-snapshot
A Formal C Memory Model for Separation Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1803.00403openalex-snapshot
A general formal memory framework in Coq for verifying the properties of programs based on higher-order logic theorem proving with increased automation, consistency, and reusability
inferred← citeshttps://doi.org/10.5287/ora-avknpod8qopenalex-snapshot
Analysing the Security Properties of Object−Capability Patterns
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.