scientific article; zbMATH DE number 3291623
From MaRDI portal
Publication:5574395
zbMath0183.19201MaRDI QIDQ5574395
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A constructive approach to the problem of program correctness ⋮ The origins of structural operational semantics ⋮ Semantics of context-free languages ⋮ Trace-Relating Compiler Correctness and Secure Compilation ⋮ Verified bytecode verification and type-certifying compilation ⋮ Proof movie -- a proof with the Boyer-Moore prover ⋮ A proof of Hamblin's algorithm for translation of arithmetic expressions from infix to postfix form ⋮ Proving programs correct: Some techniques and examples ⋮ A formally verified compiler back-end ⋮ An algebraic approach to the design of compilers for object-oriented languages ⋮ Algebraic processing of programming languages ⋮ Programming language semantics: It’s easy as 1,2,3 ⋮ Approximations of antieigenvalue and antieigenvalue-type quantities ⋮ Certifying compilers using higher-order theorem provers as certificate checkers ⋮ More on advice on structuring compilers and proving them correct ⋮ Calculating correct compilers ⋮ A survey of state vectors ⋮ Compiling a 50-year journey ⋮ Grammar semantics, analysis and parsing by abstract interpretation ⋮ Impossibility of gathering, a certification ⋮ A self-certifying compilation framework for WebAssembly ⋮ Proving correctness of a compiler using step-indexed logical relations ⋮ Reasoning about programs ⋮ Proving a compiler correct: A simple approach ⋮ Algebraic correctness proofs for compiling recursive function definitions with strictness information ⋮ Design and correctness of a compiler for a non-procedural language ⋮ A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs ⋮ A demonstrably correct compiler ⋮ Automatic program verification. I: A logical basis and its implementation ⋮ A unified language processing methodology
