Pages that link to "Item:Q1233308"
From MaRDI portal
The following pages link to Theory of program structures: Schemes, semantics, verification (Q1233308):
Displayed 47 items.
- A difference in complexity between recursion and tail recursion (Q519902) (← links)
- Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (Q624386) (← links)
- Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas (Q649588) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Two theorems about the completeness of Hoare's logic (Q794426) (← links)
- Deterministic and nondeterministic flowchart interpretations (Q796975) (← links)
- Expressiveness and the completeness of Hoare's logic (Q800082) (← links)
- The propositional dynamic logic of deterministic, well-structured programs (Q801682) (← links)
- Equivalences among logics of programs (Q801684) (← links)
- Normal design algebra (Q844885) (← links)
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512) (← links)
- Decision problems for pushdown threads (Q884992) (← links)
- The unwind property for programs with bounded memory (Q1067771) (← links)
- Continuation semantics for flowgraph equations (Q1080651) (← links)
- On flowchart theories. I. The deterministic case (Q1093364) (← links)
- Concurrent program schemes and their logics (Q1094866) (← links)
- On the detection of unstructuredness in flowgraphs (Q1098619) (← links)
- Succinct representation of regular sets using gotos and Boolean variables (Q1101207) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I (Q1143165) (← links)
- The equivalence of r.e. program schemes and data flow schemes (Q1144928) (← links)
- Computable queries for relational data bases (Q1151060) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II (Q1152704) (← links)
- Methods and means of parallel processing of information (Q1155954) (← links)
- Recursion-closed algebraic theories (Q1157899) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- Deciding freeness for program schemes with a single unary function (Q1159977) (← links)
- Expressing program looping in regular dynamic logic (Q1161284) (← links)
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs (Q1163369) (← links)
- Hoare's logic and Peano's arithmetic (Q1170877) (← links)
- Extended linear macro grammars, iteration grammars, and register programs (Q1247747) (← links)
- Modifications of the program scheme model (Q1258173) (← links)
- Propositional dynamic logic of regular programs (Q1258296) (← links)
- Monadic recursion schemes: The effect of constants (Q1259576) (← links)
- A formal specification of document processing (Q1370522) (← links)
- On schematological equivalence of partially interpreted dataflow networks (Q1373139) (← links)
- Program schemata vs. automata for decidability of program logics (Q1392141) (← links)
- Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\) (Q1683704) (← links)
- Equivalence of conservative, free, linear program schemas is decidable (Q1853616) (← links)
- Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming (Q2640347) (← links)
- (Q3923599) (← links)
- (Q4139645) (← links)
- An analysis of the effect of rounding errors on the flow of control in numerical processes (Q4192895) (← links)
- (Q5020650) (← links)
- On abstraction and the expressive power of programming languages (Q5096222) (← links)
- First order data types and first order logic (Q5096240) (← links)
- Read/write factorizable programs (Q6113488) (← links)