{"id":154,"date":"2017-06-14T20:57:07","date_gmt":"2017-06-14T18:57:07","guid":{"rendered":"https:\/\/project.inria.fr\/wrla18\/?page_id=154"},"modified":"2017-06-14T20:58:35","modified_gmt":"2017-06-14T18:58:35","slug":"topics","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/wrla18\/topics\/","title":{"rendered":"Topics"},"content":{"rendered":"<p>The topics of the workshop include, but are not limited to:<\/p>\n<p>A. Foundations<\/p>\n<ul>\n<li>foundations and models of rewriting and rewriting logic, including termination, confluence, coherence and complexity<\/li>\n<li>unification, generalization, narrowing, and partial evaluation<\/li>\n<li>constrained rewriting and symbolic algebra<\/li>\n<li>graph rewriting<\/li>\n<li>tree automata<\/li>\n<li>rewriting strategies<\/li>\n<li>rewriting-based calculi and explicit substitution<\/li>\n<\/ul>\n<p>B. Rewriting as a Logical and Semantic Framework<\/p>\n<ul>\n<li>uses of rewriting and rewriting logic as a logical framework, including deduction modulo<\/li>\n<li>uses of rewriting as a semantic framework for programming language semantics<\/li>\n<li>rewriting semantics of concurrency models, distributed systems, and network protocols<\/li>\n<li>rewriting semantics of real-time, hybrid, and probabilistic systems<\/li>\n<li>uses of rewriting for compilation and language transformation<\/li>\n<\/ul>\n<p>C. Rewriting Languages<\/p>\n<ul>\n<li>rewriting-based declarative languages<\/li>\n<li>type systems for rewriting<\/li>\n<li>implementation techniques<\/li>\n<li>tools supporting rewriting languages<\/li>\n<\/ul>\n<p>D. Verification Techniques<\/p>\n<ul>\n<li>verification of confluence, termination, coherence, sufficient completeness, and related properties<\/li>\n<li>temporal, modal and reachability logics for verifying dynamic properties of rewrite theories<\/li>\n<li>explicit-state and symbolic model checking techniques for verification of rewrite theories<\/li>\n<li>rewriting-based theorem proving, including (co)inductive theorem proving<\/li>\n<li>rewriting-based constraint solving and satisfiability<\/li>\n<li>rewriting-semantics-based verification and analysis of programs<\/li>\n<\/ul>\n<p>E. Applications<\/p>\n<ul>\n<li>applications in logic, mathematics, physics, and biology<\/li>\n<li>rewriting models of biology, chemistry, and membrane systems<\/li>\n<li>security specification and verification<\/li>\n<li>applications to distributed, network, mobile, and cloud computing<\/li>\n<li>specification and verification of real-time, hybrid, probabilistic, and cyber-physical systems<\/li>\n<li>specification and verification of critical systems<\/li>\n<li>applications to model-based software engineering<\/li>\n<li>applications to engineering and planning.<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The topics of the workshop include, but are not limited to: A. Foundations foundations and models of rewriting and rewriting logic, including termination, confluence, coherence and complexity unification, generalization, narrowing, and partial evaluation constrained rewriting and symbolic algebra graph rewriting tree automata rewriting strategies rewriting-based calculi and explicit substitution B.\u2026<\/p>\n<p> <a class=\"continue-reading-link\" href=\"https:\/\/project.inria.fr\/wrla18\/topics\/\"><span>Continue reading<\/span><i class=\"crycon-right-dir\"><\/i><\/a> <\/p>\n","protected":false},"author":1179,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-154","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/wrla18\/wp-json\/wp\/v2\/pages\/154","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/wrla18\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/wrla18\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/wrla18\/wp-json\/wp\/v2\/users\/1179"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/wrla18\/wp-json\/wp\/v2\/comments?post=154"}],"version-history":[{"count":3,"href":"https:\/\/project.inria.fr\/wrla18\/wp-json\/wp\/v2\/pages\/154\/revisions"}],"predecessor-version":[{"id":157,"href":"https:\/\/project.inria.fr\/wrla18\/wp-json\/wp\/v2\/pages\/154\/revisions\/157"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/wrla18\/wp-json\/wp\/v2\/media?parent=154"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}