The Experts below are selected from a list of 1173 Experts worldwide ranked by ideXlab platform
Daniele Gorla - One of the best experts on this subject based on the ideXlab platform.
-
A Semiring-based Trace Semantics for Processes with Applications to Information Leakage Analysis. Extended version of the present paper. Available from http://www.dsi.uniroma1.it/˜gorla/papers
2015Co-Authors: Michele Boreale, David Clark, Daniele GorlaAbstract:Abstract. We propose a framework for reasoning about program security build-ing on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from traces of high (unobservable) events to low (ob-servable) events: the less the degree of dependency of low events on high traces, the more secure the system. We take the abstract view that low events are drawn from a generic semiring, where they can be combined using product and sum op-erations; throughout the paper, we provide instances of this framework, obtained by concrete instantiations of the underlying semiring. We specify systems via a simple process calculus, whose semantics is given as the Unique Homomorphism from the calculus into the set of behaviours, i.e. formal power series, seen as a final coalgebra. We provide a compositional semantics for the calculus in terms of rational operators on formal power series and show that the final and the com-positional semantics coincide.
-
A Semiring-Based Trace Semantics for Processes with Applications to Information Leakage Analysis
2010Co-Authors: Michele Boreale, David Clark, Daniele GorlaAbstract:We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from traces of high (unobservable) events to low (observable) events: the less the degree of dependency of low events on high traces, the more secure the system. We take the abstract view that low events are drawn from a generic semiring, where they can be combined using product and sum operations; throughout the paper, we provide instances of this framework, obtained by concrete instantiations of the underlying semiring. We specify systems via a simple process calculus, whose semantics is given as the Unique Homomorphism from the calculus into the set of behaviours, i.e. formal power series, seen as a final coalgebra. We provide a compositional semantics for the calculus in terms of rational operators on formal power series and show that the final and the compositional semantics coincide.
-
A semiring-based trace semantics for processes with applications to information leakage analysis
'Springer Science and Business Media LLC', 2010Co-Authors: Michele Boreale, David Clark, Daniele GorlaAbstract:We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from traces of high (unobservable) events to low (observable) events: the less the degree of dependency of low events on high traces, the more secure the system. We take the abstract view that low events are drawn from a generic semiring, where they can be combined using product and sum operations; throughout the paper, we provide instances of this framework, obtained by concrete instantiations of the underlying semiring. We specify systems via a simple process calculus, whose semantics is given as the Unique Homomorphism from the calculus into the set of behaviours, i.e. formal power series, seen as a final coalgebra. We provide a compositional semantics for the calculus in terms of rational operators on formal power series and show that the final and the compositional semantics coincide. © IFIP International Federation for Information Processing 2010
Michele Boreale - One of the best experts on this subject based on the ideXlab platform.
-
A Semiring-based Trace Semantics for Processes with Applications to Information Leakage Analysis. Extended version of the present paper. Available from http://www.dsi.uniroma1.it/˜gorla/papers
2015Co-Authors: Michele Boreale, David Clark, Daniele GorlaAbstract:Abstract. We propose a framework for reasoning about program security build-ing on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from traces of high (unobservable) events to low (ob-servable) events: the less the degree of dependency of low events on high traces, the more secure the system. We take the abstract view that low events are drawn from a generic semiring, where they can be combined using product and sum op-erations; throughout the paper, we provide instances of this framework, obtained by concrete instantiations of the underlying semiring. We specify systems via a simple process calculus, whose semantics is given as the Unique Homomorphism from the calculus into the set of behaviours, i.e. formal power series, seen as a final coalgebra. We provide a compositional semantics for the calculus in terms of rational operators on formal power series and show that the final and the com-positional semantics coincide.
-
A Semiring-Based Trace Semantics for Processes with Applications to Information Leakage Analysis
2010Co-Authors: Michele Boreale, David Clark, Daniele GorlaAbstract:We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from traces of high (unobservable) events to low (observable) events: the less the degree of dependency of low events on high traces, the more secure the system. We take the abstract view that low events are drawn from a generic semiring, where they can be combined using product and sum operations; throughout the paper, we provide instances of this framework, obtained by concrete instantiations of the underlying semiring. We specify systems via a simple process calculus, whose semantics is given as the Unique Homomorphism from the calculus into the set of behaviours, i.e. formal power series, seen as a final coalgebra. We provide a compositional semantics for the calculus in terms of rational operators on formal power series and show that the final and the compositional semantics coincide.
-
A semiring-based trace semantics for processes with applications to information leakage analysis
'Springer Science and Business Media LLC', 2010Co-Authors: Michele Boreale, David Clark, Daniele GorlaAbstract:We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from traces of high (unobservable) events to low (observable) events: the less the degree of dependency of low events on high traces, the more secure the system. We take the abstract view that low events are drawn from a generic semiring, where they can be combined using product and sum operations; throughout the paper, we provide instances of this framework, obtained by concrete instantiations of the underlying semiring. We specify systems via a simple process calculus, whose semantics is given as the Unique Homomorphism from the calculus into the set of behaviours, i.e. formal power series, seen as a final coalgebra. We provide a compositional semantics for the calculus in terms of rational operators on formal power series and show that the final and the compositional semantics coincide. © IFIP International Federation for Information Processing 2010
-
processes as formal power series a coinductive approach to denotational semantics
Theoretical Computer Science, 2006Co-Authors: Michele Boreale, Fabio GadducciAbstract:We characterize must testing equivalence on CSP in terms of the Unique Homomorphism from the Moore automaton of CSP processes to the final Moore automaton of partial formal power series over a certain semiring. The final automaton is then turned into a CSP-algebra: operators and fixpoints are defined, respectively, via behavioural differential equations and simulation relations. This structure is then shown to be preserved by the final Homomorphism. As a result, we obtain a fully abstract compositional model of CSP phrased in purely set-theoretical terms.
David Clark - One of the best experts on this subject based on the ideXlab platform.
-
A Semiring-based Trace Semantics for Processes with Applications to Information Leakage Analysis. Extended version of the present paper. Available from http://www.dsi.uniroma1.it/˜gorla/papers
2015Co-Authors: Michele Boreale, David Clark, Daniele GorlaAbstract:Abstract. We propose a framework for reasoning about program security build-ing on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from traces of high (unobservable) events to low (ob-servable) events: the less the degree of dependency of low events on high traces, the more secure the system. We take the abstract view that low events are drawn from a generic semiring, where they can be combined using product and sum op-erations; throughout the paper, we provide instances of this framework, obtained by concrete instantiations of the underlying semiring. We specify systems via a simple process calculus, whose semantics is given as the Unique Homomorphism from the calculus into the set of behaviours, i.e. formal power series, seen as a final coalgebra. We provide a compositional semantics for the calculus in terms of rational operators on formal power series and show that the final and the com-positional semantics coincide.
-
A Semiring-Based Trace Semantics for Processes with Applications to Information Leakage Analysis
2010Co-Authors: Michele Boreale, David Clark, Daniele GorlaAbstract:We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from traces of high (unobservable) events to low (observable) events: the less the degree of dependency of low events on high traces, the more secure the system. We take the abstract view that low events are drawn from a generic semiring, where they can be combined using product and sum operations; throughout the paper, we provide instances of this framework, obtained by concrete instantiations of the underlying semiring. We specify systems via a simple process calculus, whose semantics is given as the Unique Homomorphism from the calculus into the set of behaviours, i.e. formal power series, seen as a final coalgebra. We provide a compositional semantics for the calculus in terms of rational operators on formal power series and show that the final and the compositional semantics coincide.
-
A semiring-based trace semantics for processes with applications to information leakage analysis
'Springer Science and Business Media LLC', 2010Co-Authors: Michele Boreale, David Clark, Daniele GorlaAbstract:We propose a framework for reasoning about program security building on language-theoretic and coalgebraic concepts. The behaviour of a system is viewed as a mapping from traces of high (unobservable) events to low (observable) events: the less the degree of dependency of low events on high traces, the more secure the system. We take the abstract view that low events are drawn from a generic semiring, where they can be combined using product and sum operations; throughout the paper, we provide instances of this framework, obtained by concrete instantiations of the underlying semiring. We specify systems via a simple process calculus, whose semantics is given as the Unique Homomorphism from the calculus into the set of behaviours, i.e. formal power series, seen as a final coalgebra. We provide a compositional semantics for the calculus in terms of rational operators on formal power series and show that the final and the compositional semantics coincide. © IFIP International Federation for Information Processing 2010
Joost Winter - One of the best experts on this subject based on the ideXlab platform.
-
Context-Free Languages, Coalgebraically
2014Co-Authors: Joost Winter, Marcello M Bonsangue, Jan RuttenAbstract:Abstract. We give a coalgebraic account of context-free languages using the functor D(X) = 2 × X A for deterministic automata over an alphabet A, in three different but equivalent ways: (i) by viewing context-free grammars as D-coalgebras; (ii) by defining a format for behavioural differential equations (w.r.t. D) for which the Unique solutions are precisely the context-free languages; and (iii) as the D-coalgebra of generalized regular expressions in which the Kleene star is replaced by a Unique fixed point operator. In all cases, semantics is defined by the Unique Homomorphism into the final coalgebra of all languages, thus paving the way for coinductive proofs of context-free language equivalence. Furthermore, the three characterizations are elementary to the extent that they can serve as the basis for the definition of a general coalgebraic notion of context-freeness, which we see as the ultimate long-term goal of the present study.
-
context free languages coalgebraically
Conference on Algebra and Coalgebra in Computer Science, 2011Co-Authors: Joost Winter, Marcello M Bonsangue, J J M M RuttenAbstract:We give a coalgebraic account of context-free languages using the functor D(X) = 2 × XA for deterministic automata over an alphabet A, in three different but equivalent ways: (i) by viewing context-free grammars as D-coalgebras; (ii) by defining a format for behavioural differential equations (w.r.t. D) for which the Unique solutions are precisely the context-free languages; and (iii) as the D-coalgebra of generalized regular expressions in which the Kleene star is replaced by a Unique fixed point operator. In all cases, semantics is defined by the Unique Homomorphism into the final coalgebra of all languages, paving the way for coinductive proofs of context-free language equivalence. Furthermore, the three characterizations can serve as the basis for the definition of a general coalgebraic notion of context-freeness, which we see as the ultimate long-term goal of the present study.
-
context free languages coalgebraically
Software Engineering [SEN], 2011Co-Authors: Joost Winter, Marcello M Bonsangue, J J M M RuttenAbstract:We give a coalgebraic account of context-free languages using the functor ${\cal D}(X) = 2 \times X^A$ for deterministic automata over an alphabet $A$, in three different but equivalent ways: (i) by viewing context-free grammars as ${\cal D}$-coalgebras; (ii) by defining a format for behavioural differential equations (w.r.t. ${\cal D}$) for which the Unique solutions are precisely the context-free languages; and (iii) as the ${\cal D}$-coalgebra of generalized regular expressions in which the Kleene star is replaced by a Unique fixed point operator. In all cases, semantics is defined by the Unique Homomorphism into the final coalgebra of all languages, thus paving the way for coinductive proofs of context-free language equivalence. Furthermore, the three characterizations are elementary to the extent that they can serve as the basis for the definition of a general coalgebraic notion of context-freeness, which we see as the ultimate long-term goal of the present study.
J J M M Rutten - One of the best experts on this subject based on the ideXlab platform.
-
context free languages coalgebraically
Conference on Algebra and Coalgebra in Computer Science, 2011Co-Authors: Joost Winter, Marcello M Bonsangue, J J M M RuttenAbstract:We give a coalgebraic account of context-free languages using the functor D(X) = 2 × XA for deterministic automata over an alphabet A, in three different but equivalent ways: (i) by viewing context-free grammars as D-coalgebras; (ii) by defining a format for behavioural differential equations (w.r.t. D) for which the Unique solutions are precisely the context-free languages; and (iii) as the D-coalgebra of generalized regular expressions in which the Kleene star is replaced by a Unique fixed point operator. In all cases, semantics is defined by the Unique Homomorphism into the final coalgebra of all languages, paving the way for coinductive proofs of context-free language equivalence. Furthermore, the three characterizations can serve as the basis for the definition of a general coalgebraic notion of context-freeness, which we see as the ultimate long-term goal of the present study.
-
context free languages coalgebraically
Software Engineering [SEN], 2011Co-Authors: Joost Winter, Marcello M Bonsangue, J J M M RuttenAbstract:We give a coalgebraic account of context-free languages using the functor ${\cal D}(X) = 2 \times X^A$ for deterministic automata over an alphabet $A$, in three different but equivalent ways: (i) by viewing context-free grammars as ${\cal D}$-coalgebras; (ii) by defining a format for behavioural differential equations (w.r.t. ${\cal D}$) for which the Unique solutions are precisely the context-free languages; and (iii) as the ${\cal D}$-coalgebra of generalized regular expressions in which the Kleene star is replaced by a Unique fixed point operator. In all cases, semantics is defined by the Unique Homomorphism into the final coalgebra of all languages, thus paving the way for coinductive proofs of context-free language equivalence. Furthermore, the three characterizations are elementary to the extent that they can serve as the basis for the definition of a general coalgebraic notion of context-freeness, which we see as the ultimate long-term goal of the present study.
