Soft constraint programming to analysing security protocols

DOI10.1017/S1471068404002121MaRDI QIDQ4669650zbMATH OpenFDO

Authors Giampaolo Bella, Stefano Bistarelli

Publication date 15 April 2005

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1471068404002121

Mathematics Subject Classification ID

Network protocols (68M12) Logic programming (68N17)

Recommendations

• Formal correctness of security protocols.
• Formal analysis of Kerberos 5
• Analyzing security protocols with secrecy types and logic programs
• scientific article; zbMATH DE number 1927581
• scientific article; zbMATH DE number 2163007

Cited in

(2)

• Extending security protocol analysis: new challenges
• Semiring-Based Soft Constraints

This page was built for publication: Soft constraint programming to analysing security protocols

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