Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Parallel program design: a foundation
Parallel program design: a foundation
Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
ACM Transactions on Programming Languages and Systems (TOPLAS)
A discipline of multiprogramming: programming theory for distributed applications
A discipline of multiprogramming: programming theory for distributed applications
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Towards a Verification Logic for Rewriting Logic
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
ESTL: A Temporal Logic for Events and States
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Verification Logic for Rewriting Logic
Journal of Logic and Computation
Science of Computer Programming
Symbolic Model Checking of Logics with Actions
Model Checking and Artificial Intelligence
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
The maude LTL model checker and its implementation
SPIN'03 Proceedings of the 10th international conference on Model checking software
A model checking approach for verifying COWS specifications
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
State/Event software verification for branching-time specifications
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
State/event-based LTL model checking under parametric generalized fairness
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
From linear temporal logic properties to rewrite propositions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Counterpart Semantics for a Second-Order μ-Calculus
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Model checking LTLR formulas under localized fairness
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
A rewriting logic approach to the formal specification and verification of web applications
Science of Computer Programming
| Hi-index | 0.00 |
This paper presents the foundation, design, and implementation of the Linear Temporal Logic of Rewriting model checker as an extension of the Maude system. The Linear Temporal Logic of Rewriting (LTLR) extends linear temporal logic with spatial action patterns which represent rewriting events. LTLR generalizes and extends various state-based and event-based logics and aims to avoid certain types of mismatches between a system and its temporal logic properties. We have implemented the LTLR model checker at the C++ level within the Maude system by extending the existing Maude LTL model checker. Our LTLR model checker provides very expressive methods to define event-related properties as well as state-related properties, or, more generally, properties involving both events and state predicates. This greater expressiveness is gained without compromising performance, because the LTLR implementation minimizes the extra costs involved in handling the events of systems.