Some applications of topology to program semantics

DOI10.1007/BF01744573zbMath0548.68011MaRDI QIDQ3340119

Rohit Parikh

Publication date: 1983

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

Galois connectionrelational semanticsprogram semanticsrules of inferencepartial correctness assertionsincompleteness of Hoare logicsLindenbaum topologymodularity of programs

Mathematics Subject Classification ID

Partial orders, general (06A06) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Topological lattices (06B30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (1)

Continuous Domains and their Information System Representation as Logical Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability in dynamic logic
• First-order dynamic logic
• On formalised computer programs
• Consistent and complementary formal theories of the semantics of programming languages
• An application of games to the completeness problem for formalized theories
• Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer
• Axiomatic Definitions of Programming Languages
• On the termination of program schemas
• Soundness and Completeness of an Axiom System for Program Verification
• Galois Connexions

This page was built for publication: Some applications of topology to program semantics