scientific article; zbMATH DE number 3471564

Cited in

(35)

Datalogy - the Copenhagen tradition of computer science
Correctness of the compiling process based on axiomatic semantics
The Schorr-Waite marking algorithm revisited
The independence of control structures in abstract programming systems
Steady-paced-output and fractional-on-line algorithms on a RAM
More comments on the programming language Pascal
Axiomatic approach to side effects and general jumps
The analysis of Quicksort programs
Language design methods based on semantic principles
An analysis of alpha-beta pruning
SUBSTAD: for fast substitution in LISP, with an application on unification
Proving programs correct through refinement
On removing the machine from the language
A contribution to the programming calculus
The number of registers required for evaluating arithmetic expressions
All structured programs have small tree width and good register allocation
Recursive information transducers: Computation models
A structured program to generate all topological sorting arrangements
High-performance generation of the Hamiltonian and overlap matrices in FLAPW methods
Algebraic-grammatical models of parallel computation
The tree-width of C
Dijkstra graphs
The complexity of register allocation
Stack and locally finite transformations on structures with reversible transitions
Event-driven control statements
Boolean-valued loops
A case study in program transformation
scientific article; zbMATH DE number 3558921 (Why is no real title available?)
scientific article; zbMATH DE number 3569797 (Why is no real title available?)
NP-Complete operations research problems and approximation algorithms
Gems of Corrado Böhm
Understanding binary-Goppa decoding
Provably correct derivation of algorithms using FermaT
Synthetic programming
Fundamentals of reversible flowchart languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055144)