FAST: an efficient decision procedure for deduction and static equivalence

DOI10.4230/LIPICS.RTA.2011.11MaRDI QIDQ5389067zbMATH OpenFDO

Authors Bruno Conchinha, David Basin, Carlos Caleiro

Publication date 24 April 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_069d.html

zbMATH Keywords

deducibilityefficient algorithmsequational theoriessecurity protocolsstatic equivalence

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Automata, Languages and Programming
• Deciding knowledge in security protocols under equational theories
• YAPA: A Generic Tool for Computing Intruder Knowledge
• YAPA: a generic tool for computing intruder knowledge
• Automating security analysis: symbolic equivalence of constraint systems

Cited in

(7)

• FAST
• Analysing privacy-type properties in cryptographic protocols (invited talk)
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
• Computing knowledge in equational extensions of subterm convergent theories
• Fast algorithms for deciding the equivalence of propositional operator programs on ordered semigroup scales
• DeepSec: deciding equivalence properties for security protocols -- improved theory and practice
• Graph-embedded rewrite systems: combination and undecidability results

Describes a project that uses

Uses Software

• YAPA

This page was built for publication: FAST: an efficient decision procedure for deduction and static equivalence

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