The following pages link to (Q4124327):
Displaying 7 items.
- Fundamentals of reversible flowchart languages (Q896906) (← links)
- Termination of rewriting (Q1098624) (← links)
- A probabilistic remark on algebraic program testing (Q1253894) (← links)
- Using automata theory for characterizing the semantics of terminological cycles (Q1380409) (← links)
- An abstract formalization of correct schemas for program synthesis (Q1583858) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Foundations of a theorem prover for functional and mathematical uses (Q4275695) (← links)
