74
F. Frohn
References
1. Bagnara, R., Pescetti, A., Zaccagnini, A., Zaffanella, E.: PURRS: Towards computer algebra support for fully automatic worst-case complexity analysis (2005),
arXiv:cs/0512056 [cs.MS]
2. Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Acceleration from theory to
practice. STTT 10(5), 401–424 (2008). https://doi.org/10.1007/s10009-008-0064-3
3. Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat acceleration in
symbolic model checking. In: ATVA ’05. pp. 474–488. LNCS 3707 (2005).
https://doi.org/10.1007/11562948 35
4. Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces. Ph.D. thesis, Universit´ e de Li` ege (1999), https://orbi.uliege.be/bitstream/2268/74874/1/
Boigelot98.pdf
5. Boigelot, B.: On iterating linear transformations over recognizable sets
of integers. Theoretical Computer Science 309(1-3), 413–468 (2003).
https://doi.org/10.1016/S0304-3975(03)00314-1
6. Bozga, M., Gˆ ırlea, C., Iosif, R.: Iterating octagons. In: TACAS ’09. pp. 337–351.
LNCS 5505 (2009). https://doi.org/10.1007/978-3-642-00768-2 29
7. Bozga, M., Iosif, R., Konecn´ y, F.: Fast acceleration of ultimately periodic relations.
In: CAV ’10. pp. 227–242. LNCS 6174 (2010). https://doi.org/10.1007/978-3-64214295-6 23
8. Bozga, M., Iosif, R., Konecn´ y, F.: Deciding conditional termination. Logical Methods
in Computer Science 10(3) (2014). https://doi.org/10.2168/LMCS-10(3:8)2014
9. Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and
presburger arithmetic. In: CAV ’98. pp. 268–279. LNCS 1427 (1998).
https://doi.org/10.1007/BFb0028751
10. Farzan, A., Kincaid, Z.: Compositional recurrence analysis. In: FMCAD ’15. pp.
57–64 (2015). https://doi.org/10.1109/FMCAD.2015.7542253
11. Frohn, F., Giesl, J.: Proving non-termination via loop acceleration. In: FMCAD ’19.
pp. 221–230 (2019). https://doi.org/10.23919/FMCAD.2019.8894271
12. Frohn, F.: A calculus for modular loop acceleration – artifact evaluation (2020).
https://doi.org/10.5281/zenodo.3676348
13. Frohn, F.: A calculus for modular loop acceleration (2020), extended version,
arXiv:2001.01516 [cs.LO]
14. Frohn, F.: Empirical evaluation of “A calculus for modular loop acceleration” (2020),
https://ffrohn.github.io/acceleration-calculus
15. Frohn, F., Hark, M., Giesl, J.: On the decidability of termination for polynomial
loops (2019), arXiv:1910.11588 [cs.LO]
16. Frohn, F., Naaf, M., Brockschmidt, M., Giesl, J.: Inferring lower runtime bounds
for integer programs (2019), arXiv:1911.01077 [cs.LO]
17. Frohn, F., Naaf, M., Hensel, J., Brockschmidt, M., Giesl, J.: Lower runtime
bounds for integer programs. In: IJCAR ’16. pp. 550–567. LNCS 9706 (2016).
https://doi.org/10.1007/978-3-319-40229-1 37
18. Ganty, P., Iosif, R., Konecn´ y, F.: Underapproximation of procedure summaries for
integer programs. STTT 19(5), 565–584 (2017). https://doi.org/10.1007/s10009016-0420-7
19. Giesl, J., Rubio, A., Sternagel, C., Waldmann, J., Yamada, A.: The termination
and complexity competition. In: TACAS ’19. pp. 156–166. LNCS 11429 (2019).
https://doi.org/10.1007/978-3-030-17502-3 10
F. Frohn
References
1. Bagnara, R., Pescetti, A., Zaccagnini, A., Zaffanella, E.: PURRS: Towards computer algebra support for fully automatic worst-case complexity analysis (2005),
arXiv:cs/0512056 [cs.MS]
2. Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Acceleration from theory to
practice. STTT 10(5), 401–424 (2008). https://doi.org/10.1007/s10009-008-0064-3
3. Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat acceleration in
symbolic model checking. In: ATVA ’05. pp. 474–488. LNCS 3707 (2005).
https://doi.org/10.1007/11562948 35
4. Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces. Ph.D. thesis, Universit´ e de Li` ege (1999), https://orbi.uliege.be/bitstream/2268/74874/1/
Boigelot98.pdf
5. Boigelot, B.: On iterating linear transformations over recognizable sets
of integers. Theoretical Computer Science 309(1-3), 413–468 (2003).
https://doi.org/10.1016/S0304-3975(03)00314-1
6. Bozga, M., Gˆ ırlea, C., Iosif, R.: Iterating octagons. In: TACAS ’09. pp. 337–351.
LNCS 5505 (2009). https://doi.org/10.1007/978-3-642-00768-2 29
7. Bozga, M., Iosif, R., Konecn´ y, F.: Fast acceleration of ultimately periodic relations.
In: CAV ’10. pp. 227–242. LNCS 6174 (2010). https://doi.org/10.1007/978-3-64214295-6 23
8. Bozga, M., Iosif, R., Konecn´ y, F.: Deciding conditional termination. Logical Methods
in Computer Science 10(3) (2014). https://doi.org/10.2168/LMCS-10(3:8)2014
9. Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and
presburger arithmetic. In: CAV ’98. pp. 268–279. LNCS 1427 (1998).
https://doi.org/10.1007/BFb0028751
10. Farzan, A., Kincaid, Z.: Compositional recurrence analysis. In: FMCAD ’15. pp.
57–64 (2015). https://doi.org/10.1109/FMCAD.2015.7542253
11. Frohn, F., Giesl, J.: Proving non-termination via loop acceleration. In: FMCAD ’19.
pp. 221–230 (2019). https://doi.org/10.23919/FMCAD.2019.8894271
12. Frohn, F.: A calculus for modular loop acceleration – artifact evaluation (2020).
https://doi.org/10.5281/zenodo.3676348
13. Frohn, F.: A calculus for modular loop acceleration (2020), extended version,
arXiv:2001.01516 [cs.LO]
14. Frohn, F.: Empirical evaluation of “A calculus for modular loop acceleration” (2020),
https://ffrohn.github.io/acceleration-calculus
15. Frohn, F., Hark, M., Giesl, J.: On the decidability of termination for polynomial
loops (2019), arXiv:1910.11588 [cs.LO]
16. Frohn, F., Naaf, M., Brockschmidt, M., Giesl, J.: Inferring lower runtime bounds
for integer programs (2019), arXiv:1911.01077 [cs.LO]
17. Frohn, F., Naaf, M., Hensel, J., Brockschmidt, M., Giesl, J.: Lower runtime
bounds for integer programs. In: IJCAR ’16. pp. 550–567. LNCS 9706 (2016).
https://doi.org/10.1007/978-3-319-40229-1 37
18. Ganty, P., Iosif, R., Konecn´ y, F.: Underapproximation of procedure summaries for
integer programs. STTT 19(5), 565–584 (2017). https://doi.org/10.1007/s10009016-0420-7
19. Giesl, J., Rubio, A., Sternagel, C., Waldmann, J., Yamada, A.: The termination
and complexity competition. In: TACAS ’19. pp. 156–166. LNCS 11429 (2019).
https://doi.org/10.1007/978-3-030-17502-3 10