E. Albert, P. Arenas, S. Genaim & G. Puebla (2008):
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis.
In: Proc. of 15th SAS.
Springer,
pp. 221–237,
doi:10.1007/978-3-540-69166-2_15.
M. Avanzini & U. Dal Lago (2017):
Complexity Analysis by Polymorphic Sized Type Inference and Constraint Solving.
Technical Report.
Universities of Bologna and Innsbruck.
Available at http://cl-informatik.uibk.ac.at/users/zini/CAPSTICS.pdf..
G. Bonfante, J.-Y. Marion & J.-Y. Moyen (2011):
Quasi-interpretations: A Way to Control Resources.
TCS 412(25),
pp. 2776–2796,
doi:10.1016/j.tcs.2011.02.007.
U. Dal Lago & Barbara Petit (2013):
The Geometry of Types.
In: Proc. of 40th POPL.
ACM,
pp. 167–178,
doi:10.1145/2429069.2429090.
C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-Kamp, R. Thiemann & H. Zankl (2007):
SAT Solving for Termination Analysis with Polynomial Interpretations.
In: Proc. 10th of SAT,
pp. 340–354,
doi:10.1007/978-3-540-72788-0_33.
C. Fuhs, J. Giesl, A. Middeldorp, P. Schneider-Kamp, R. Thiemann & H. Zankl (2008):
Maximal Termination.
In: Proc. of 19th RTA 5117.
Springer,
pp. 110–125,
doi:10.1007/978-3-540-70590-1_8.
E. Giachino, E. Broch Johnsen, C. Laneve & K. I. Pun (2016):
Time Complexity of Concurrent Programs - - A Technique Based on Behavioural Types -.
In: Proc. of 12th FACS,
LNCS 9539.
Springer,
pp. 199–216,
doi:10.1007/978-3-319-28934-2_11.
J. Hoffmann, A. Das & S.-C. Weng (2017):
Towards Automatic Resource Bound Analysis for OCaml.
In: Proc. of 44th POPL.
ACM,
pp. 359–373,
doi:10.1145/3009837.
J. Hughes, L. Pareto & A. Sabry (1996):
Proving the Correctness of Reactive Systems Using Sized Types.
In: Proc. of 23rd POPL.
ACM,
pp. 410–423,
doi:10.1145/237721.240882.
A. Podelski & A. Rybalchenko (2004):
A Complete Method for the Synthesis of Linear Ranking Functions.
In: Proc. 5th VMCAI,
pp. 239–251,
doi:10.1007/978-3-540-24622-0_20.
eptcs@eptcs.org