Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Non-termination of Dalvik bytecode via compilation to CLP

Abstract : We present a set of rules for compiling a Dalvik bytecode program into a logic program with array constraints. Non-termination of the resulting program entails that of the original one, hence the techniques we have presented before for proving non-termination of constraint logic programs can be used for proving non-termination of Dalvik programs.
Document type :
Conference papers
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

Contributor : Réunion Univ Connect in order to contact the contributor
Submitted on : Friday, November 9, 2018 - 8:50:36 AM
Last modification on : Friday, January 21, 2022 - 3:27:02 AM
Long-term archiving on: : Sunday, February 10, 2019 - 12:47:43 PM


  • HAL Id : hal-01451692, version 1



Etienne Payet, Frédéric Mesnard. Non-termination of Dalvik bytecode via compilation to CLP. 14th International Workshop on Termination (WST), Jul 2014, Vienne, Austria. pp.65-69. ⟨hal-01451692⟩



Record views


Files downloads