Graph Theory in Coq: Minors, Treewidth, and Isomorphisms-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Graph Theory in Coq: Minors, Treewidth, and Isomorphisms

Published:2020-01-31 Issue:5 Volume:64 Page:795-825
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Doczkal Christian^ORCID,Pous Damien

Funder

European Research Council

Agence nationale de la recherche

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10817-020-09543-2.pdf

Reference35 articles.

1. Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. Theoret. Comput. Sci. 239(2), 211–229 (2000). https://doi.org/10.1016/S0304-3975(99)00220-0

2. Chou, C.: A formal theory of undirected graphs in higher-order logic. In: Melham, T.F., Camilleri, J. (eds.) TPHOL, Lecture Notes in Computer Science, vol. 859, pp. 144–157. Springer (1994). https://doi.org/10.1007/3-540-58450-1_40

3. Chou, C.T.: Mechanical verification of distributed algorithms in higher-order logic*. Comput. J. 38(2), 152–161 (1995). https://doi.org/10.1093/comjnl/38.2.152

4. Cohen, C.: Pragmatic quotient types in Coq. In: In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP, Lecture Notes in Computer Science, vol. 7998, pp. 213–228. Springer (2013). https://doi.org/10.1007/978-3-642-39634-2_17

5. Cohen, C., Dénès, M., Mörtberg, A.: Refinements for free!. In: Gonthier, G., Norrish, M. (eds.) Certified Programs and Proofs (CPP 2013), Lecture Notes in Computer Science, vol. 8307, pp. 147–162. Springer, Berlin (2013). https://doi.org/10.1007/978-3-319-03545-1_10

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On planarity of graphs in homotopy type theory;Mathematical Structures in Computer Science;2024-05-08

2. Application of Graph Theory for Blockchain Technologies;Mathematics;2024-04-10

3. Formally verified asymptotic consensus in robust networks;Lecture Notes in Computer Science;2024

4. On the Verification of the Correctness of a Subgraph Construction Algorithm;Lecture Notes in Computer Science;2023-12-30

5. Towards the Formal Verification of Wigderson’s Algorithm;Companion Proceedings of the 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity;2023-10-22

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3