On powerdomains and modality

DOI10.1016/0304-3975(85)90037-4zbMath0579.68018MaRDI QIDQ1067409

Glynn Winskel

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90037-4

zbMATH Keywords

modal logic; branching tree; denotational semantics of non-deterministic computations

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

68Q60: Specification and verification (program logics, model checking, etc.)

68Q65: Abstract data types; algebraic specification

Related Items

A comment on relevant truth table logic, Extracting Program Logics From Abstract Interpretations Defined by Logical Relations, Reverse mathematics, well-quasi-orders, and Noetherian spaces, Relation lifting, a survey, Developments in concurrent Kleene algebra, Coalgebraic representations of distributive lattices with operators, A new generic scheme for functional logic programming with constraints, The connected Vietoris powerlocale, The mixed powerdomain, A note on fuzzy power relations, A representable approach to finite nondeterminism, A semantic theory for value-passing processes based on the late approach, Mathematical modal logic: A view of its evolution, Domain theory for concurrency, Power structures, Deduction with uncertain conditionals, A domain equation for bisimulation, Exploring an Interface Model for CKA, A Discrete Geometric Model of Concurrent Program Execution

Cites Work

• Algebraic semantics
• Proving Liveness Properties of Concurrent Programs
• A Powerdomain Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item