A broader view on verification: From static to runtime and back (track summary)
Paper in proceedings, 2018

© Springer Nature Switzerland AG 2018. When seeking to verify a computational system one can either view the system as a static description of possible behaviours or a dynamic collection of observed or actual behaviours. Historically, there have been clear differences between the two approaches in terms of their level of completeness, the associated costs, the kinds of specifications considered, how and when they are applied, and so on. Recently there has been a concentrated interest in the combination of static and runtime (dynamic) techniques and this track (taking place as part of ISoLA 2018) aims to explore this combination further.

Author

Wolfgang Ahrendt

Chalmers, Computer Science and Engineering (Chalmers), Formal methods

Marieke Huisman

University of Twente

G. Reger

University of Manchester

Kristin Yvonne Rozier

Iowa State University

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 11245 LNCS 3-7

8th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2018
Limassol, Cyprus,

Subject Categories

Embedded Systems

Robotics

DOI

10.1007/978-3-030-03421-4_1

More information

Latest update

12/19/2018