On folk theorems

DOI10.1145/358886.358892zbMath0432.68009OpenAlexW2078643445WikidataQ56505176 ScholiaQ56505176MaRDI QIDQ3870277

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

folk theoremstructured programmingwhile-programsflowchart

Mathematics Subject Classification ID

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

Related Items

Concurrent program schemes and their logics, Two normal form theorems for CSP programs, Universality and semicomputability for nondeterministic programming languages over abstract algebras, Weak second order characterizations of various program verification systems, Dijkstra graphs, Epistemic injustice in mathematics, The independence of control structures in abstract programming systems, Upper bounds for static resource allocation in a distributed system, On the recursive decomposition ordering with lexicographical status and other related orderings, 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, Causal commutative arrows, Normal forms in total correctness for while programs and action systems, Unnamed Item, Automatic analysis of DMA races using model checking and \(k\)-induction, On the control power of integer division, Functional Pearls, Polyvariant mixed computation for analyzer programs