Author:
Comon-Lundh Hubert,Delaune Stéphanie
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Comon, H.: Complete axiomatizations of some quotient term algebras. Theoretical Computer Science 118(2), 167–191 (1993)
2. Lecture Notes in Computer Science;H. Comon-Lundh,2004
3. Lecture Notes in Computer Science;H. Comon-Lundh,2003
4. Comon-Lundh, H., Delaune, S.: The finite variant property: How to get rid of some algebraic properties. Research Report LSV-04-17, Laboratoire Spécification et Vérification, ENS Cachan, France, 21 pages (2004)
5. Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In: Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS 2003), Ottawa, Canada, pp. 271–280. IEEE Comp. Soc. Press, Los Alamitos (2003)
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. NuITP: An Inductive Theorem Prover for Equational Program Verification;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09
2. Decision and Complexity of Dolev-Yao Hyperproperties;Proceedings of the ACM on Programming Languages;2024-01-05
3. Symbolic Analysis by Using Folding Narrowing with Irreducibility and SMT Constraints;Proceedings of the 9th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems;2023-10-18
4. Proving Unlinkability Using ProVerif Through Desynchronised Bi-Processes;2023 IEEE 36th Computer Security Foundations Symposium (CSF);2023-07
5. Optimizing Maude Programs via Program Specialization;Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems;2023