Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming
From MaRDI portal
Publication:5325767
DOI10.1007/978-3-642-02846-5_34zbMath1251.68156MaRDI QIDQ5325767
Hugo A. López, Thomas Troels Hildebrandt
Publication date: 24 July 2009
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02846-5_34
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68T42: Agent technology and artificial intelligence
Related Items
Abstract interpretation of temporal concurrent constraint programs, Subexponential concurrent constraint programming, Session-based concurrency, declaratively, Models and emerging trends of concurrent constraint programming
Cites Work
- Unnamed Item
- Unnamed Item
- An attack on the Needham-Schroeder public-key authentication protocol
- A calculus of mobile processes. I
- A calculus for cryptographic protocols: The spi calculus
- On the security of public key protocols
- Encryption as an abstract data-type
- Mobile values, new names, and secure communication
- A Declarative Framework for Security: Secure Concurrent Constraint Programming