Freshness and Name-Restriction in Sets of Traces with Names
From MaRDI portal
Publication:3000621
DOI10.1007/978-3-642-19805-2_25zbMath1241.68049OpenAlexW1561117500MaRDI QIDQ3000621
Vincenzo Ciancia, Murdoch James Gabbay
Publication date: 19 May 2011
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19805-2_25
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (12)
Nominal Kleene Coalgebra ⋮ Game Semantics in the Nominal Model ⋮ Game semantics approach to higher-order complexity ⋮ Completeness and incompleteness in nominal Kleene algebra ⋮ Exploring nominal cellular automata ⋮ Nominal Automata with Name Binding ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness ⋮ A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours ⋮ Reversible Kleene lattices ⋮ Denotational Semantics with Nominal Scott Domains
Uses Software
This page was built for publication: Freshness and Name-Restriction in Sets of Traces with Names
