2 citations · 6 across the 12 of their papers we have counts for
Showing 2014 · cs.PLShow all
2 papers · 2 filters
cs.PL2014
Non-termination of Dalvik bytecode via compilation to CLP
Etienne Payet, Fred Mesnard
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…
cs.PL2014★ 2 cited
Non-Termination Analysis of Java Bytecode
Étienne Payet, Fred Mesnard, Fausto Spoto
We introduce a fully automated static analysis that takes a sequential Java bytecode program P as input and attempts to prove that there exists an infinite execution of P. The tech…