Searching for authors named "Thomas Arts" – sorted by Relevance.
39 documents found, showing 1 through 10.
Next 10 →
-
Embedding First Order Predicate Logic in Second Order Propositional Logic
- …this article. I would like to thank Wil Dekkers for his supervision, Herman Geuvers for lending a ready ear to me and Erik Barendsen for his L…
- Add To MetaCart
-
Functional Programming and Logic Decrease the Use of the Most Important Part of Our System
- …Several years of experience with the functional language Erlang have learned Ericsson that it is highly beneficial to use this language for programming control software for large systems. Systems that could not be built before, have been constructed in less time and with fewer lines of code than one…
- Add To MetaCart
-
A Technique for Automatically Proving Termination of Constructor Systems
- …A technique is described to prove termination of constructor systems (CSs) automatically. The technique consists of three major steps. First, determine the dependency pairs of a constructor system. Second, find an equational theory in which the constructor system is contained, and third, prove that …
- Cited by 1 (1 self) – Add To MetaCart
-
System Description: The Dependency Pair Method
- …This paper describes a tool that implements the dependency pair approach with its most recent additions and renements, such as modularity results that can eectively be used on larger TRSs [AG98] and operations on the dependency pairs such as narrowing, rewriting and instantiation of pairs. These ren…
- Cited by 20 (3 self) – Add To MetaCart
-
Termination By Absence of Infinite Chains of Dependency Pairs
- …. A technique to prove termination of term rewrite systems, or more precise, constructor systems(CSs) is presented. Soundnessof this technique is proved and it is described how the technique can be performed automatically for a subclass of the CSs. Whereas simplification orders fail in proving te…
- Cited by 8 (7 self) – Add To MetaCart
-
Testing Implementations of Formally Verified Algorithms
- …Algorithms described in literature can often be used to solve practical, industrial problems. In safety-critical industrial settings, algorithms that have been formally verified should be even more attractive candidates for implementations. Nevertheless, we observe little transfer of algorithms from…
- Cited by 1 (1 self) – Add To MetaCart
-
New Criteria for Strong and Innermost Normalisation
- …In this paper we present a technique for automated termination proofs of term rewriting systems (TRS). More precisely, we introduce criteria for both strong and innermost normalisation and we show how these criteria can be checked automatically. In this way, termination of numerous (also nonsimply t…
- Add To MetaCart
-
Trace Analysis of Erlang Programs
- …The paper reports on an experiment to provide the Erlang programming language with a tool package for convenient trace generation, collection and to support analysis of traces using a set of techniques. Due to the frequent use of statebased software design patterns in Erlang programming we can in ma…
- Cited by 16 (5 self) – Add To MetaCart
-
Termination of Logic Programs Via Labelled Term Rewrite Systems
- …We propose automatically proving termination of logic programs by transforming them into term rewrite systems (TRS). We describe such a transformation for which termination of the logic program follows from innermost termination of the TRS, which is stronger than previous results. Semantic labelling…
- Cited by 13 (7 self) – Add To MetaCart
-
Applying Rewriting Techniques to the Verification of Erlang Processes
- … Erlang is a functional programming language developed by Ericsson Telecom which is particularly well suited for implementing concurrent processes. In this paper we show how methods from the area of term rewriting are presently used at Ericsson. To verify properties of processes, such a propert…
- Cited by 3 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
