Author:
Jacquemard Florent,Klay Francis,Vacher Camille
Publisher
Springer Berlin Heidelberg
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Beyond the elementary representations of program invariants over algebraic data types;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18
2. Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars;ACM Transactions on Computational Logic;2017-10-31
3. Inductive theorem proving based on tree grammars;Annals of Pure and Applied Logic;2015-06
4. Compressibility of Finite Languages by Grammars;Descriptional Complexity of Formal Systems;2015
5. Algorithmic introduction of quantified cuts;Theoretical Computer Science;2014-09