ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs

• Published in: Theoretical Aspects of Computing - ICTAC 2021 Vol. 12819; pp. 357 - 365
• Main Authors: Hainry, Emmanuel, Jeandel, Emmanuel, Péchoux, Romain, Zeyen, Olivier
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2021; Springer International Publishing
• Series: Lecture Notes in Computer Science
• ISBN: 3030853144; 9783030853143
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-85315-0_20

ComplexityParser is a static complexity analyzer for Java programs providing the first implementation of a tier-based typing discipline. The input is a file containing Java classes. If the main method can be typed and, provided the program terminates, then the program is guaranteed to do so in polynomial time and hence also to have heap and stack sizes polynomially bounded. The application uses antlr to generate a parse tree on which it performs an efficient type inference: linear in the input size, provided that the method arity is bounded by some constant.