9/27/2023 0 Comments Free download software pclp![]() ![]() In this paper, we describe and experiment with a technique for proving non-termination of imperative, bytecode programs by relating their non-termination to that of a (constraint) logic program. While research has found ways of proving non-termination of logic programs and of term rewriting systems, this is hardly the case for imperative programs. This is important since non-termination is often an unexpected behaviour of computer programs and exposes a bug in their code. Non-termination analysis proves that programs, or parts of a program, do not terminate. ![]() Electronic Notes in Theoretical Computer Science 253 (2009) 83-96Įxperiments with Non-Termination Analysisĭipartimento di Informática Università di Verona Italy
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |