Fast computation of strong control dependencies (Q832318): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Slicing for modern program structures: a theory for eliminating irrelevant loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric and Termination-Sensitive Control Dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying theory of control dependence and its application to arbitrary program structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of programs for secure information flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: The program dependence graph and its use in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Reducible Flow Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slicing communicating automata specifications: Polynomial algorithms for model reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut branches before looking for bugs: certifiably sound verification on relaxed slices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program Slicing / rank
 
Normal rank

Latest revision as of 10:49, 28 July 2024

scientific article
Language Label Description Also known as
English
Fast computation of strong control dependencies
scientific article

    Statements

    Identifiers