Completeness and counter-example generations of a basic protocol logic (extended abstract)

zbMATH Open1276.03026MaRDI QIDQ2863872FDOQ2863872

Authors: Koji Hasebe, Mitsuhiro Okada 

Publication date: 4 December 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066106000351?np=y

Recommendations

• scientific article; zbMATH DE number 1059316
• A logic for extensional protocols
• On completeness of logic programs
• scientific article; zbMATH DE number 1834576
• Completeness of the generalized propositional calculus
• Generalizing completeness results for loop checks in logic programming
• Some general incompleteness results for partial correctness logics
• Completed logic programs and their consistency
• scientific article; zbMATH DE number 3869303

zbMATH Keywords

first-order predicate logicsecurity protocol analysisagreement propertiesproof-search method

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A logic for extensional protocols
• Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols

This page was built for publication: Completeness and counter-example generations of a basic protocol logic (extended abstract)

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