Termination Graphs for Java Bytecode (Q3058449): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automatic Termination Proofs for Programs with Shape-Shifting Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Termination Analysis of Java Bytecode by Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of logic programs: the never-ending story / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination of Integer Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated termination proofs for logic programs by term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proving the termination of algorithms by machine / rank
 
Normal rank

Latest revision as of 11:48, 3 July 2024

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

    Statements

    Identifiers