Name
Abstract | ||
|---|---|---|
We propose and study a logic able to state and reason about equational constraints, by combining aspects of classical propositional logic, equational logic, and quantifiers. The logic has a classical structure over an algebraic base, and a form of universal quantification distinguishing between local and global validity of equational constraints. We present a sound and complete axiomatization for the logic, parameterized by an equational specification of the algebraic base. We also show (by reduction to SAT) that the logic is decidable, under the assumption that its algebraic base is given by a convergent rewriting system, thus covering an interesting range of examples. As an application, we analyze offline guessing attacks to security protocols, where the equational base specifies the algebraic properties of the cryptographic primitives. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-47709-0_4 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Classical logic,Equational logic,Completeness,Decidability | Computational logic,Discrete mathematics,Algebra,Computer science,Classical logic,Equational logic,Many-valued logic,Predicate logic,Higher-order logic,Intermediate logic,Dynamic logic (modal logic) | Conference |
Volume | ISSN | Citations |
9160 | 0302-9743 | 1 |
PageRank | References | Authors |
0.37 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreia Mordido | 1 | 1 | 0.37 |
| Carlos Caleiro | 2 | 14 | 4.23 |