Reasoning About Recursively Defined Data Structures
Journal of the ACM (JACM)
Polynomial-time computation via local inference relations
ACM Transactions on Computational Logic (TOCL)
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Modular proof systems for partial functions with Evans equality
Information and Computation - Special issue: Combining logical systems
Decision procedures for term algebras with integer constraints
Information and Computation - Special issue: Combining logical systems
Rewrite-Based Decision Procedures
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Challenges in the Automated Verification of Security Protocols
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Efficient Hierarchical Reasoning about Functions over Numerical Domains
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Easy intruder deduction problems with homomorphisms
Information Processing Letters
On local reasoning in verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Hierarchic reasoning in local theory extensions
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Quantitative Separation Logic and Programs with Lists
Journal of Automated Reasoning
Towards complete reasoning about axiomatic specifications
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Modular termination and combinability for superposition modulo counter arithmetic
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Deciding functional lists with sublist sets
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
| Hi-index | 0.00 |
We study possibilities of reasoning about extensions of base theories with functions which satisfy certain recursion (or homomorphism) properties. Our focus is on emphasizing possibilities of hierarchical and modular reasoning in such extensions and combinations thereof. We present practical applications in verification and cryptography.