MU-TERM 2018 Termination Competition Ral Gutirrez 1 and Salvador - - PowerPoint PPT Presentation

mu term
SMART_READER_LITE
LIVE PREVIEW

MU-TERM 2018 Termination Competition Ral Gutirrez 1 and Salvador - - PowerPoint PPT Presentation

MU-TERM 2018 Termination Competition Ral Gutirrez 1 and Salvador Lucas 1 WST, July 2018, Oxford (UK) 1 DSIC, Universitat Politcnica de Valncia 1 Overview MU - TERM 5.18 is a tool which can be used to verify a number of termination


slide-1
SLIDE 1

MU-TERM

2018 Termination Competition

Raúl Gutiérrez1 and Salvador Lucas1 WST, July 2018, Oxford (UK)

1DSIC, Universitat Politècnica de València

1

slide-2
SLIDE 2

Overview

MU-TERM 5.18 is a tool which can be used to verify a number of

termination properties of variants of Term Rewriting Systems (TRSs) using different variants of the Dependency Pair (DP) Framework.

2

slide-3
SLIDE 3

Tool Diagram (1/2)

input.trs input.maude Parser A∨C-DP Problem CS-DP Problem DP Problem OS-DP Problem 2D-DP Problem

3

slide-4
SLIDE 4

Tool Diagram (2/2)

*-DP Problem Strategy NO YES MAYBE

4

slide-5
SLIDE 5

Backends

  • NLSOL: NonLinear aritmetic SOLver
  • Used to generate (matrix) polynomial interpretations over

Q.

  • Barcelogics: SMT Solver
  • Used to generate (matrix) polynomial interpretations over N

and Z.

  • AGES: Semantic-based automatic genarator of logical

models.

  • Used to generate piecewise (matrix) polynomial

interpretations over convex polytopic domains over Z.

5

slide-6
SLIDE 6

Recent Publications

  • S. Lucas, J. Meseguer, and R. Gutiérrez. The 2D

Dependency Pair Framework for conditional rewrite

  • systems. Part I: definition and basic processors. Journal of

Computer and System Sciences, 96:74-106, 2018.

  • S. Lucas and R. Gutiérrez. Use of logical models for

proving infeasibility in term rewriting. Information Processing Letters 136, 90-95, 2018.

  • S. Lucas and R. Gutiérrez. Automatic Synthesis of Logical

Models for Order-Sorted First-Order Theories. Journal of Automated Reasoning, 60:465-501, 2018.

6

slide-7
SLIDE 7

Results in Termination Competition 2018

Category Position Solved TRS Standard 4th 832/1498 SRS Standard 5th 136/1541 TRS Equational 2nd 63/76 TRS Conditional 1st 101/117 TRS Context-Sensitive 1st 101/108 TRS Innermost 2nd 208/366

7

slide-8
SLIDE 8

Conclusions and Future Work

  • Most successful tool for proving termination of conditional

TRSs and context-sensitive TRSs.

  • In the TRS Conditional category we integrated the

generation of convex polytopic domains using AGES.

  • In our next version we want to fully integrate AGES in the

rest of categories.

8