scientific article; zbMATH DE number 7327939
From MaRDI portal
Publication:5856409
Ramūnas Forsberg Gutkovas, Tjark Weber, Johannes Borgström, Joachim Parrow, Lars-Henrik Eriksson
Publication date: 26 March 2021
Full work available at URL: https://arxiv.org/abs/1904.02564
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First-order reasoning for higher-order concurrency
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus
- Modal logics for mobile processes
- Results on the propositional \(\mu\)-calculus
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- A calculus of mobile processes. I
- A calculus for cryptographic protocols: The spi calculus
- Isabelle/HOL. A proof assistant for higher-order logic
- Distinguishing between communicating transactions
- Model checking mobile processes
- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
- Nominal logic, a first order theory of names and binding
- A modal logic for message passing processes
- Explicit fusions
- A domain equation for bisimulation
- A lattice-theoretical fixpoint theorem and its applications
- Proof Techniques for Cryptographic Processes
- Modal Logics for Cryptographic Processes
- Nominal Sets
- Cardinals in Isabelle/HOL
- Psi-calculi: a framework for mobile processes with nominal data and logic
- Nominal SOS
- Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
- Algebraic laws for nondeterminism and concurrency
- A Modal Logic for Full LOTOS based on Symbolic Transition Systems
- Divergence and unique solution of equations
- Mobile values, new names, and secure communication
- A Logical Characterisation of Static Equivalence
- Multiple-Labelled Transition Systems for nominal calculi and their logics
- Open Bisimulation for the Concurrent Constraint Pi-Calculus
- CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements
- General Bindings and Alpha-Equivalence in Nominal Isabelle
This page was built for publication:
