Termination Graphs for Java Bytecode (Q3058449)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Termination Graphs for Java Bytecode	scientific article

Statements

scholarly article

0 references

Termination Graphs for Java Bytecode (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-17172-7_2

0 references

Marc Brockschmidt

0 references

0 references

Christian von Essen

0 references

0 references

Verification, Induction, Termination Analysis

0 references

publication date

22 November 2010

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-17172-7_2

0 references

0 references

Automatic Termination Proofs for Programs with Shape-Shifting Heaps

0 references

Automated Termination Analysis of Java Bytecode by Term Rewriting

0 references

0 references

Termination of logic programs: the never-ending story

0 references

Termination of rewriting

0 references

Proving Termination of Integer Term Rewriting

0 references

Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages

0 references

Isabelle/HOL. A proof assistant for higher-order logic

0 references

Automated termination proofs for logic programs by term rewriting

0 references

On proving the termination of algorithms by machine

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3058449

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3058449&oldid=35201593"