COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > sb2743's list > Shoggoth: A Formal Foundation for Strategic Rewriting
Shoggoth: A Formal Foundation for Strategic RewritingAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Siddharth Bhat. Rewriting is a versatile and powerful technique used in many domains. Strategic rewriting allows programmers to control the application of rewrite rules by composing individual rewrite rules into complex rewrite strategies. These strategies are semantically complex, as they may be nondeterministic, they may raise errors that trigger backtracking, and they may not terminate. Given such semantic complexity, it is necessary to establish a formal understanding of rewrite strategies and to enable reasoning about them in order to answer questions like: How do we know that a rewrite strategy terminates? How do we know that a rewrite strategy does not fail because we compose two incompatible rewrites? How do we know that a desired property holds after applying a rewrite strategy? To answer these questions, we introduce Shoggoth: a formal foundation for understanding, analysing and reasoning about strategic rewriting that is capable of answering these questions. We provide a denotational semantics of System S, a core language for strategic rewriting, and prove its equivalence to our big-step operational semantics, which extends existing work by explicitly accounting for divergence. We further define a location-based weakest precondition calculus to enable formal reasoning about rewriting strategies, and we prove this calculus sound with respect to the denotational semantics. We show how this calculus can be used in practice to reason about properties of rewriting strategies, including termination, that they are well-composed, and that desired postconditions hold. The semantics and calculus are formalised in Isabelle/HOL and all proofs are mechanised. This talk is part of the sb2743's list series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsGraduate Workshop in Economic and Social History CamPoS (Cambridge Philosophy of Science) seminar ICE Summer FestivalOther talksThe geologic history of marine dissolved organic carbon from iron (oxyhydr)oxides Digital chimeras of the human atria to enable in silico trials at scale How does the human brain recognize faces? The role of nolinearity and fluctuations in the non-reciprocal Cahn-Hilliard model Sea breeze problem and topography effects: new transform methods and computations CLT for a class of random walks in dynamic random environments |