SFB/TR 14 AVACS – Automatic Verification and Analysis of Complex Systems (Der Sonderforschungsbereich/Transregio 14 AVACS – Automatische Verifikation und Analyse komplexer Systeme)

The Transregional Collaborative Research Center AVACS integrates the three sites Freiburg, Oldenburg, and Saarbrücken, and addresses the challenge of pushing the borderline for automatic verification and analysis of complex systems. A particular focus of the project is on models of complex transportation systems and their safety requirements. AVACS is organized in ten subprojects, each teaming researchers from all sites, and is funded by the German Science Foundation since January 1, 2004. This article surveys scope, organization, and research directions of AVACS, including pointers to key publications. Der SFB-TR AVACS mit den Standorten Oldenburg (Sprecherhochschule), Freiburg und Saarbrücken wird seit dem 1.1.2004 von der Deutschen Forschungsgemeinschaft gefördert. AVACS stellt sich der Herausforderung, Modelle komplexer verkehrstechnischer Systeme in Bezug auf die Einhaltung von Sicherheitseigenschaften zu analysieren, um so frühzeitig mögliche Entwurfsfehler aufzudecken. In insgesamt 10 Teilprojekten werden hierzu neue Verifikationsverfahren entwickelt, welche sowohl quantitativ wie auch qualitativ die Grenzen heutiger Technologien erweitern. Dieser Artikel gibt einen Überblick über Anwendungsdomäne, Organisation und Forschungsfelder von AVACS, einschließlich Verweisen auf weiterführende Literatur.

[1]  Jochen Hoenicke,et al.  Model checking Duration Calculus: a practical approach , 2006, Formal Aspects of Computing.

[2]  Jochen Eisinger,et al.  Don’t care words with an application to the automata-based approach for real addition , 2006, Formal Methods Syst. Des..

[3]  Bernd Finkbeiner,et al.  Directed model checking with distance-preserving abstractions , 2006, International Journal on Software Tools for Technology Transfer.

[4]  Martin Fränzle,et al.  HySAT: An efficient proof engine for bounded model checking of hybrid systems , 2007, Formal Methods Syst. Des..

[5]  Andreas Podelski,et al.  Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL , 2007, MoChArt.

[6]  Bernd Becker,et al.  Sigref- A Symbolic Bisimulation Tool Box , 2006, ATVA.

[7]  Hardi Hungar,et al.  Automatic Verification of Hybrid Systems with Large Discrete State Space , 2006, ATVA.

[8]  Stephan Thesing,et al.  Modeling a system controller for timing analysis , 2006, EMSOFT '06.

[9]  Bernd Finkbeiner,et al.  Automatic Synthesis of Assumptions for Compositional Model Checking , 2006, FORTE.

[10]  Bernd Becker,et al.  Compositional Performability Evaluation for STATEMATE , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[11]  Sebastian Winkel,et al.  Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and Optimality , 2006, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06).

[12]  Zhikun She,et al.  Providing a Basin of Attraction to a Target Region by Computation of Lyapunov-like Functions , 2006, 2006 IEEE International Conference on Computational Cybernetics.

[13]  Ina Schaefer,et al.  Specification and Verification of Dynamic Communication Systems , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[14]  Hardi Hungar,et al.  Verification of cooperating traffic agents , 2006 .

[15]  S. Kupferschmid,et al.  Adapting an AI Planning Heuristic for Directed Model Checking , 2006, SPIN.

[16]  Andreas Podelski,et al.  Model Checking of Hybrid Systems: From Reachability Towards Stability , 2006, HSCC.

[17]  Bernd Becker,et al.  A Definition and Classification of Timing Anomalies , 2006, WCET.

[18]  Antti Valmari.  Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30 - April 1, 2006, Proceedings , 2006, SPIN.

[19]  S. Ratschan,et al.  Interval Constraint Solving Using Propositional SAT Solving Techniques , 2006 .

[20]  Martin Fränzle,et al.  A Robust Interpretation of Duration Calculus , 2005, ICTAC.

[21]  Andreas Podelski,et al.  Boolean Heaps , 2005, SAS.

[22]  Viorica Sofronie-Stokkermans,et al.  Hierarchic Reasoning in Local Theory Extensions , 2005, CADE.

[23]  Jochen Hoenicke,et al.  Model-Checking of Specifications Integrating Processes, Data and Time , 2005, FM.

[24]  Bernd Finkbeiner,et al.  Uniform distributed synthesis , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[25]  Stefan Ratschan,et al.  Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement , 2005, HSCC.

[26]  Bernd Becker,et al.  Optimizing Bounded Model Checking for Linear Hybrid Systems , 2005, VMCAI.

[27]  Reinhard Wilhelm,et al.  A semantics for procedure local heaps and its abstractions , 2005, POPL '05.

[28]  S. Ratschan,et al.  Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Hybrid Systems ? , 2005 .

[29]  Christel Baier,et al.  Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes , 2005, TACAS.

[30]  Christoph Scholl,et al.  Approximate Symbolic Model Checking for Incomplete Designs , 2004, FMCAD.

[31]  H. W. Conn.  AMERICAN SOCIETY OF BACTERIOLOGISTS. , 1901, Science.