Some applications of topology to program semantics
From MaRDI portal
Recommendations
Cites work
- An application of games to the completeness problem for formalized theories
- Axiomatic Definitions of Programming Languages
- Consistent and complementary formal theories of the semantics of programming languages
- Definability in dynamic logic
- First-order dynamic logic
- Galois Connexions
- scientific article; zbMATH DE number 3651720 (Why is no real title available?)
- scientific article; zbMATH DE number 3735127 (Why is no real title available?)
- scientific article; zbMATH DE number 3569792 (Why is no real title available?)
- scientific article; zbMATH DE number 3800904 (Why is no real title available?)
- scientific article; zbMATH DE number 3103212 (Why is no real title available?)
- On formalised computer programs
- On the termination of program schemas
- Soundness and Completeness of an Axiom System for Program Verification
- Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer
Cited in
(7)- Topological dualities in semantics
- Topology, monitorable properties and runtime verification
- scientific article; zbMATH DE number 1583311 (Why is no real title available?)
- Computational Topology via Functional Programming: A Baseline Analysis
- scientific article; zbMATH DE number 4030949 (Why is no real title available?)
- scientific article; zbMATH DE number 810107 (Why is no real title available?)
- Continuous domains and their information system representation as logical systems
This page was built for publication: Some applications of topology to program semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340119)