Theory of program structures: Schemes, semantics, verification

Cited in

(48)

Equivalence of conservative, free, linear program schemas is decidable
Program schemata vs. automata for decidability of program logics
On flowchart theories. I. The deterministic case
Concurrent program schemes and their logics
On the detection of unstructuredness in flowgraphs
Succinct representation of regular sets using gotos and Boolean variables
Decision problems for pushdown threads
Modifications of the program scheme model
On schematological equivalence of partially interpreted dataflow networks
On the power of recursion in dataflow schemes
The propositional dynamic logic of deterministic, well-structured programs
Computable queries for relational data bases
Propositional dynamic logic of regular programs
Expressiveness and the completeness of Hoare's logic
Deterministic and nondeterministic flowchart interpretations
The equivalence of r.e. program schemes and data flow schemes
Normal design algebra
First order data types and first order logic
Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
Methods and means of parallel processing of information
Deciding freeness for program schemes with a single unary function
scientific article; zbMATH DE number 7453191 (Why is no real title available?)
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
Semantics of algorithmic languages
Expressive power of typed and type-free programming languages
scientific article; zbMATH DE number 3567992 (Why is no real title available?)
Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
scientific article; zbMATH DE number 3737028 (Why is no real title available?)
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
On abstraction and the expressive power of programming languages
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas
Two theorems about the completeness of Hoare's logic
An analysis of the effect of rounding errors on the flow of control in numerical processes
Extended linear macro grammars, iteration grammars, and register programs
Recursion-closed algebraic theories
The unwind property for programs with bounded memory
A formal specification of document processing
Floyd's principle, correctness theories and program equivalence
Hoare's logic and Peano's arithmetic
Read/write factorizable programs
Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
A difference in complexity between recursion and tail recursion
Monadic recursion schemes: The effect of constants
Equivalences among logics of programs
Expressing program looping in regular dynamic logic
Continuation semantics for flowgraph equations

This page was built for publication: Theory of program structures: Schemes, semantics, verification

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