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
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its 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
ESTL: A Temporal Logic for Events and States
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
A spatial logic for concurrency--II
Theoretical Computer Science - Special issue: Foundations of wide area network computing
A Verification Logic for Rewriting Logic
Journal of Logic and Computation
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
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
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
Specification and Verification of Web Applications in Rewriting Logic
FM '09 Proceedings of the 2nd World Congress on Formal Methods
A rewriting logic approach to the formal specification and verification of web applications
Science of Computer Programming
| Hi-index | 0.00 |
This paper presents a model checker for LTLR, a subset of the temporal logic of rewriting TLR* extending linear temporal logic with spatial action patterns. Both LTLR and TLR* are very expressive logics generalizing well-known state-based and action-based logics. Furthermore, the semantics of TLR* is given in terms of rewrite theories, so that the concurrent systems on which the LTLR properties are model checked can be specified at a very high level with rewrite rules. This paper answers a nontrivial challenge, namely, to be able to build a model checker to model check LTLR formulas on rewrite theories with relatively little effort by reusing Maude@?s LTL model checker for rewrite theories. For this, the reflective features of both rewriting logic and its Maude implementation have proved extremely useful.