On the public citation graph

Correctness of a compiler for arithmetic expressions

https://doi.org/10.1090/psapm/019/0242403
0 signed · 239 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.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
inferredcites →https://doi.org/10.1090/pspum/005/9998openalex-snapshot
Computer programs for checking mathematical proofs
inferredcites →https://doi.org/10.21236/ad0785050openalex-snapshot
A Formal Description of a Subset of Algol
inferredcites →https://doi.org/10.2307/2270190openalex-snapshot
John McCarthy. Computer programs for checking mathematical proofs. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence1962, pp. 219–227.

What points at this work

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

inferred← citeshttps://doi.org/10.3217/jucs-009-03-0191openalex-extracted
Using Program Checking to Ensure the Correctness of Compiler Implementations
inferred← citeshttps://doi.org/10.1002/9780470996751.ch46openalex-snapshot
A Computational Logic for Applicative Common LISP
inferred← citeshttps://doi.org/10.1007/0-387-97226-9_29openalex-snapshot
Totally verified systems: Linking verified software to verified hardware
inferred← citeshttps://doi.org/10.1007/1-4020-4933-1_3openalex-snapshot
Efficient Construction and Verification of Embedded Software
inferred← citeshttps://doi.org/10.1007/10703260_4openalex-snapshot
Towards Rigorous Compiler Implementation Verification
inferred← citeshttps://doi.org/10.1007/10722010_8openalex-snapshot
Proving Pointer Programs in Hoare Logic
inferred← citeshttps://doi.org/10.1007/11828563_4openalex-snapshot
An Axiomatization of Arrays for Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.1007/11925040_6openalex-snapshot
On the Correctness of Transformations in Compiler Back-Ends
inferred← citeshttps://doi.org/10.1007/3-540-06720-5_13openalex-snapshot
Certain decompositions of Gödel numbering and the semantics of programming languages
inferred← citeshttps://doi.org/10.1007/3-540-06720-5_22openalex-snapshot
Admissibility of fixed-point induction in first-order logic of typed theories
inferred← citeshttps://doi.org/10.1007/3-540-06786-8_260openalex-snapshot
Reliability and integrity of large computer programs
inferred← citeshttps://doi.org/10.1007/3-540-08766-4_14openalex-snapshot
References & bibliography
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_48openalex-snapshot
More on advice on structuring compilers and proving them correct
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_33openalex-snapshot
The vienna development method (VDM)
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_91openalex-snapshot
A constructive approach to compiler correctness
inferred← citeshttps://doi.org/10.1007/3-540-10250-7_22openalex-snapshot
More on advice on structuring compilers and proving them correct
inferred← citeshttps://doi.org/10.1007/3-540-10250-7_23openalex-snapshot
A constructive approach to compiler correctness
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_94openalex-snapshot
Compiler generation from formal definition of programming languages : A survey
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_14openalex-snapshot
A Symmetric Approach to Compilation and Decompilation
inferred← citeshttps://doi.org/10.1007/3-540-44518-8_11openalex-snapshot
Verifying Compilers and ASMs or ASMs for Uniform Description of Multistep Transformations
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_13openalex-snapshot
A Mechanically Verified Compiling Specification for a Lisp Compiler
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_10openalex-snapshot
Verification of Compilers
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_12openalex-snapshot
Compilation and Synthesis for Real-Time Embedded Controllers
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_25openalex-snapshot
A provably correct compiler generator
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_171openalex-snapshot
Provably Correct Systems
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_114openalex-snapshot
Inductive definitions and type theory an introduction (preliminary version)
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_1openalex-snapshot
Extended static checking
inferred← citeshttps://doi.org/10.1007/978-1-4471-3240-0_10openalex-snapshot
Machine Code Programs are Predicates Too
inferred← citeshttps://doi.org/10.1007/978-1-4471-3794-8_17openalex-snapshot
More Advice on Proving a Compiler Correct: Improve a Correct Compiler
inferred← citeshttps://doi.org/10.1007/978-1-4899-5841-9_3openalex-snapshot
Semantics of Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-02928-9_6openalex-snapshot
Challenges for Formal Semantic Description: Responses from the Main Approaches
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_20openalex-snapshot
Abstract Execution
inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_9openalex-snapshot
Origins and Development of Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_1openalex-snapshot
Trace-Relating Compiler Correctness and Secure Compilation
inferred← citeshttps://doi.org/10.1007/978-3-030-55754-6_16openalex-snapshot
Per-Location Simulation
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_7openalex-snapshot
A Self-certifying Compilation Framework for WebAssembly
inferred← citeshttps://doi.org/10.1007/978-3-030-83128-8_10openalex-snapshot
Ever Change a Running System: Structured Software Reengineering Using Automatically Proven-Correct Transformation Rules
inferred← citeshttps://doi.org/10.1007/978-3-031-57259-3openalex-snapshot
Fundamental Approaches to Software Engineering
inferred← citeshttps://doi.org/10.1007/978-3-031-57259-3_1openalex-snapshot
From Mechanized Semantics to Verified Compilation: the Clight Semantics of CompCert
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_12openalex-snapshot
A Formally Verified Procedure for Width Inference in FIRRTL
inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_13openalex-snapshot
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_43openalex-snapshot
Formalizing and Verifying a Modern Build Language
inferred← citeshttps://doi.org/10.1007/978-3-319-72344-0_3openalex-snapshot
Formal Verification of Optimizing Compilers
inferred← citeshttps://doi.org/10.1007/978-3-319-97226-8_4openalex-snapshot
Formal Semantics of ALGOL 60: Four Descriptions in their Historical Context
inferred← citeshttps://doi.org/10.1007/978-3-319-98047-8_5openalex-snapshot
A Case for Certifying Compilers in Industrial Automation
inferred← citeshttps://doi.org/10.1007/978-3-540-30557-6_9openalex-snapshot
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-45236-2_18openalex-snapshot
A Strategy for Compiling Classes, Inheritance, and Dynamic Binding
inferred← citeshttps://doi.org/10.1007/978-3-540-74105-3openalex-snapshot
Decision Procedures: An Algorithmic Point of View
inferred← citeshttps://doi.org/10.1007/978-3-540-74964-6_4openalex-snapshot
Understanding Programming Language Concepts Via Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-04167-9_7openalex-snapshot
Towards Demonstrably Correct Compilation of Java Byte Code
inferred← citeshttps://doi.org/10.1007/978-3-642-40561-7_20openalex-snapshot
Program Transformation Based on Symbolic Execution and Deduction
inferred← citeshttps://doi.org/10.1007/978-3-642-99976-5_11openalex-snapshot
Computer Programs can be Proved Correct
inferred← citeshttps://doi.org/10.1007/978-3-662-01089-1_2openalex-snapshot
Description of Parameterized Compiler Modules
inferred← citeshttps://doi.org/10.1007/978-3-662-02328-0_24openalex-snapshot
Program Veriflcation at Stanford: Past, Present, Future
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_29openalex-snapshot
A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-7091-4009-3_8openalex-snapshot
Compiler Correctness and Input/Output
inferred← citeshttps://doi.org/10.1007/bf00243134openalex-snapshot
A mechanically verified code generator
inferred← citeshttps://doi.org/10.1007/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
inferred← citeshttps://doi.org/10.1007/bf00288883openalex-snapshot
Design and correctness of a compiler for a non-procedural language
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf01211302openalex-snapshot
Proof movie — A proof with the Boyer-Moore prover
inferred← citeshttps://doi.org/10.1007/bf01211435openalex-snapshot
A demonstrably correct compiler
inferred← citeshttps://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferred← citeshttps://doi.org/10.1007/bf01933419openalex-snapshot
A constructive approach to the problem of program correctness
inferred← citeshttps://doi.org/10.1007/bf01933539openalex-snapshot
A proof of Hamblin's algorithm for translation of arithmetic expressions from infix to postfix form
inferred← citeshttps://doi.org/10.1007/bf01936865openalex-snapshot
Proving programs correct: Some techniques and examples
inferred← citeshttps://doi.org/10.1007/bfb0018270openalex-snapshot
Deductive program development: Evaluation in reverse Polish notation as an example
inferred← citeshttps://doi.org/10.1007/bfb0036912openalex-snapshot
Modular compiler descriptions based on abstract semantic data types (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/s00165-006-0090-4openalex-snapshot
Finite Integer Computations: An Algebraic Foundation for Their Correctness
inferred← citeshttps://doi.org/10.1007/s00165-009-0124-9openalex-snapshot
An algebraic approach to the design of compilers for object-oriented languages
inferred← citeshttps://doi.org/10.1007/s00165-012-0226-7openalex-snapshot
John McCarthy (1927–2011)
inferred← citeshttps://doi.org/10.1007/s00236-006-0013-0openalex-snapshot
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information
inferred← citeshttps://doi.org/10.1007/s10009-012-0223-4openalex-snapshot
Template-based program verification and program synthesis
inferred← citeshttps://doi.org/10.1007/s10703-010-0108-7openalex-snapshot
Certifying compilers using higher-order theorem provers as certificate checkers
inferred← citeshttps://doi.org/10.1007/s10817-009-9155-4openalex-snapshot
A Formally Verified Compiler Back-end
inferred← citeshttps://doi.org/10.1007/s11219-011-9168-1openalex-snapshot
A framework for testing first-order logic axioms in program verification
inferred← citeshttps://doi.org/10.1016/0004-3702(74)90015-0openalex-snapshot
Reasoning about programs
inferred← citeshttps://doi.org/10.1016/0066-4138(78)90001-0openalex-snapshot
An introduction to the formal definition of ALGOL 68
inferred← citeshttps://doi.org/10.1016/0096-0551(78)90005-xopenalex-snapshot
Recent developments in the theory of data structures
inferred← citeshttps://doi.org/10.1016/0096-0551(94)90005-1openalex-snapshot
Algebraic tools for language processing
inferred← citeshttps://doi.org/10.1016/0167-6423(83)90021-7openalex-snapshot
Increasing modularity and language-independency in automatically generated compilers
inferred← citeshttps://doi.org/10.1016/0167-6423(88)90064-0openalex-snapshot
Towards an algebraic specification of code generation
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90080-3openalex-snapshot
More on advice on structuring compilers and proving them correct
inferred← citeshttps://doi.org/10.1016/b978-0-08-020242-6.50004-6openalex-snapshot
An Introduction to the Formal Definition of ALGOL 68
inferred← citeshttps://doi.org/10.1016/b978-0-12-122950-4.50027-9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.003openalex-snapshot
A survey of state vectors
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.008openalex-snapshot
Provably Correct Code Generation: A Case Study
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.022openalex-snapshot
Cobalt: A Language for Writing Provably-Sound Compiler Optimizations
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.007openalex-snapshot
What Level of Mathematical Reasoning can Computer Science Demand of a Software Implementer?
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.2016.06.013openalex-snapshot
Proving Correctness of a Compiler Using Step-indexed Logical Relations
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.11.001openalex-snapshot
Impossibility of gathering, a certification
inferred← citeshttps://doi.org/10.1016/j.jlap.2003.07.004openalex-snapshot
Verified bytecode verification and type-certifying compilation
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.03.009openalex-snapshot
The origins of structural operational semantics
inferred← citeshttps://doi.org/10.1016/j.micpro.2019.03.003openalex-snapshot
Security is an architectural design constraint
inferred← citeshttps://doi.org/10.1016/j.scico.2008.03.002openalex-snapshot
The formalism underlying EASYMAP: A precompiler for refinement-based exploration of hierarchical data organizations
inferred← citeshttps://doi.org/10.1016/j.scico.2012.10.015openalex-snapshot
Runtime verification of microcontroller binary code
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.005openalex-snapshot
Grammar semantics, analysis and parsing by abstract interpretation
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115981openalex-snapshot
A unifying logical foundation for initial algebra semantics and induction
inferred← citeshttps://doi.org/10.1016/s0022-0000(75)80007-9openalex-snapshot
Proving a compiler correct: A simple approach
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71197-2openalex-snapshot
Problems in the Theory of Programming Languages
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60431-3openalex-snapshot
Three Computer Cultures: Computer Technology, Computer Mathematics, and Computer Science
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00025-7openalex-snapshot
A unified language processing methodology
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00270-3openalex-snapshot
Algebraic processing of programming languages
inferred← citeshttps://doi.org/10.1016/s1567-8326(04)00026-8openalex-snapshot
The origins of structural operational semantics
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80399-2openalex-snapshot
Towards Acceptability of Optimizations
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82600-3openalex-snapshot
Classifying and Formally Verifying Integer Constant Folding
inferred← citeshttps://doi.org/10.1017/s0956796815000180openalex-snapshot
Calculating correct compilers
inferred← citeshttps://doi.org/10.1017/s0956796817000120openalex-snapshot
Compiling a 50-year journey
inferred← citeshttps://doi.org/10.1017/s0956796820000209openalex-snapshot
Calculating correct compilers II: Return of the register machines
inferred← citeshttps://doi.org/10.1017/s0956796823000072openalex-snapshot
Programming language semantics: It’s easy as 1,2,3
inferred← citeshttps://doi.org/10.1023/a:1018983515535openalex-snapshot
Pinnacles of software engineering: 25 years of formal methods
inferred← citeshttps://doi.org/10.1049/sej.1993.0019openalex-snapshot
Towards a verified MiniSML/SECD system
inferred← citeshttps://doi.org/10.1093/comjnl/12.1.41openalex-snapshot
Proving Properties of Programs by Structural Induction
inferred← citeshttps://doi.org/10.1093/comjnl/15.2.130openalex-snapshot
Proof and Validation of Program Correctness
inferred← citeshttps://doi.org/10.1109/85.397057openalex-snapshot
The automation of proof: a historical and sociological exploration
inferred← citeshttps://doi.org/10.1109/eurmic.2000.874422openalex-snapshot
Software testing concept used for MAS/C-compiler
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351132openalex-snapshot
Verifying equivalence of memories using a first order logic theorem prover
inferred← citeshttps://doi.org/10.1109/fmcad.2014.6987587openalex-snapshot
Compiler verification for fun and profit
inferred← citeshttps://doi.org/10.1109/formalise58978.2023.00021openalex-snapshot
A Verified UAV Flight Plan Generator
inferred← citeshttps://doi.org/10.1109/iccl.1992.185474openalex-snapshot
An automatically generated and provably correct compiler for a subset of Ada
inferred← citeshttps://doi.org/10.1109/ictma.1988.669599openalex-snapshot
Formal Methods And Their Potential For Achieving Highly Dependable Computer Based Medical Applications
inferred← citeshttps://doi.org/10.1109/issrew.2014.71openalex-snapshot
A Technique for Demonstrating Safety and Correctness of Program Translators: Strategy and Case Study
inferred← citeshttps://doi.org/10.1109/mahc.2003.1203057openalex-snapshot
The early search for tractable ways of reasoning about programs
inferred← citeshttps://doi.org/10.1109/sefm.2005.20openalex-snapshot
Formal verification of dead code elimination in Isabelle/HOL
inferred← citeshttps://doi.org/10.1109/sp.2018.00017openalex-snapshot
Precise and Scalable Detection of Double-Fetch Bugs in OS Kernels
inferred← citeshttps://doi.org/10.1109/sp46215.2023.10179433openalex-snapshot
WarpAttack: Bypassing CFI through Compiler-Introduced Double-Fetches
inferred← citeshttps://doi.org/10.1109/spw.2015.33openalex-snapshot
The Correctness-Security Gap in Compiler Optimization
inferred← citeshttps://doi.org/10.1109/swat.1974.13openalex-snapshot
Initial algebra semantics
inferred← citeshttps://doi.org/10.1109/tc.1976.1674703openalex-snapshot
The Use of Higher Order Logic in Program Verification
inferred← citeshttps://doi.org/10.1109/tse.1982.234773openalex-snapshot
Formal Program Verification Using Symbolic Execution
inferred← citeshttps://doi.org/10.1137/0205037openalex-snapshot
Data Types as Lattices
inferred← citeshttps://doi.org/10.1137/0206028openalex-snapshot
Implementation Correctness Involving a Language with goto Statements
inferred← citeshttps://doi.org/10.1145/1069774.1069792openalex-snapshot
Formal validation of pattern matching code
inferred← citeshttps://doi.org/10.1145/1081706.1081750openalex-snapshot
CUTE
inferred← citeshttps://doi.org/10.1145/1086784.1086785openalex-snapshot
A laboratory for the study of automating programming
inferred← citeshttps://doi.org/10.1145/1095430.1081750openalex-snapshot
CUTE
inferred← citeshttps://doi.org/10.1145/1113830.1113832openalex-snapshot
Loops in esterel
inferred← citeshttps://doi.org/10.1145/1115880.1115882openalex-snapshot
Data structure models for programming languages
inferred← citeshttps://doi.org/10.1145/115865.115877openalex-snapshot
Verifying the correctness of compiler transformations on basic blocks using abstract interpretation
inferred← citeshttps://doi.org/10.1145/115866.115877openalex-snapshot
Verifying the correctness of compiler transformations on basic blocks using abstract interpretation
inferred← citeshttps://doi.org/10.1145/1241706.1241711openalex-snapshot
Nucleol - a minimal list processor
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/141471.141528openalex-snapshot
Proving the correctness of storage representations
inferred← citeshttps://doi.org/10.1145/141478.141528openalex-snapshot
Proving the correctness of storage representations
inferred← citeshttps://doi.org/10.1145/1478873.1478876openalex-snapshot
A laboratory for the study of automating programming
inferred← citeshttps://doi.org/10.1145/1479992.1480019openalex-snapshot
A summary of progress toward proving program correctness
inferred← citeshttps://doi.org/10.1145/1481861.1481864openalex-snapshot
Compiling functional types to relational specifications for low level imperative code
inferred← citeshttps://doi.org/10.1145/1596550.1596567openalex-snapshot
Biorthogonality, step-indexing and compiler correctness
inferred← citeshttps://doi.org/10.1145/1631687.1596567openalex-snapshot
Biorthogonality, step-indexing and compiler correctness
inferred← citeshttps://doi.org/10.1145/2429069.2429105openalex-snapshot
High-level separation logic for low-level code
inferred← citeshttps://doi.org/10.1145/2480359.2429105openalex-snapshot
High-level separation logic for low-level code
inferred← citeshttps://doi.org/10.1145/2487241.2487248openalex-snapshot
CompCertTSO
inferred← citeshttps://doi.org/10.1145/2593069.2593237openalex-snapshot
Translation Validation for Stateflow to C
inferred← citeshttps://doi.org/10.1145/2641638.2641655openalex-snapshot
Abstractions from proofs
inferred← citeshttps://doi.org/10.1145/2676726.2676985openalex-snapshot
Compositional CompCert
inferred← citeshttps://doi.org/10.1145/2775051.2676985openalex-snapshot
Compositional CompCert
inferred← citeshttps://doi.org/10.1145/3167089openalex-snapshot
Œuf: minimizing the Coq extraction TCB
inferred← citeshttps://doi.org/10.1145/3176245.3167089openalex-snapshot
Œuf: minimizing the Coq extraction TCB
inferred← citeshttps://doi.org/10.1145/321864.321875openalex-snapshot
Proving Theorems about LISP Functions
inferred← citeshttps://doi.org/10.1145/321941.321957openalex-snapshot
Proving Properties of Complex Data Structures
inferred← citeshttps://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferred← citeshttps://doi.org/10.1145/3236950.3236965openalex-snapshot
An Internalist Approach to Correct-by-Construction Compilers
inferred← citeshttps://doi.org/10.1145/3299771.3299788openalex-snapshot
Correct By Construction Approach For Translation Of Stored Procedures To Java Code
inferred← citeshttps://doi.org/10.1145/3341689openalex-snapshot
The next 700 compiler correctness theorems (functional pearl)
inferred← citeshttps://doi.org/10.1145/3437992.3439929openalex-snapshot
Towards formally verified compilation of tag-based policy enforcement
inferred← citeshttps://doi.org/10.1145/3460860openalex-snapshot
An Extended Account of Trace-relating Compiler Correctness and Secure Compilation
inferred← citeshttps://doi.org/10.1145/349299.349314openalex-snapshot
Translation validation for an optimizing compiler
inferred← citeshttps://doi.org/10.1145/3544585.3544594openalex-snapshot
Development of Correct Programs
inferred← citeshttps://doi.org/10.1145/355606.361880openalex-snapshot
Derived semantics for some programming language constructs
inferred← citeshttps://doi.org/10.1145/355609.362336openalex-snapshot
Inductive methods for proving properties of programs
inferred← citeshttps://doi.org/10.1145/356599.356602openalex-snapshot
An Assessment of Techniques for Proving Program Correctness
inferred← citeshttps://doi.org/10.1145/357172.357179openalex-snapshot
Deriving Target Code as a Representation of Continuation Semantics
inferred← citeshttps://doi.org/10.1145/359104.359110openalex-snapshot
Reasoning about arrays
inferred← citeshttps://doi.org/10.1145/359461.359466openalex-snapshot
Subgoal induction
inferred← citeshttps://doi.org/10.1145/361454.361490openalex-snapshot
The production of better mathematical software
inferred← citeshttps://doi.org/10.1145/362384.362502openalex-snapshot
Algorithm 382: combinations of M out of N objects [G6]
inferred← citeshttps://doi.org/10.1145/362384.362507openalex-snapshot
Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification
inferred← citeshttps://doi.org/10.1145/362384.362513openalex-snapshot
Remark on algorithm 361 [G6]: permanent function of a square matrix I and II
inferred← citeshttps://doi.org/10.1145/362896.362902openalex-snapshot
Translator writing systems
inferred← citeshttps://doi.org/10.1145/3674638openalex-snapshot
Beyond Trees: Calculating Graph-Based Compilers (Functional Pearl)
inferred← citeshttps://doi.org/10.1145/3704887openalex-snapshot
SNIP: Speculative Execution and Non-Interference Preservation for Compiler Transformations
inferred← citeshttps://doi.org/10.1145/382196.382997openalex-snapshot
Structured programming, programming teaching and the language Pascal
inferred← citeshttps://doi.org/10.1145/390013.808487openalex-snapshot
Effectiveness of an optimizing compiler for arithmetic expressions
inferred← citeshttps://doi.org/10.1145/390016.808428openalex-snapshot
An approach to compiler correctness
inferred← citeshttps://doi.org/10.1145/390016.808477openalex-snapshot
A view of program verification
inferred← citeshttps://doi.org/10.1145/512529.512559openalex-snapshot
Using data groups to specify and check side effects
inferred← citeshttps://doi.org/10.1145/512927.512943openalex-snapshot
Reasoning about programs
inferred← citeshttps://doi.org/10.1145/543552.512559openalex-snapshot
Using data groups to specify and check side effects
inferred← citeshttps://doi.org/10.1145/570886.570888openalex-snapshot
Data abstraction and information hiding
inferred← citeshttps://doi.org/10.1145/75308.75312openalex-snapshot
Verified compilation in micro-Gypsy
inferred← citeshttps://doi.org/10.1145/75309.75312openalex-snapshot
Verified compilation in micro-Gypsy
inferred← citeshttps://doi.org/10.1145/780822.781156openalex-snapshot
Automatically proving the correctness of compiler optimizations
inferred← citeshttps://doi.org/10.1145/781131.781156openalex-snapshot
Automatically proving the correctness of compiler optimizations
inferred← citeshttps://doi.org/10.1145/800028.808487openalex-snapshot
Effectiveness of an optimizing compiler for arithmetic expressions
inferred← citeshttps://doi.org/10.1145/800191.805651openalex-snapshot
A program verification system
inferred← citeshttps://doi.org/10.1145/800193.805820openalex-snapshot
The current state of proving programs correct
inferred← citeshttps://doi.org/10.1145/800235.807070openalex-snapshot
Inductive methods for proving properties of programs
inferred← citeshttps://doi.org/10.1145/800235.807080openalex-snapshot
Correctness of a compiler for a Lisp subset
inferred← citeshttps://doi.org/10.1145/800235.807081openalex-snapshot
Operational semantics of programming languages
showing the first 200 of 235
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.