Efficient certification of complexity proofs: formalizing the Perron--Frobenius theorem (invited talk paper)

Jose Divasón, Sebastiaan Joosten, Ondrej Kuncar, René Thiemann, Akihisa Yamada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

LanguageEnglish
Title of host publicationProceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs
Pages2-13
Number of pages12
DOIs
StatePublished - 2018
Event7th ACM SIGPLAN International Conference on Certified Programs and Proofs 2018 - Los Angeles, United States
Duration: 8 Jan 20189 Jan 2018
Conference number: 7
https://conf.researchr.org/home/CPP-2018

Conference

Conference7th ACM SIGPLAN International Conference on Certified Programs and Proofs 2018
Abbreviated titleCPP 2018
CountryUnited States
CityLos Angeles
Period8/01/189/01/18
Internet address

Cite this

Divasón, J., Joosten, S., Kuncar, O., Thiemann, R., & Yamada, A. (2018). Efficient certification of complexity proofs: formalizing the Perron--Frobenius theorem (invited talk paper). In Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 2-13). DOI: 10.1145/3167103
Divasón, Jose ; Joosten, Sebastiaan ; Kuncar, Ondrej ; Thiemann, René ; Yamada, Akihisa. / Efficient certification of complexity proofs: formalizing the Perron--Frobenius theorem (invited talk paper). Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. 2018. pp. 2-13
@inproceedings{20107ecd4ee24ebdb52b7befba7b1123,
title = "Efficient certification of complexity proofs: formalizing the Perron--Frobenius theorem (invited talk paper)",
author = "Jose Divas{\'o}n and Sebastiaan Joosten and Ondrej Kuncar and Ren{\'e} Thiemann and Akihisa Yamada",
year = "2018",
doi = "10.1145/3167103",
language = "English",
pages = "2--13",
booktitle = "Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs",

}

Divasón, J, Joosten, S, Kuncar, O, Thiemann, R & Yamada, A 2018, Efficient certification of complexity proofs: formalizing the Perron--Frobenius theorem (invited talk paper). in Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. pp. 2-13, 7th ACM SIGPLAN International Conference on Certified Programs and Proofs 2018, Los Angeles, United States, 8/01/18. DOI: 10.1145/3167103

Efficient certification of complexity proofs: formalizing the Perron--Frobenius theorem (invited talk paper). / Divasón, Jose; Joosten, Sebastiaan; Kuncar, Ondrej; Thiemann, René; Yamada, Akihisa.

Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. 2018. p. 2-13.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Efficient certification of complexity proofs: formalizing the Perron--Frobenius theorem (invited talk paper)

AU - Divasón,Jose

AU - Joosten,Sebastiaan

AU - Kuncar,Ondrej

AU - Thiemann,René

AU - Yamada,Akihisa

PY - 2018

Y1 - 2018

U2 - 10.1145/3167103

DO - 10.1145/3167103

M3 - Conference contribution

SP - 2

EP - 13

BT - Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs

ER -

Divasón J, Joosten S, Kuncar O, Thiemann R, Yamada A. Efficient certification of complexity proofs: formalizing the Perron--Frobenius theorem (invited talk paper). In Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs. 2018. p. 2-13. Available from, DOI: 10.1145/3167103