A logical characterisation of static equivalence

DOI10.1016/J.ENTCS.2007.02.032MaRDI QIDQ5262936zbMATH OpenOpenAlexFDO

Authors Hans Hüttel, Michael Pedersen

Publication date 10 July 2015

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2007.02.032

zbMATH Keywords

frameslogiccryptographic protocolsstatic equivalenceapplied pi-calculus

Mathematics Subject Classification ID

Cryptography (94A60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Static equivalence \textit{is} harder than knowledge
• Modal logics for cryptographic processes
• Reducing equational theories for the decision of static equivalence
• Reducing equational theories for the decision of static equivalence
• Foundations of Software Science and Computation Structures

Cites work

• A calculus for cryptographic protocols: The spi calculus
• Automata, Languages and Programming
• Mobile values, new names, and secure communication
• Modal logics for cryptographic processes
• Modal logics for mobile processes
• Proof techniques for cryptographic processes
• Static equivalence \textit{is} harder than knowledge

Cited in

(2)

• Modal logics for nominal transition systems
• A Spatial Equational Logic for the Applied π-Calculus

Describes a project that uses

Uses Software

• OpenSSL

This page was built for publication: A logical characterisation of static equivalence

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