Termination Analysis of Java Bytecode

Termination Analysis of Java Bytecode

Cached

Download Links

Other Repositories/Bibliography

DBLP

by E. Albert , P. Arenas , M. Codish , S. Genaim , G. Puebla , D. Zanardini

Citations:

29 - 14 self

BibTeX

@MISC{Albert_terminationanalysis,
    author = {E. Albert and P. Arenas and M. Codish and S. Genaim and G. Puebla and D. Zanardini},
    title = {Termination Analysis of Java Bytecode },
    year = {}
}

Bookmark

OpenURL

Abstract

The state of the art in termination analysis includes advanced techniques developed for logic and functional programming [12, 4, 9, 11, 10] and imperative languages [2, 5, 8, 6, 10], as well as for term rewriting systems [10]. In [6, 5] tools for proving termination of large industrial code are presented. However, termination of low-level languages, such as Java bytecode, has received little

Citations

1023	The Java Virtual Machine Specification - Lindholm, Yellin - 1996
1016	Proof-carrying code - Necula - 1997
704	Constraint Logic Programming: A Survey - Jaffar, Maher - 1994
470	Automatic discovery of linear restraints among the variables of a program - COUSOT, HALBWACHS - 1978
156	The size-change principle for program termination - Lee, Jones, et al. - 2001
152	Soot - a Java optimization framework - Vallée-Rai, Hendren, et al. - 1999
100	Termination proofs for systems code, in - Cook, Podelski, et al.
89	A complete method for the synthesis of linear ranking functions - Podelski, Rybalchenko - 2004
87	A semantics basis for termination analysis of logic programs - Codish, Taboch - 1999
78	Control flow analysis - Allen - 1970
74	Boogiepl: a typed procedural language for checking object-oriented programs - DeLine, Leino - 2005
70	Transition invariants - Podelski, Rybalchenko
70	AProVE 1.2: Automatic termination proofs in the dependency pair framework - Giesl, Schneider-Kamp, et al. - 2006
58	Automatic termination analysis of logic programs - Lindenstrauss, Sagiv - 1997
55	Cost Analysis of Java Bytecode - Albert, Arenas, et al. - 2007
55	Possibly not closed convex polyhedra and the parma polyhedra library - Bagnara, Ricci, et al. - 2002
51	Proving program invariance and termination by parametric abstraction, lagrangian relaxation - Cousot - 1007
49	Practical methods for proving program termination - Colón, Sipma - 2002
44	Termination of polynomial programs - Bradley, Manna, et al. - 2005
43	Automatic termination proofs for programs with shape-shifting heaps - Berdine, Cook, et al. - 2006
42	Inferring Argument Size Relationships with CLP(R - Benoy, King - 1997
38	A general framework for automatic termination analysis of logic programs - Dershowitz, Lindenstrauss, et al.
24	Inference of inequality constraints in logic programs - Brodsky, Sagiv - 1991
16	Termination analysis of logic programs through combination of type-based norms - BRUYNOOGHE, CODISH, et al. - 2007
11	E.: Path-length analysis of object-oriented programs - Spoto, Hill, et al.
10	AProVE 1.2: Automatic Termination - Giesl, Schneider-Kamp, et al.
10	F.: Detecting Non-Cyclicity by Abstract Compilation into Boolean Functions - Rossignoli, Spoto - 2005
10	Class analyses as abstract interpretations of trace semantics - Spoto, Jensen
9	Cyclic proofs of program termination in separation logic - Brotherston, Bornat, et al. - 2008
9	Pair-Sharing Analysis of Object-Oriented Programs - Secci, Spoto - 2005
7	Terminweb: Semantic based termination analyser for logic programs - Taboch, Genaim, et al. - 2002
6	Path-length analysis of object-oriented programs - Hill, Payet, et al. - 2006
1	Proof-Carrying Code. In: POPL - Necula - 1997