Skip to main content
SpringerLink
Log in

Suggesting Edits to Explain Failing Traces

  • Conference paper
  • First Online:
Runtime Verification

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9333))

Abstract

Runtime verification involves checking whether an execution trace produced by a running system satisfies a specification. However, a simple ‘yes’ or ‘no’ answer may not be sufficient; often we need to understand why a violation occurs. This paper considers how computing the edit-distance between a trace and a specification can explain violations by suggesting correcting edits to the trace. By including information about the code location producing events in the trace, this method can highlight sources of bugs and suggest potential fixes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    For conciseness we will use regular expressions to represent the corresponding automaton.

References

  1. Allauzen, C., Mohri, M.: 3-way composition of weighted finite-state transducers. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 262–273. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Allauzen, C., Mohri, M.: Linear-space computation of the edit-distance between a string and a finite automaton (2009). CoRR, abs/0904.4686

    Google Scholar 

  3. Babenko, A., Mariani, L., Pastore, F.: Ava: automated interpretation of dynamically detected anomalies. In: Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009, pp. 237–248. ACM (2009)

    Google Scholar 

  4. Falcone, Y., Havelund, K., Reger, G.: A tutorial on runtime verification. In: Summer School Marktoberdorf 2012 - Engineering Dependable Software Systems, to appear. IOS Press (2013)

    Google Scholar 

  5. Meredith, P., Jin, D., Griffith, D., Chen, F., Roşu, G.: An overview of the mop runtime verification framework. J. Softw. Tools Technol. Transf. 14(3), 249–289 (2011). http://link.springer.com/article/10.1007%2Fs10009-011-0198-6

    Article  Google Scholar 

  6. Reger, G., Barringer, H., Rydeheard, D.: Automata-based pattern mining from imperfect traces. In: The 2nd International Conference on Software Mining (2013)

    Google Scholar 

  7. Reger, G., Cruz, H.C., Rydeheard, D.: MarQ: monitoring at runtime with QEA. In: Baier, C., Tinelli, C. (eds.) ETAPS 2015. LNCS, vol. 9035, pp. 596–610. Springer, Heidelberg (2015)

    Google Scholar 

  8. Renieris, M., Reiss, S.P.: Fault localization with nearest neighbor queries. In: 18th IEEE International Conference on Automated Software Engineering (ASE 2003), pp. 30–9, 6–10 October 2003, Montreal, Canada (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Manchester, Manchester, UK

    Giles Reger

Authors
  1. Giles Reger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giles Reger .

Editor information

Editors and Affiliations

  1. TU Wien, Vienna, Austria

    Ezio Bartocci

  2. Max Planck Institute for Software Systems, Kaiserslautern, Germany

    Rupak Majumdar

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Reger, G. (2015). Suggesting Edits to Explain Failing Traces. In: Bartocci, E., Majumdar, R. (eds) Runtime Verification. Lecture Notes in Computer Science(), vol 9333. Springer, Cham. https://doi.org/10.1007/978-3-319-23820-3_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23820-3_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23819-7

  • Online ISBN: 978-3-319-23820-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation