Publication:
Simulation and Verification of Synchronous Set Relations in Rewriting Logic

Thumbnail Image
Files

Files

Simulation and Verification of Synchronous Set.pdf (253.25 KB)
View Statistics
Reference Managers
Mendeley
Indexers
Google Scholar CORE
QR Code
QR Code
Authors

Authors

Rocha, Camilo
Múñoz, César
Abstract (Spanish)
Este artículo presenta una base matemática y una infraestructura lógica de reescritura para la ejecución y verificación de propiedades de relaciones de conjuntos sincrónicos. El fundamento matemático se da en el lenguaje de las relaciones abstractas de conjuntos. La infraestructura consiste en una teoría de reescritura ordenada en Maude, un sistema lógico de reescritura, que permite la ejecución sincrónica de una relación establecida proporcionada por el usuario. Mediante el uso de la infraestructura, las técnicas de verificación de algoritmos existentes ya disponibles en Maude para la reescritura asincrónica tradicional, como el análisis de accesibilidad y la verificación de modelos, están disponibles automáticamente para la reescritura sincrónica de conjuntos. El uso de la infraestructura se ilustra con una semántica operativa ejecutable de un lenguaje síncrono simple y la verificación de las propiedades temporales de un sistema síncrono.
Abstract (English)
This paper presents a mathematical foundation and a rewriting logic infrastructure for the execution and property verification of synchronous set relations. The mathematical foundation is given in the language of abstract set relations. The infrastructure consists of an ordersorted rewrite theory in Maude, a rewriting logic system, that enables the synchronous execution of a set relation provided by the user. By using the infrastructure, existing algorithm verification techniques already available in Maude for traditional asynchronous rewriting, such as reachability analysis and model checking, are automatically available to synchronous set rewriting. The use of the infrastructure is illustrated with an executable operational semantics of a simple synchronous language and the verification of temporal properties of a synchronous system.
Extent
12 páginas.
URI: https://repositorio.escuelaing.edu.co/handle/001/1893
Collections

Collections

AD - CTG – Informática
References

M. AlTurki and J. Meseguer. Reduction semantics and formal analysis of Orc programs. Electronic Notes in Theoretical Computer Science, 200(3):25 – 41, 2008. Proceedings of the 3rd International Workshop on Automated Specification and Verification of Web Systems (WWV 2007).

R. Bruni and J. Meseguer. Semantic foundations for generalized rewrite theories. Theoretical Computer Science, 360(1-3):386–414, 2006.

C. Chira, T. F. Serbanuta, and G. Stefanescu. P systems with control nuclei: The concept. Journal of Logic and Algebraic Programming, 79(6):326 – 333, 2010. Membrane computing and programming.

M. Clavel, F. Dur´an, S. Eker, P. Lincoln, N. Mart´ı-Oliet, J. Meseguer, and C. L. Talcott, editors. All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic, volume 4350 of Lecture Notes in Computer Science. Springer, 2007.

G. Dowek, C. Mu˜noz, and C. Rocha. Rewriting logic semantics of a plan execution language. Electronic Proceedings in Theoretical Computer Science, 18:77–91, 2010.

T. Estlin, A. J´onsson, C. P˘as˘areanu, R. Simmons, K. Tso, and V. Verna. Plan Execution Interchange Language (PLEXIL). Technical Memorandum TM-2006- 213483, NASA, 2006.

D. Lucanu. Strategy-based rewrite semantics for membrane systems preserves maximal concurrency of evolution rule actions. Electronic Notes in Theoretical Computer Science, 237:107 – 125, 2009. Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2008).

J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi-Presicce, editor, WADT, volume 1376 of Lecture Notes in Computer Science, pages 18–61. Springer, 1997.

J. Meseguer and P. Olveczky. Formalization and correctness of the pals architec- ¨ tural pattern for distributed real-time systems. In J. Dong and H. Zhu, editors, Formal Methods and Software Engineering, volume 6447 of Lecture Notes in Computer Science, pages 303–320. Springer Berlin / Heidelberg, 2010.

C. Rocha and J. Meseguer. Proving safety properties of rewrite theories. Technical report, University of Illinois at Urbana-Champaign, 2010. http://hdl.handle.net/2142/17407.

C. Rocha, C. Mu˜noz, and G. Dowek. A formal library of set relations and its application to synchronous languages. Theoretical Computer Science, 412(37):4853– 4866, 2011.

T. Serbanuta. A Rewriting Approach to Concurrent Programming Language Design and Semantics. PhD thesis, University of Illinois at Urbana-Champaign, December 2010. https://www.ideals.illinois.edu/handle/2142/18252.

T. Serbanuta, G. Stefanescu, and G. Rosu. Defining and executing p systems with structured data in k. In D. Corne, P. Frisco, G. Paun, G. Rozenberg, and A. Salomaa, editors, Membrane Computing, volume 5391 of Lecture Notes in Computer Science, pages 374–393. Springer Berlin / Heidelberg, 2009.

P. Viry. Equational rules for rewriting logic. Theoretical Computer Science, 285(2):487–517, 2002.