Methods for Proving Termination of Rewriting-based Programming Languages by Transformation (Q2808239): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(13 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CafeOBJ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Haskell / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CASL / 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: Maude / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tyrolean / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MTT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MU-TERM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OBJ3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TPA / 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.1016/j.entcs.2009.07.062 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011361820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ELAN from a rewriting logic point of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification and proof in membership equational logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic foundations for generalized rewrite theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: MTT: The Maude Termination Tool (System Description) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving operational termination of membership equational programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715825 / 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: Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tyrolean termination tool: techniques and features / rank
 
Normal rank
Property / cites work
 
Property / cites work: TPA: Termination Proved Automatically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-sensitive rewriting strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational termination of conditional term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational Termination of Membership Equational Programs: the Order-Sorted Way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3032225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-sorted termination: The unsorted way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Termination Analysis for Logic Programs by Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:31, 12 July 2024

scientific article
Language Label Description Also known as
English
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
scientific article

    Statements

    Methods for Proving Termination of Rewriting-based Programming Languages by Transformation (English)
    0 references
    0 references
    0 references
    0 references
    20 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    program analysis and verification
    0 references
    rewriting logic
    0 references
    term rewriting
    0 references
    termination
    0 references
    tools
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references