Jeeg: a programming language for concurrent objects synchronization
JGI '02 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
Monitoring Programs Using Rewriting
Proceedings of the 16th IEEE international conference on Automated software engineering
Checking Finite Traces Using Alternating Automata
Formal Methods in System Design
An Overview of the Runtime Verification Tool Java PathExplorer
Formal Methods in System Design
A Taxonomy and Catalog of Runtime Software-Fault Monitoring Tools
IEEE Transactions on Software Engineering
Rewriting-Based Techniques for Runtime Verification
Automated Software Engineering
Collecting Statistics Over Runtime Executions
Formal Methods in System Design
Simulation-based verification using Temporally Attributed Boolean Logic
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Temporal Assertions using AspectJ
Electronic Notes in Theoretical Computer Science (ENTCS)
Compensation-aware runtime monitoring
RV'10 Proceedings of the First international conference on Runtime verification
Safer asynchronous runtime monitoring using compensations
Formal Methods in System Design
Proceedings of the 18th ACM symposium on Access control models and technologies
| Hi-index | 0.00 |
The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as input. The generated algorithm runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula.}