Term graph rewriting is concerned with the representation of functional expressions as
graphs, and the evaluation of these expressions by rule-based graph transformation …

This textbook offers a unified, self-contained introduction to the field of term rewriting. Baader
and Nipkow cover all the basic material--abstract reduction systems, termination …

Automated and semi-automated manipulation of so-called labelled transition systems has
become an important means in discovering flaws in software and hardware systems …

Attack–defense trees are a novel methodology for graphical security modelling and
assessment. They extend the well-known formalism of attack trees by allowing nodes that …

The use of visual cues associated with rendered visual items to cue a user on whether a
rendered visual item has interactive capability and/or what type of interaction is possible with …

The derivation of mathematical results in specialised fields using Large Language Models
(LLMs) is an emerging research direction that can help identify models' limitations, and …

Program analysis and verification require decision procedures to reason on theories of data
structures. Many problems can be reduced to the satisfiability of sets of ground literals in …

1101 model parameters using analytics. In one embodiment, the dependency graph is part
of vi sually driven analytics in Which the output model parameter (s) are used to formulate …

Abstract Reasoning semantically in first-order logic is notoriously a challenge. This paper
surveys a selection of semantically-guided or model-based methods that aim at meeting …

Context-sensitive rewriting is a simple rewriting restriction which is formalized by imposing
fixed restrictions on replacements. Such a restriction is given on a purely syntactic basis: it is …