The workshop will take place as a full-day event. Each paper has been assigned a 30min slot, with 20 mins per presentation and 5-10 mins for questions. Authors, please prepare a brief talk to fit these constraints. The workshop program … Continue reading
Author Notifications have been sent out! Stay tuned for the workshop program. Now is also time to register for participation!
We are excited and proud to announce that Prof. Dr. Hausi Müller will host a keynote at this year’s edition of RESACS! Dr. Müller is a Computer Science Professor Associate Dean of Research in the Faculty of Engineering at University … Continue reading
Your manuscripts have been assigned to the programme committee and reviews have begun. As we’re writing this, the first reviews are trickling in. Stay tuned for updates!
We received many wonderful manuscripts and will commence the reviewing period. Stay tuned for updates!
One week left to submit your paper on Self-Adaptive, Collaborative, or Cyber Physical Systems to @RESACS_WS. Check out the call for papers, important dates, and submission procedure!
See our workshop website for details: https://resacs2018.wordpress.com/
In its first year abroad, several high-impact papers were accepted and presented in Gothenburg, Sweden. Among them was: F. Kneer and E. Kamsties: A Framework for Prototyping and Evaluating Self-adaptive Systems – A Research Preview. Find the paper here: http://ceur-ws.org/Vol-1564/paper13.pdf … Continue reading
In its inaugural year, seven papers were accepted to @RESACS_WS. The first one is: K. Albers and M. Dörfel: Using Timing paths to validate end-to-end requirements with methods of schedulability simulation and analysis. Find the paper here: http://ceur-ws.org/Vol-1342/07-resacs.pdf And find … Continue reading
In its inaugural year, seven papers were accepted to @RESACS_WS. The first one is: A. Goldsteen, M. Moffie, T. Bandyszak, et. al: A Tool for Monitoring and Maintaining System Trustworthiness at Runtime. Find the paper here: http://ceur-ws.org/Vol-1342/01-resacs.pdf And find the … Continue reading