Proving termination of nonlinear command sequences (Q470005): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68N30 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6368385 / rank
 
Normal rank
Property / zbMATH Keywords
 
program termination
Property / zbMATH Keywords: program termination / rank
 
Normal rank
Property / zbMATH Keywords
 
nonlinear assignments
Property / zbMATH Keywords: nonlinear assignments / rank
 
Normal rank
Property / zbMATH Keywords
 
divergence testing
Property / zbMATH Keywords: divergence testing / rank
 
Normal rank
Property / zbMATH Keywords
 
well-foundedness provers
Property / zbMATH Keywords: well-foundedness provers / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Maple / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AProVE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CiME / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00165-012-0252-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997553387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programs with Lists Are Counter Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variance analyses from invariance analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semantic basis for the termination analysis of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-change principle for program termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Strengthening for Shape Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:22, 9 July 2024

scientific article
Language Label Description Also known as
English
Proving termination of nonlinear command sequences
scientific article

    Statements

    Proving termination of nonlinear command sequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2014
    0 references
    0 references
    program termination
    0 references
    nonlinear assignments
    0 references
    divergence testing
    0 references
    well-foundedness provers
    0 references
    0 references
    0 references
    0 references
    0 references