Folgen
Florian Frohn
Florian Frohn
Bestätigte E-Mail-Adresse bei cs.rwth-aachen.de
Titel
Zitiert von
Zitiert von
Jahr
Analyzing Program Termination and Complexity Automatically with AProVE
J Giesl, C Aschermann, M Brockschmidt, F Emmes, F Frohn, C Fuhs, ...
Journal of Automated Reasoning 58, 3-31, 2017
1622017
Proving Termination of Programs Automatically with AProVE
J Giesl, M Brockschmidt, F Emmes, F Frohn, C Fuhs, C Otto, M Plücker, ...
Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as …, 2014
1252014
Lower runtime bounds for integer programs
F Frohn, M Naaf, J Hensel, M Brockschmidt, J Giesl
Automated Reasoning: 8th International Joint Conference, IJCAR 2016, Coimbra …, 2016
352016
Automatically proving termination and memory safety for programs with pointer arithmetic
T Ströder, J Giesl, M Brockschmidt, F Frohn, C Fuhs, J Hensel, ...
Journal of Automated Reasoning 58, 33-65, 2017
342017
AProVE: Termination and Memory Safety of C Programs: (Competition Contribution)
T Ströder, C Aschermann, F Frohn, J Hensel, J Giesl
Tools and Algorithms for the Construction and Analysis of Systems: 21st …, 2015
302015
Proving Non-Termination via Loop Acceleration
F Frohn, J Giesl
arXiv preprint arXiv:1905.11187, 2019
252019
Complexity Analysis for Java with AProVE
F Frohn, J Giesl
Integrated Formal Methods: 13th International Conference, IFM 2017, Turin …, 2017
252017
Proving termination and memory safety for programs with pointer arithmetic
T Ströder, J Giesl, M Brockschmidt, F Frohn, C Fuhs, J Hensel, ...
Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as …, 2014
252014
Complexity analysis for term rewriting by integer transition systems
M Naaf, F Frohn, M Brockschmidt, C Fuhs, J Giesl
Frontiers of Combining Systems: 11th International Symposium, FroCoS 2017 …, 2017
222017
A calculus for modular loop acceleration
F Frohn
International Conference on Tools and Algorithms for the Construction and …, 2020
202020
Termination of triangular integer loops is decidable
F Frohn, J Giesl
Computer Aided Verification: 31st International Conference, CAV 2019, New …, 2019
192019
Lower bounds for runtime complexity of term rewriting
F Frohn, J Giesl, J Hensel, C Aschermann, T Ströder
Journal of Automated Reasoning 59, 121-163, 2017
192017
Proving termination of programs with bitvector arithmetic by symbolic execution
J Hensel, J Giesl, F Frohn, T Ströder
Software Engineering and Formal Methods: 14th International Conference, SEFM …, 2016
192016
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
J Hensel, J Giesl, F Frohn, T Ströder
Journal of Logical and Algebraic Methods in Programming 97, 105-130, 2018
162018
Polynomial Loops: Beyond Termination.
M Hark, F Frohn, J Giesl
LPAR 20, 279-297, 2020
152020
Termination of polynomial loops
F Frohn, M Hark, J Giesl
International Static Analysis Symposium, 89-112, 2020
142020
Inferring lower runtime bounds for integer programs
F Frohn, M Naaf, M Brockschmidt, J Giesl
ACM Transactions on Programming Languages and Systems (TOPLAS) 42 (3), 1-50, 2020
132020
Analyzing runtime complexity via innermost runtime complexity
F Frohn, J Giesl
LPAR 17, 249-268, 2017
122017
Inferring lower bounds for runtime complexity
F Frohn, J Giesl, J Hensel, C Aschermann, T Ströder
26th International Conference on Rewriting Techniques and Applications (RTA …, 2015
122015
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs: (Competition Contribution)
J Hensel, F Emrich, F Frohn, T Ströder, J Giesl
Tools and Algorithms for the Construction and Analysis of Systems: 23rd …, 2017
112017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20