Fragments of first-order logic extending stratified formulas with restricted self-looping functions on one sort are decidable because they have the symbolic model property.
The TAMARIN Prover for the Symbolic Analysis of Security Protocols,
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative citing papers
Unrolling heuristic for recursive functions is complete for first-order theories of algebraic datatypes combined with decidable quantifier-free background theories.
Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.
The authors built an automated toolchain that extracts symbolic models from real binaries of cryptographic protocols and analyzes them for constant-time and speculative side-channel leaks, demonstrated on WhatsApp and e-passport implementations.
citing papers explorer
-
Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
Fragments of first-order logic extending stratified formulas with restricted self-looping functions on one sort are decidable because they have the symbolic model property.
-
Complete first-order reasoning for functional programs
Unrolling heuristic for recursive functions is complete for first-order theories of algebraic datatypes combined with decidable quantifier-free background theories.
-
Symbolic Synthesis for LTLf+ Obligations
Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.
-
Automated Side-Channel Analysis of Cryptographic Protocol Implementations
The authors built an automated toolchain that extracts symbolic models from real binaries of cryptographic protocols and analyzes them for constant-time and speculative side-channel leaks, demonstrated on WhatsApp and e-passport implementations.