Semantics with applications: an appetizer.
From MaRDI portal
Publication:884946
zbMath1126.68052MaRDI QIDQ884946
Hanne Riis Nielson, Flemming Nielson
Publication date: 7 June 2007
Published in: Undergraduate Topics in Computer Science (Search for Journal in Brave)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Semantics in the theory of computing (68Q55)
Related Items (11)
Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs ⋮ Unnamed Item ⋮ Transfinite semantics in the form of greatest fixpoint ⋮ Reasoning about iteration and recursion uniformly based on big-step semantics ⋮ Temporal reasoning through automatic translation of tock-CSP into timed automata ⋮ Divergences on monads for relational program logics ⋮ Secure Guarded Commands ⋮ Planning-based knowing how: a unified approach ⋮ Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs ⋮ An abstract contract theory for programs with procedures ⋮ Nondeterministic semantics of compound diagrams
This page was built for publication: Semantics with applications: an appetizer.
