The following pages link to (Q5574395):
Displaying 32 items.
- A survey of state vectors (Q458456) (← links)
- Impossibility of gathering, a certification (Q483063) (← links)
- An algebraic approach to the design of compilers for object-oriented languages (Q607399) (← links)
- Certifying compilers using higher-order theorem provers as certificate checkers (Q633302) (← links)
- Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
- A demonstrably correct compiler (Q749202) (← links)
- Algebraic processing of programming languages (Q1129126) (← links)
- More on advice on structuring compilers and proving them correct (Q1156472) (← links)
- Reasoning about programs (Q1212353) (← links)
- Proving a compiler correct: A simple approach (Q1216945) (← links)
- Design and correctness of a compiler for a non-procedural language (Q1240546) (← links)
- A unified language processing methodology (Q1603702) (← links)
- Proving correctness of a compiler using step-indexed logical relations (Q1744423) (← links)
- Automatic program verification. I: A logical basis and its implementation (Q1843170) (← links)
- The origins of structural operational semantics (Q1878710) (← links)
- Verified bytecode verification and type-certifying compilation (Q1881665) (← links)
- Approximations of antieigenvalue and antieigenvalue-type quantities (Q1935989) (← links)
- A self-certifying compilation framework for WebAssembly (Q2234063) (← links)
- Proof movie -- a proof with the Boyer-Moore prover (Q2366695) (← links)
- Algebraic correctness proofs for compiling recursive function definitions with strictness information (Q2502270) (← links)
- A formally verified compiler back-end (Q2655327) (← links)
- A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs (Q2802499) (← links)
- (Q3730919) (← links)
- Compiling a 50-year journey (Q4625157) (← links)
- Trace-Relating Compiler Correctness and Secure Compilation (Q5041085) (← links)
- Calculating correct compilers (Q5371953) (← links)
- A constructive approach to the problem of program correctness (Q5554728) (← links)
- Semantics of context-free languages (Q5555691) (← links)
- A proof of Hamblin's algorithm for translation of arithmetic expressions from infix to postfix form (Q5563105) (← links)
- Proving programs correct: Some techniques and examples (Q5606282) (← links)
- Programming language semantics: It’s easy as 1,2,3 (Q6065508) (← links)
- Abstract execution (Q6535957) (← links)
