Verifying security protocols as planning in logic programming

DOI10.1145/383779.383785zbMath1365.68386OpenAlexW2049129243MaRDI QIDQ5738918

Fabio Massacci, Luigia Carlucci Aiello

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/383779.383785

zbMATH Keywords

logic programmingspecification languageAI planningsecurity protocols

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (8)

Parallel instantiation of ASP programs: techniques and experiments ⋮ Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography ⋮ A rule based knowledge transaction model for mobile environments ⋮ Autoepistemic answer set programming ⋮ Autoepistemic equilibrium logic and epistemic specifications ⋮ Attacking Fair-Exchange Protocols ⋮ Extending and implementing the stable model semantics ⋮ Reasoning with infinite stable models

This page was built for publication: Verifying security protocols as planning in logic programming