Verification of tree-processing programs via higher-order mode checking

We propose a new method to verify that a higher-order, tree-processing functional program conforms to an input/output specification. Our method reduces the verification problem to multiple verification problems for higher-order multi-tree transducers, which are then transformed into higher-order rec...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical structures in computer science 2015-05, Vol.25 (4), p.841-866
Hauptverfasser:	UNNO, HIROSHI, TABUCHI, NAOSHI, KOBAYASHI, NAOKI
Format:	Artikel
Sprache:	eng
Schlagworte:	Data structures Input output analysis Invariants Mathematical analysis Mathematical functions Mathematical models Programmers Prototypes Recursion Specifications Transducers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!