Skip to content

Publications

Preferred Citation Format

To reference pymwp, use: 

@inproceedings{aubert2023,
    title        = {pymwp: A Static Analyzer Determining Polynomial Growth Bounds},
    author       = {Aubert, Cl{\'e}ment and Rubiano, Thomas and Rusch, Neea and Seiller, Thomas},
    year         = 2023,
    booktitle    = {Automated Technology for Verification and Analysis},
    publisher    = {Springer Nature Switzerland},
    address      = {Cham},
    pages        = {263--275},
    doi          = {10.1007/978-3-031-45332-8_14},
    isbn         = {978-3-031-45332-8},
    editor       = {Andr{\'e}, {\'E}tienne and Sun, Jun}
}

The article is available without paywall here.

Published Works

Mentions of pymwp in scientific literature.

  • Seiller, Thomas. "Mathematical informatics." HDR, Université Sorbonne Paris Nord, 2024. https://theses.hal.science/tel-04616661/

  • Aubert, Clément, Thomas Rubiano, Neea Rusch, and Thomas Seiller. “Pymwp: A Static Analyzer Determining Polynomial Growth Bounds.” Automated Technology for Verification and Analysis, 2023, 263–75. https://doi.org/10.1007/978-3-031-45332-8_14.

  • Rusch, Neea. “Formally Verified Resource Bounds through Implicit Computational Complexity.” Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity, 2022, 17–20. https://doi.org/10.1145/3563768.3565545.

  • Aubert, Clément, Thomas Rubiano, Neea Rusch, and Thomas Seiller. “MWP-analysis improvement and implementation: realizing implicit computational complexity.“ 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Leibniz International Proceedings in Informatics, vol. 228, pp. 26:1–26:23. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2022). https://doi.org/10.4230/LIPIcs.FSCD.2022.26.