A Brief Account of Runtime Verification

TL;DR: This framework provides the infrastructures which is needed to instrument the code with runtime monitors, and sketches a contract language to extend the one currently provided by Ada, with the long term goal of having an elegant way in which runtime monitors can be automatically synthesized and instrumented into the target systems.

TL;DR: This work presents a runtime monitoring platform that clearly separates the extraction of events in the running program from the specification and monitoring process, and allows one to cleanly monitor first-order properties involving arbitrarily complex native program objects, while still incurring reasonable overhead.

TL;DR: This work extends the passive automata learning by considering the behavior of the depending components in addition to the observed behaviors to automatically derive Behavioral model learning and classification, and shows the effectiveness of this approach for traffic classification in the network domain.

TL;DR: An overview of GREP is presented and its usability is validated with a performance evaluation and it is shown that GREP can enforce any regular timed property described by a deterministic and complete Timed Automaton.

TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.

TL;DR: In this article, the logical foundations of computer programming are explored by using techniques first applied in the study of geometry and later extended to other branches of mathematics, and a formal proof of a simple theorem is displayed.

TL;DR: The continuity of the basic conceptual model between Abstract and Executable Processes in WSBPEL makes it possible to export and import the public aspects embodied in Abstract Processes as process or role templates while maintaining the intent and structure of the observable behavior.

TL;DR: A practical introduction to the development of proofs and certified programs using Coq can be found in this paper, which is an invaluable tool for researchers, students, and engineers interested in formal methods and the developing of zero-fault software.