On folk theorems

DOI10.1145/358886.358892MaRDI QIDQ3870277zbMATH OpenOpenAlexWikidataFDO

Authors David Harel

Publication date 1980

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/358886.358892

zbMATH Keywords

flowchartfolk theoremstructured programmingwhile-programs

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(22)

• Concurrent program schemes and their logics
• Two normal form theorems for CSP programs
• Weak second order characterizations of various program verification systems
• The independence of control structures in abstract programming systems
• Upper bounds for static resource allocation in a distributed system
• A unified approach for studying the properties of transition systems
• Fixed point theorems and semantics: A folk tale
• Datalog extensions for database queries and updates
• General iteration and unary functions
• On the control power of integer division
• Dijkstra graphs
• Epistemic injustice in mathematics
• Functional Pearls
• Causal commutative arrows
• Gems of Corrado Böhm
• Normal forms in total correctness for while programs and action systems
• Undecidability of the positive calculus of relations with transitive closure and difference: hypothesis elimination using graph loops
• Guarded Kleene algebra with tests: coequations, coinduction, and completeness
• Automatic analysis of DMA races using model checking and k-induction
• Polyvariant mixed computation for analyzer programs
• Universality and semicomputability for nondeterministic programming languages over abstract algebras
• On the recursive decomposition ordering with lexicographical status and other related orderings

This page was built for publication: On folk theorems

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