Reflexive transitive invariant relations: A basis for computing loop functions (Q604384): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the lattice of specifications: Applications to a specification methodology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Aspects of Computing - ICTAC 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic for Deriving Loop Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Daikon system for dynamic detection of likely invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine relationships among variables of a program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of data flow frameworks: A unified model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongest invariant functions: Their use in the systematic analysis of while statements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational heuristics for the design of deterministic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The new math of computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced symbolic analysis for compilers. New techniques and algorithms for symbolic program analysis and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank

Latest revision as of 11:43, 3 July 2024

scientific article
Language Label Description Also known as
English
Reflexive transitive invariant relations: A basis for computing loop functions
scientific article

    Statements

    Reflexive transitive invariant relations: A basis for computing loop functions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2010
    0 references
    0 references
    function extraction
    0 references
    loop functions
    0 references
    invariant assertions
    0 references
    invariant relations
    0 references
    invariant functions
    0 references
    relational calculus
    0 references
    refinement calculus
    0 references
    computing loop behavior
    0 references
    0 references