Rewriting-Based Techniques for Runtime Verification
Top Cited Papers
- 1 April 2005
- journal article
- Published by Springer Science and Business Media LLC in Automated Software Engineering
- Vol. 12 (2), 151-197
- https://doi.org/10.1007/s10515-005-6205-y
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- Experiments with Test Case Generation and Runtime AnalysisLecture Notes in Computer Science, 2003
- Monitoring Temporal Rules Combined with Time SeriesLecture Notes in Computer Science, 2003
- Bandera: extracting finite-state models from Java source codePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Maude: specification and programming in rewriting logicTheoretical Computer Science, 2002
- Boolean and Cartesian Abstraction for Model Checking C ProgramsLecture Notes in Computer Science, 2001
- Specification and proof in membership equational logicTheoretical Computer Science, 2000
- The Temporal Rover and the ATG RoverLecture Notes in Computer Science, 2000
- The Maude SystemLecture Notes in Computer Science, 1999
- A deadlock detection tool for concurrent Java programsSoftware: Practice and Experience, 1999
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986