Linearity and bisimulation
From MaRDI portal
Publication:997996
DOI10.1016/j.jlap.2007.02.011zbMath1119.68131OpenAlexW1986229147MaRDI QIDQ997996
Martin Berger, Kohei Honda, Nobuko Yoshida
Publication date: 10 August 2007
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2007.02.011
Related Items (5)
Trees from Functions as Processes ⋮ Fairness and communication-based semantics for session-typed languages ⋮ Linear logical relations and observational equivalences for session-based concurrency ⋮ Linear logic propositions as session types ⋮ Program equivalence in linear contexts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Strong normalisation in the \(\pi\)-calculus
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- A calculus of mobile processes. II
- On reduction-based process semantics
- Noninterference for concurrent programs and thread systems
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Game-theoretic analysis of call-by-value computation
- The name discipline of uniform receptiveness
- Secrecy by typing in security protocols
- Functions as processes
- Elementary structures in process theory (1): Sets with renaming
- On confluence in the π-calculus
- Typed behavioural equivalences for processes in the presence of subtyping
- Noninterference through flow analysis
- Authentication primitives and their compilation
- A uniform type structure for secure information flow
- Small bisimulations for reasoning about higher-order imperative programs
- Foundations of Software Science and Computational Structures
- A per model of secure information flow in sequential programs
This page was built for publication: Linearity and bisimulation
