Rule-Based Runtime Verification
By Howard Barringer, Allen Goldberg, Klaus Havelund, Koushik Sen. International Conference on Verification, Model Checking and Abstract Interpretation, 2004
428 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Hardware and Architecture
View Paper: https://www.semanticscholar.org/paper/cf9cbeca3a3940e476e2bd9bece792afb2f348e7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Martin Leucker
- Christian Schallhart
- César Sánchez
- Grigore Roşu
- Zohar Manna
- Henny B. Sipma
- Bernd Finkbeiner
- Sriram Sankaranarayanan
In Computational Theory and Mathematics
- Martin Leucker
- Christian Schallhart
- Ben D'Angelo
- César Sánchez
- Grigore Roşu
- Zohar Manna
- Henny B. Sipma
- Bernd Finkbeiner
In Hardware and Architecture
- Ben D'Angelo
- César Sánchez
- Grigore Roşu
- Zohar Manna
- Henny B. Sipma
- Bernd Finkbeiner
- Sriram Sankaranarayanan
- Will Robinson
Citations in the corpus
- A brief account of runtime verification (2009, background): “The Eagle temporal logic [6] is a basic, yet, very general specification language suitable for monitoring correctness properties.”
- LOLA: runtime monitoring of synchronous systems (2005, background): “Eagle [ 17 ]. Eagle allows the description of monitors based on greatest and least fixed points of recursive definitions.”
- Mop: an efficient and generic runtime verification framework (2007, methodology): “We intend to soon add a logic-plugin for Eagle [12], a “super-logic” generalizing both ERE and LTL, and also allowing arbitrary quantification and negation, but do not expect it to have a stimulating runtime overhead.”