1,044 research outputs found
Evaluating the performance of model transformation styles in Maude
Rule-based programming has been shown to be very successful in many application areas. Two prominent examples are the specification of model transformations in model driven development approaches and the definition of structured operational semantics of formal languages. General rewriting frameworks such as Maude are flexible enough to allow the programmer to adopt and mix various rule styles. The choice between styles can be biased by the programmer’s background. For instance, experts in visual formalisms might prefer graph-rewriting styles, while experts in semantics might prefer structurally inductive rules. This paper evaluates the performance of different rule styles on a significant benchmark taken from the literature on model transformation. Depending on the actual transformation being carried out, our results show that different rule styles can offer drastically different performances. We point out the situations from which each rule style benefits to offer a valuable set of hints for choosing one style over the other
Variations on Algebra: monadicity and generalisations of equational theories
Dedicated to Rod Burstal
A comonadic view of simulation and quantum resources
We study simulation and quantum resources in the setting of the
sheaf-theoretic approach to contextuality and non-locality. Resources are
viewed behaviourally, as empirical models. In earlier work, a notion of
morphism for these empirical models was proposed and studied. We generalize and
simplify the earlier approach, by starting with a very simple notion of
morphism, and then extending it to a more useful one by passing to a co-Kleisli
category with respect to a comonad of measurement protocols. We show that these
morphisms capture notions of simulation between empirical models obtained via
`free' operations in a resource theory of contextuality, including the type of
classical control used in measurement-based quantum computation schemes.Comment: To appear in Proceedings of LiCS 201
State space c-reductions for concurrent systems in rewriting logic
We present c-reductions, a state space reduction technique.
The rough idea is to exploit some equivalence relation on states (possibly capturing system regularities) that preserves behavioral properties, and explore the induced quotient system. This is done by means of a canonizer
function, which maps each state into a (non necessarily unique) canonical representative of its equivalence class. The approach exploits the expressiveness of rewriting logic and its realization in Maude to enjoy several advantages over similar approaches: exibility and simplicity in
the definition of the reductions (supporting not only traditional symmetry reductions, but also name reuse and name abstraction); reasoning support for checking and proving correctness of the reductions; and automatization
of the reduction infrastructure via Maude's meta-programming
features. The approach has been validated over a set of representative case studies, exhibiting comparable results with respect to other tools
Maude: specification and programming in rewriting logic
Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object level. Reflection is systematically exploited in Maude endowing the language with powerful metaprogramming capabilities, including both user-definable module operations and declarative strategies to guide the deduction process. This paper explains and illustrates with examples the main concepts of Maude's language design, including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views. We also explain how Maude supports reflection, metaprogramming and internal strategies. The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques. We conclude with some remarks about applications, work on a formal environment for Maude, and a mobile language extension of Maude
Probability functions in the context of signed involutive meadows
The Kolmogorov axioms for probability functions are placed in the context of
signed meadows. A completeness theorem is stated and proven for the resulting
equational theory of probability calculus. Elementary definitions of
probability theory are restated in this framework.Comment: 20 pages, 6 tables, some minor errors are correcte
- …