Bisimulation for higher-order process calculi
Information and Computation
A calculus for cryptographic protocols
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Proof Techniques for Cryptographic Processes
SIAM Journal on Computing
A bisimulation method for cryptographic protocols
Nordic Journal of Computing
From pi-Calculus to Higher-Order pi-Calculus - and Back
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Automatic testing equivalence verification of spi calculus specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
On the bisimulation proof method
Mathematical Structures in Computer Science
On bisimulations for the spi calculus
Mathematical Structures in Computer Science
A Type Discipline for Authorization in Distributed Systems
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Environmental Bisimulations for Higher-Order Languages
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A type discipline for authorization policies
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
A uniform type structure for secure information flow
ACM Transactions on Programming Languages and Systems (TOPLAS)
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
The Higher-Order, Call-by-Value Applied Pi-Calculus
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Symbolic bisimulation for the applied pi calculus
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Game semantics for higher-order concurrency
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
First-order reasoning for higher-order concurrency
Computer Languages, Systems and Structures
Symbolic bisimulation for a higher-order distributed language with passivation
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Globally governed session semantics
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We study a higher-order concurrent language with cryptographic primitives, for which we develop a sound and complete, firstorder testing theory for the preservation of safety properties. Our theory is based on co-inductive set simulations over transitions in a first-order Labelled Transition System. This keeps track of the knowledge of the observer, and treats transmitted higher-order values in a symbolic manner, thus obviating the quantification over functional contexts. Our characterisation provides an attractive proof technique, and we illustrate its usefulness in proofs of equivalence, including cases where bisimulation theory does not apply.