Hydra Battles and AC Termination, Revisited

07/26/2023
by   Nao Hirokawa, et al.
0

We present a termination proof for the Battle of Hercules and Hydra represented as a rewrite system with AC symbols. Our proof employs type introduction in connection with many-sorted semantic labeling for AC rewriting and AC-RPO.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/07/2019

A Modular Termination Method for Second-Order Computation

We present a new modular proof method of termination for second-order co...
research
04/22/2021

Ackermann's Function in Iterative Form: A Proof Assistant Experiment

Ackermann's function can be expressed using an iterative algorithm, whic...
research
02/25/2018

Secure Serverless Computing Using Dynamic Information Flow Control

The rise of serverless computing provides an opportunity to rethink clou...
research
07/18/2019

Priorities in tock-CSP

The tock-CSP encoding embeds a rich and flexible approach to modelling d...
research
05/12/2019

Simulation Typology and Termination Risks

The goal of the article is to explore what is the most probable type of ...
research
07/26/2023

Old and New Benchmarks for Relative Termination of String Rewrite Systems

We provide a critical assessment of the current set of benchmarks for re...
research
05/05/2020

Reconciling progress-insensitive noninterference and declassification

Practitioners of secure information flow often face a design challenge: ...

Please sign up or login with your details

Forgot password? Click here to reset