Titlebook: Logic-Based Program Synthesis and Transformation; 30th International S Maribel Fernández Conference proceedings 2021 Springer Nature Switze

Inveterate

旧病复发

Terminating Non-disjoint Combined Unificationes are exemplified with various theories used in protocol analysis. Next, we look at modularity methods for combining theories already using a hierarchical approach. In addition, we consider a new complexity measure that allows us to obtain terminating (combined) hierarchical unification procedures.

DEMUR

Translation of Interactive Datalog Programs for Microcontrollers to Finite State Machinesecked. By representing a possibly quite large number of facts as a single state number and a few parameter values, memory and computing time are saved. If no parameters are needed, the result of this compilation is basically a finite state machine.

友好关系