Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"Termersetzungssystem"”.
-
The DP framework for proving termination of term rewriting
Termination is the fundamental property of a program that for each input, the evaluation will eventually stop and return some output. Although the question whether a given program terminates is undecidable, many techniques have been developed which can be used to answer the question of termination …
-
Unterstützung der Modellierung verfahrenstechnischer Prozesse durch Nicht-Standardinferenzen in Beschreibungslogiken
In chemical process engineering, as in many other application domains, one is interested in a structured representation and storage of domain specific knowledge. As shown in a cooperation between the Department for Process Engineering and the Teaching and Research Area for Theoreticel Computer …
-
SAT encodings: from constraint based termination analysis to circuit synthesis
Termination is one of the most prominent undecidable problems in computer science. At the same time, the problem whether a given program terminates for all inputs is sufficiently important for the area of program verification to spur decades-long efforts in developing sufficient criteria for …