tr-announce February 2015

tr-announce@lists.rwth-aachen.de

1 participants
2 discussions

2015-06: Proceedings of the Young Researchers' Conference "Frontiers of Formal Methods"

by Thomas Ströder

The following technical report is available from http://aib.informatik.rwth-aachen.de: Proceedings of the Young Researchers' Conference "Frontiers of Formal Methods" Thomas Ströder and Wolfgang Thomas (Editors) AIB 2015-06 The Young Researchers' Conference "Frontiers of Formal Methods" (FFM 2015) is a "singularity" - an event that is not part of a longer conference series, but organized following a nice coincidence of interests of several research groups in Germany and Austria. It all started with a loose promise given in 2010: When the second phase of the DFG research training group (Graduiertenkolleg) "AlgoSyn" started in Aachen, we promised to organize a final conference at the end of altogether nine successful years of work by and with doctoral students. In discussions between the speakers of closely related research training groups, it became then clear that all our doctoral students would gain most by a jointly organized conference. Five partners joined their forces: the DFG research training groups AlgoSyn (Algorithmic Synthesis of Reactive and Discrete-Continuous Systems), Aachen, PUMA (Program and Model Analysis), Munich, QuantLA (Quantitative Logics and Automata), Dresden & Leipzig, SCARE (System Correctness under Adverse Conditons), Oldenburg, and the Austrian Research Network ARiSE (Rigorous System Engineering).

9 years, 6 months

2015-05: Inferring Lower Bounds for Runtime Complexity

by Thomas Ströder

The following technical report is available from http://aib.informatik.rwth-aachen.de: Inferring Lower Bounds for Runtime Complexity Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, and Thomas Ströder AIB 2015-05 We present the first approach to deduce lower bounds for innermost runtime complexity of term rewrite systems (TRSs) automatically. Inferring lower runtime bounds is useful to detect bugs and to complement existing techniques that compute upper complexity bounds. The key idea of our approach is to generate suitable families of rewrite sequences of a TRS and to find a relation between the length of such a rewrite sequence and the size of the first term in the sequence. We implemented our approach in the tool AProVE and evaluated it by extensive experiments.

9 years, 7 months

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

tr-announce February 2015