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.
Type de document :
Communication dans un congrès
Fuhs, Carsten. 14th International Workshop on Termination (WST), Jul 2014, Vienne, Austria. Proceedings of the 14th International Workshop on Termination (WST), pp.65-69, 2014
Liste complète des métadonnées

Littérature citée [2 références]  Voir  Masquer  Télécharger

http://hal.univ-reunion.fr/hal-01451692
Contributeur : Réunion Univ <>
Soumis le : vendredi 9 novembre 2018 - 08:50:36
Dernière modification le : mercredi 14 novembre 2018 - 01:18:29

Identifiants

  • HAL Id : hal-01451692, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

3

Téléchargements de fichiers

4