Simulation and Verification of Synchronous Set Relations in Rewriting Logic
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 order-sorted 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.
KeywordsReachability Analysis Arithmetic Expression Atomic Relation Strict Partial Order Maximal Strategy
Unable to display preview. Download preview PDF.
- 6.Estlin, T., Jónsson, A., Păsăreanu, C., Simmons, R., Tso, K., Verna, V.: Plan Execution Interchange Language (PLEXIL). Technical Memorandum TM-2006-213483, NASA (2006)Google Scholar
- 7.Lucanu, D.: 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)CrossRefMATHGoogle Scholar
- 10.Rocha, C., Meseguer, J.: Proving safety properties of rewrite theories. Technical report, University of Illinois at Urbana-Champaign (2010), http://dx.doi.org/10.1007/978-3-642-22944-2_22
- 12.Serbanuta, T.: A Rewriting Approach to Concurrent Programming Language Design and Semantics. PhD thesis, University of Illinois at Urbana-Champaign (December 2010), http://hdl.handle.net/2142/18252