AAnalyzing Runtime and Size Complexity of Integer ProgramsMarc Brockschmidt, Microsoft Research Fabian Emmes, RWTH Aachen University Stephan Falke, Karlsruhe Institute of Technology Carsten Fuhs, Birkbeck, University of London Jürgen Giesl, RWTH Aachen UniversityWe present a modular approach to automatic complexity analysis of integer programs. Based on a novelalternation between finding symbolic time bounds for program parts and using these to infer bounds on theabsolute values of program vari