Search Results - (java/c/haskell/prolog OR (jana/c/haskell/prolog OR jan/c/haskell/prolog)) (programs OR progress)
-
1
Authors: et al.
Source: Giesl, J, Aschermann, C, Brockschmidt, M, Emmes, F, Frohn, F, Fuhs, C, Hensel, J, Otto, C, Plücker, M, Schneider-Kamp, P, Ströder, T, Swiderski, S & Thiemann, R 2017, ' Analyzing Program Termination and Complexity Automatically with AProVE ', Journal of Automated Reasoning, vol. 58, no. 1, pp. 3-31 . https://doi.org/10.1007/s10817-016-9388-y
Subject Terms: Term rewriting, Termination analysis, csis, 13. Climate action, 0202 electrical engineering, electronic engineering, information engineering, Java/C/Haskell/Prolog programs, PROVING TERMINATION, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Complexity analysis
File Description: application/pdf
Access URL: https://eprints.bbk.ac.uk/id/eprint/16551/1/JAR-AProVE.pdf
https://link.springer.com/article/10.1007/s10817-016-9388-y
https://dblp.uni-trier.de/db/journals/jar/jar58.html#GieslABEFFHOPSS17
https://www.microsoft.com/en-us/research/publication/analyzing-program -termination-complexity-automatically-aprove/
https://publications.rwth-aachen.de/record/685599
https://eprints.bbk.ac.uk/id/eprint/16551/
https://www.microsoft.com/en-us/research/wp-content/uploads/2016/10/Analyzing_Program_Termination_and_Complexity_Automatically_with_AProVE.pdf
https://findresearcher.sdu.dk:8443/ws/files/141379108/Analyzing_Program_Termination_and_Complexity_Automatically_with_AProVE.pdf
Full Text Finder
Nájsť tento článok vo Web of Science