DeepAI AI Chat
Log In Sign Up

A Semantic Approach to the Analysis of Rewriting-Based Systems

by   Salvador Lucas, et al.

Properties expressed as the provability of a first-order sentence can be disproved by just finding a model of the negation of the sentence. This fact, however, is meaningful in restricted cases only, depending on the shape of the sentence and the class of systems at stake. In this paper we show that a number of interesting properties of rewriting-based systems can be investigated in this way, including infeasibility and non-joinability of critical pairs in (conditional) rewriting, non-loopingness of conditional rewrite systems, or the secure access to protected pages of a web site modeled as an order-sorted rewrite theory. Interestingly, this uniform, semantic approach succeeds when specific techniques developed to deal with the aforementioned problems fail.


page 1

page 2

page 3

page 4


Conditional Independence in Uncertainty Theories

This paper introduces the notions of independence and conditional indepe...

Quality Assurance for AI-based Systems: Overview and Challenges

The number and importance of AI-based systems in all domains is growing....

Evaluating Sentence Segmentation and Word Tokenization Systems on Estonian Web Texts

Texts obtained from web are noisy and do not necessarily follow the orth...

A Model-driven Approach for Continuous Performance Engineering in Microservice-based Systems

Microservices are quite widely impacting on the software industry in rec...

Proving Program Properties as First-Order Satisfiability

Program semantics can often be expressed as a (many-sorted) first-order ...

Model Theory of Monadic Predicate Logic with the Infinity Quantifier

This paper establishes model-theoretic properties of FOE^∞, a variation ...

High-Quality Face Capture Using Anatomical Muscles

Muscle-based systems have the potential to provide both anatomical accur...