Preorder-constrained simulations for program refinement with effects

DOI10.1007/978-3-031-66438-0_3MaRDI QIDQ6666773zbMATH OpenFDO

Authors Koko Muroya, Natsuki Urabe

Publication date 20 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-66438-0_3

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cites work

• A sound and complete bisimulation for contextual equivalence in -calculus with call/cc
• Algorithmic probabilistic game semantics. Playing games with automata
• Automata, Languages and Programming
• Behavioural equivalence via modalities for algebraic effects
• Bisimulation through probabilistic testing
• Buffered simulation games for Büchi automata
• Constrained simulations, nested simulation semantics and counting bisimulations
• Deciding all behavioral equivalences at once: a game for linear-time-branching-time spectroscopy
• Distilling abstract machines
• Equations, contractions, and unique solutions
• From applicative to environmental bisimulation
• Generic forward and backward simulations. III: Quantitative simulations by matrices
• scientific article; zbMATH DE number 1705158 (Why is no real title available?)
• Languages ordered by the subword order
• New up-to techniques for weak bisimulation
• On the bisimulation proof method
• Simulations in coalgebra
• The structural \(\lambda \)-calculus
• Theories of orders on the set of words
• Unifying the linear time-branching time spectrum of process semantics
• Untyped lambda-calculus with input-output

Cited in

(1)

• A robust graph-based approach to observational equivalence

This page was built for publication: Preorder-constrained simulations for program refinement with effects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666773)