- tr-announce - lists.rwth-aachen.de

2004-07: WST 04 -- 7th International Workshop on Termination
by Volker Stolz 15 Jun '04

15 Jun '04

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Michael Codish, Aart Middeldorp (eds.) WST 04 -- 7th International Workshop on Termination 2004-07 This report contains the proceedings of the 7th International Workshop on Termination (WST 2004), which was held on June 1-2, 2004 as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2004) in Aachen, Germany.

1 0

2004-06: WRS 04 -- 4th International Workshop on Reduction Strategies in Rewriting and Programming
by Volker Stolz 15 Jun '04

15 Jun '04

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Sergio Antoy, Yoshihito Toyama (eds.) WRS 04 -- 4th International Workshop on Reduction Strategies in Rewriting and Programming 2004-06 This report contains the proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2004), which was held on June 2, 2004 as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2004) in Aachen, Germany.

1 0

2004-05: WFLP 04 -- 13th International Workshop on Functional and (Constraint) Logic Programming
by Volker Stolz 15 Jun '04

15 Jun '04

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Herbert Kuchen (ed.) WFLP 04 -- 13th International Workshop on Functional and (Constraint) Logic Programming 2004-05 This report contains the proceedings of the 13th International Workshop on Functional and (Constraint) Logic Programming (WFLP 2004), which was held on June 1, 2004 as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2004) in Aachen, Germany.

1 0

2004-04: RULE 04 -- Fifth International Workshop on Rule-Based Programming
by Volker Stolz 15 Jun '04

15 Jun '04

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Slim Abdennadher, Christophe Ringeissen (eds.) RULE 04 -- Fifth International Workshop on Rule-Based Programming 2004-04 This report contains the proceedings of the 5th International Workshop on Rule-Based Programming (RULE 2004), which was held on June 1, 2004 as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2004) in Aachen, Germany.

1 0

2004-03: HOR 2004 -- 2nd International Workshop on Higher-Order Rewriting
by Volker Stolz 15 Jun '04

15 Jun '04

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Delia Kesner, Femke van Raamsdonk, Joe Wells (eds.) HOR 2004 -- 2nd International Workshop on Higher-Order Rewriting 2004-03 This report contains the proceedings of the 2nd International Workshop on Higher-Order Rewriting (HOR 2004), which was held on June 2, 2004 as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP 2004) in Aachen, Germany.

1 0

2004-02: Message-Passing Automata are expressively equivalent to EMSO logic
by Volker Stolz 24 Feb '04

24 Feb '04

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Benedikt Bollig, Martin Leucker Message-Passing Automata are expressively equivalent to EMSO logic 2004-02 We study the expressiveness of finite message-passing automata with a priori unbounded channels and show them to capture exactly the class of MSC languages that are definable in existential monadic second-order logic interpreted over MSCs. Moreover, we prove the monadic quantifier-alternation hierarchy over MSCs to be infinite and conclude that the class of MSC languages accepted by message-passing automata is not closed under complement. Furthermore, we show that satisfiability for (existential) monadic seconder-order logic over MSCs is undecidable.

1 0

2003-08: Mechanizing Dependency Pairs
by Volker Stolz 05 Jan '04

05 Jan '04

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke Mechanizing Dependency Pairs 2003-08 Abstract: The dependency pair approach is a powerful technique for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequality constraints that have to be satisfied by well-founded orders. We improve the dependency pair approach by considerably reducing the number of constraints produced for (innermost) termination proofs. Moreover, we extend transformation techniques to manipulate dependency pairs which simplify (innermost) termination proofs significantly. In order to fully mechanize the approach, we show how transformations and the search for suitable orders can be mechanized efficiently. We implemented our results in the automated termination prover AProVE and evaluated them on large collections of examples.

1 0

2003-07: Vergleich von Ansaetzen zur Feature Modellierung bei der Softwareproduktlinienentwicklung
by Volker Stolz 23 Jul '03

23 Jul '03

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Horst Lichter, Thomas von der Maßen, Alexander Nyßen, Thomas Weiler Vergleich von Ansätzen zur Feature Modellierung bei der Softwareproduktlinienentwicklung 2003-07 Abstract: Die Feature Modellierung ist ein oft verwendeter Ansatz, um Variabilitäten und Gemeinsamkeiten der Produkte einer Produktlinie zu modellieren. Die einzelnen Ansätze, die die Feature-Modellierung nutzen, unterscheiden sich jedoch häufig in der Zielsetzung und Vorgehensweise bei der Modellierung. In diesem Artikel wird versucht, die verschiedenen Ansätze zur Feature-Modellierung einander gegenüberzustellen und ihre Gemeinsamkeiten und Unterschiede zu vergleichen und zu bewerten. Hierbei wird insbesondere betrachtet, welche Vorgehensweise gewählt werden muss und welche Eingaben vorliegen müssen, damit die Ergebnisse der Feature-Modellierung in den nachgelagerten Entwicklungsschritten als Eingabe weiterverwendet werden können. Regards, Volker

1 0

2003-06: Statistical Machine Translation: From Single-Word Models to Alignment Templates
by Volker Stolz 23 May '03

23 May '03

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Franz Josef Och Statistical Machine Translation: From Single-Word Models to Alignment Templates 2003-06 In this work, new approaches for machine translation using statistical methods are described. In addition to the standard source-channel approach to statistical machine translation, a more general approach based on the maximum entropy principle is presented. Various methods for computing single-word alignments using statistical or heuristic models are described. Various smoothing techniques, methods to integrate a conventional dictionary and training methods are analyzed. A detailed evaluation of these models is performed by comparing the automatically produced word alignment with a manually produced reference alignment. Based on these fundamental single-word based alignment models, a new phrase-based translation model - the alignment template model - is suggested. For this model, a training and an efficient search algorithm is developed. For two specific applications (interactive translation and multi-source translation) specific search algorithms are developed. The suggested machine translation approach has been tested for the German-English Verbmobil task, the French-English Hansards task and for Chinese-English news text translation. Often, the obtained results have been significantly better than those obtained with alternative approaches to machine translation. Regards, Volker

1 0

2003-04: Improving Dependency Pairs
by Volker Stolz 20 May '03

20 May '03

The following technical report is available from http://aib.informatik.rwth-aachen.de/: Jürgen Giesl, René Thiemann, Peter Schneider-Kamp and Stephan Falke Improving Dependency Pairs 2003-04 Abstract: The dependency pair approach is one of the most powerful techniques for termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequality constraints that have to be satisfied by weakly monotonic well-founded orders. We improve the dependency pair approach by considerably reducing the number of constraints produced for (innermost) termination proofs. Moreover, we extend transformation techniques to manipulate dependency pairs which simplify (innermost) termination proofs significantly. In order to fully automate the dependency pair approach, we show how transformation techniques and the search for suitable orders can be mechanized efficiently. We implemented our results in the automated termination prover AProVE and evaluated them on large collections of examples. Regards, Volker

1 0