Certified Non-Confluence with ConCon 1.5

09/15/2017
by   Thomas Sternagel, et al.
0

We present three methods to check CTRSs for non-confluence: (1) an ad hoc method for 4-CTRSs, (2) a specialized method for unconditional critical pairs, and finally, (3) a method that employs conditional narrowing to find non-confluence witnesses. We shortly describe our implementation of these methods in ConCon, then look into their certification with CeTA, and finally conclude with experiments on the confluence problems database (Cops).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2020

A Mechanised Semantics for HOL with Ad-hoc Overloading

Isabelle/HOL augments classical higher-order logic with ad-hoc overloadi...
research
03/31/2022

CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks

Efficient message forwarding in mobile ad hoc network in disaster scenar...
research
12/08/2021

A Preamble Based MAC Mechanism in Ad-Hoc Network

In this paper, we propose a preamble based medium access control (P-MAC)...
research
12/05/2017

An Extensible Ad Hoc Interface between Lean and Mathematica

We implement a user-extensible ad hoc connection between the Lean proof ...
research
07/28/2020

A Centralized Channel Allocation Method in Clustered Ad Hoc Networks

Cognitive radio networks (CRNs) is the next generation of wireless commu...
research
11/09/2018

Adversarial Sampling and Training for Semi-Supervised Information Retrieval

Modern ad-hoc retrieval models learned with implicit feedback have two p...
research
09/28/2021

PSI: Constructing ad-hoc Simplices to Interpolate High-Dimensional Unstructured Data

Interpolating unstructured data using barycentric coordinates becomes in...

Please sign up or login with your details

Forgot password? Click here to reset