Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Specification-based test oracles for reactive systems
ICSE '92 Proceedings of the 14th international conference on Software engineering
Model checking for programming languages using VeriSoft
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A practical method for verifying event-driven software
Proceedings of the 21st international conference on Software engineering
A deadlock detection tool for concurrent Java programs
Software—Practice & Experience
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
Formal Analysis of a Space-Craft Controller Using SPIN
IEEE Transactions on Software Engineering
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Model-Checking Multi-threaded Distributed Java Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
The Temporal Rover and the ATG Rover
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Experiments in Theorem Proving and Model Checking for Protocol Verification
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Synthesizing Dynamic Programming Algorithms fromLinear Temporal Logic Formulae
Synthesizing Dynamic Programming Algorithms fromLinear Temporal Logic Formulae
Testing Linear Temporal Logic Formulae on Finite Execution Traces
Testing Linear Temporal Logic Formulae on Finite Execution Traces
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Jeeg: a programming language for concurrent objects synchronization
JGI '02 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
Synthesizing Monitors for Safety Properties
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Formalizing ODP enterprise specifications in Maude
Computer Standards & Interfaces
Runtime safety analysis of multithreaded programs
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
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
Combining test case generation and runtime verification
Theoretical Computer Science - Abstract state machines and high-level system design and analysis
Using Dominators to Extract Observable Protocol Contexts
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Writing and executing ODP computational viewpoint specifications using Maude
Computer Standards & Interfaces
A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Using LTL rewriting to improve the performance of model-checker based test-case generation
Proceedings of the 3rd international workshop on Advances in model-based testing
Verified Software: Theories, Tools, Experiments
Working with the Past: Integrating History in Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Automatic processor customization for zero-overhead online software verification
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Invariant-driven specifications in Maude
Science of Computer Programming
Temporal Extensions of OCL Revisited
ECMDA-FA '09 Proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications
Complementary Criteria for Testing Temporal Logic Properties
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
Issues in using model checkers for test case generation
Journal of Systems and Software
Robustness of temporal logic specifications for continuous-time signals
Theoretical Computer Science
Monitoring Algorithms for Metric Temporal Logic Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Experiments with test case generation and runtime analysis
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Testing extended regular language membership incrementally by rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
The good, the bad, and the ugly, but how ugly is ugly?
RV'07 Proceedings of the 7th international conference on Runtime verification
TRACECONTRACT: a scala DSL for trace analysis
FM'11 Proceedings of the 17th international conference on Formal methods
Sampling-based runtime verification
FM'11 Proceedings of the 17th international conference on Formal methods
Weak Kripke structures and LTL
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Monitoring of real-time properties
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Process mining and verification of properties: an approach based on temporal logic
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
DecSerFlow: towards a truly declarative service flow language
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Robustness of temporal logic specifications
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Combining time and frequency domain specifications for periodic signals
RV'11 Proceedings of the Second international conference on Runtime verification
Runtime verification of traces under recording uncertainty
RV'11 Proceedings of the Second international conference on Runtime verification
Working with the Past: Integrating History in Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Controlled natural language in a game for legal assistance
CNL'10 Proceedings of the Second international conference on Controlled Natural Language
What does AI have to do with RV?
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Runtime verification based on register automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Enforceable Security Policies Revisited
ACM Transactions on Information and System Security (TISSEC)
Communications of the ACM
| Hi-index | 0.02 |
We present a rewriting algorithm for efficiently testingfuture time Linear Temporal Logic (LTL) formulae on finiteexecution traces. The standard models of LTL are infinitetraces, reflecting the behavior of reactive and concurrentsystems which conceptually may be continuously alive. Inmost past applications of LTL, theorem provers and modelcheckers have been used to formally prove that down-scaledmodels satisfy such LTL specifications. Our goal is insteadto use LTL for up-scaled testing of real software applications,corresponding to analyzing the conformance of finitetraces against LTL formulae. We first describe whatit means for a finite trace to satisfy an LTL formula andthen suggest an optimized algorithm based on transformingLTL formulae. We use the Maude rewriting logic, whichturns out to be a good notation and being supported by anefficient rewriting engine for performing these experiments.The work constitutes part of the Java PathExplorer (JPAX)project, the purpose of which is to develop a flexible tool formonitoring Java program executions.