Combining Techniques to Reduce State Space and Prove Strong Properties

Authors:
Dilia E. Rodríguez
Affiliations:
Information Directorate, Air Force Research Laboratory, Rome, New York, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 5
Cited 1

Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Better verification through symmetry

Formal Methods in System Design - Special issue on symmetry in automatic verification
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Chain replication for supporting high throughput and availability

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

State space c-reductions of concurrent systems in rewriting logic

ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

An on-the-fly symmetry reduction technique that exploits the lexicographic order on metarepresentations of Maude terms, and a technique that uses auxiliary data to verify strong properties that are not directly expressible in propositional temporal logic are presented. Both are implemented by simple transformations of rewrite theories. They are applied in the verification of a strong-consistency property of a client-server protocol, a simplification of the Chain-Replication protocol.