Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' …
As its title promises, this book provides foundations for software specification and formal software development from the perspective of work on algebraic specification. It …
S Bliudze, J Sifakis - Proceedings of the 7th ACM & IEEE international …, 2007 - dl.acm.org
We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types …
Collecting information previously scattered throughout the vast literature, including the author's own research, Stochastic Relations: Foundations for Markov Transition Systems …
A Rutle, A Rossini, Y Lamo, U Wolter - The Journal of Logic and Algebraic …, 2012 - Elsevier
This paper introduces a formal approach to constraint-aware model transformation which supports specifying constraints in the definition of transformation rules. These constraints are …
Z Diskin, T Maibaum - Model-Driven Engineering of Information …, 2014 - books.google.com
There are several well established applications of category theory (CT) in theoretical computer science; typical examples are programming language semantics and concurrency …
R Bruni, I Lanese, U Montanari - Theoretical Computer Science, 2006 - Elsevier
The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is …
Architectures depict design principles: paradigms that can be understood by all, allow thinking on a higher plane and avoiding low-level mistakes. They provide means for …
MA Mabrok, MJ Ryan - Appl. Math. Inf. Sci, 2017 - digitalcommons.aaru.edu.jo
In this paper, we introduce Category Theory as a formal foundation for model-based systems engineering. A generalised view of the system based on category theory is presented …