Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(12 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: ELAN / 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: 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: VMTL / 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: OBJ3 / 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.jlamp.2016.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2333572417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-sensitive dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination Properties with mu-term / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dependency Pair Framework for A ∨ C-Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional rewrite rules: Confluence and termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: IThe 2nd international workshop on rewriting logic and its applications, RWLW.. Abbaye des Prèmontrès at Pont-á-Mousson, France, September 1998 / 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: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rationale for conditional equational programming / 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: Q2715825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing and improving dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tyrolean termination tool: techniques and features / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional rewrite rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259966 / 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: 2D Dependency Pairs for Proving Operational Termination of CTRSs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms and normal theories in conditional rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unravelings and ultra-properties / 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: Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing and proving operational termination of deterministic conditional term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Equivalent Elimination of Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Extensions Preserve Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:19, 13 July 2024

scientific article
Language Label Description Also known as
English
Dependency pairs for proving termination properties of conditional term rewriting systems
scientific article

    Statements

    Dependency pairs for proving termination properties of conditional term rewriting systems (English)
    0 references
    0 references
    0 references
    30 November 2016
    0 references
    conditional term rewriting
    0 references
    dependency pairs
    0 references
    program analysis
    0 references
    operational termination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers