Results 11  20
of
50
Beating the Productivity Checker Using Embedded Languages
"... Abstract. Some total languages, like Agda and Coq, allow the use of guarded corecursion to construct infinite values and proofs. Guarded corecursion is a form of recursion in which arbitrary recursive calls are allowed, as long as they are guarded by a coinductive constructor. Guardedness ensures th ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. Some total languages, like Agda and Coq, allow the use of guarded corecursion to construct infinite values and proofs. Guarded corecursion is a form of recursion in which arbitrary recursive calls are allowed, as long as they are guarded by a coinductive constructor. Guardedness ensures that programs are productive, i.e. that every finite prefix of an infinite value can be computed in finite time. However, many productive programs are not guarded, and it can be nontrivial to put them in guarded form. This paper gives a method for turning a productive program into a guarded program. The method amounts to defining a problemspecific language as a data type, writing the program in the problemspecific language, and writing a guarded interpreter for this language. 1
A semiringbased trace semantics for processes with applications to information leakage analysis
 In 6th IFIP TC 1/WG 2.2 Int. Conf. TCS 2010, Part of WCC2010 Proceedings
, 2010
"... Abstract. We propose a framework for reasoning about program security building on languagetheoretic 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 hig ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We propose a framework for reasoning about program security building on languagetheoretic 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. 1
Behavioural Differential Equations and Coinduction for Binary Trees
"... Abstract. We study the set TA of infinite binary trees with nodes labelledinasemiringA from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact that TA carries a final coalgebra structure. By viewing trees as formal power series, we develop a calculus ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. We study the set TA of infinite binary trees with nodes labelledinasemiringA from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact that TA carries a final coalgebra structure. By viewing trees as formal power series, we develop a calculus where definitions are presented as behavioural differential equations. We present a general format for these equations that guarantees the existence and uniqueness of solutions. Although technically not very difficult, the resulting framework has surprisingly nice applications, which is illustrated by various concrete examples. 1
A Coalgebraic Perspective on Linear Weighted Automata
, 2011
"... Weighted automata are a generalization of nondeterministic automata where each transition, in addition to an input letter, has also a quantity expressing the weight (e.g. cost or probability) of its execution. As for nondeterministic automata, their behaviours can be expressed in terms of either ( ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Weighted automata are a generalization of nondeterministic automata where each transition, in addition to an input letter, has also a quantity expressing the weight (e.g. cost or probability) of its execution. As for nondeterministic automata, their behaviours can be expressed in terms of either (weighted) bisimilarity or (weighted) language equivalence. Coalgebras provide a categorical framework for the uniform study of statebased systems and their behaviours. In this work, we show that coalgebras can suitably model weighted automata in two different ways: coalgebras on
Coinductive Counting With Weighted Automata
, 2002
"... A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite weighted automaton; (2) the automaton is reduced by means of the quantitative notion of stream bisimulation; ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite weighted automaton; (2) the automaton is reduced by means of the quantitative notion of stream bisimulation; (3) the reduced automaton is used to compute an expression (in terms of stream constants and operators) that represents the stream of all counts.
Coinductive proof principles for stochastic processes
 Proc. 21st Symp. Logic in Computer Science (LICS’06
, 2006
"... Vol. 3 (4:8) 2007, pp. 1–14 ..."
Relating Two Approaches to Coinductive Solution of Recursive Equations
 Milius (Eds.), Proceedings of the 7th Workshop on Coalgebraic Methods in Computer Science, CMCS’04 (Barcelona, March 2004), Electron. Notes in Theoret. Comput. Sci
, 2004
"... This paper shows that the approach of [2,12] for obtaining coinductive solutions of equations on infinite terms is a special case of a more general recent approach of [4] using distributive laws. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This paper shows that the approach of [2,12] for obtaining coinductive solutions of equations on infinite terms is a special case of a more general recent approach of [4] using distributive laws.
Coalgebraic BisimulationUpTo
, 2013
"... Bisimulationupto enhances the bisimulation proof method for process equivalence. We present its generalization from labelled transition systems to arbitrary coalgebras, and show that for a large class of systems, enhancements such as bisimulation up to bisimilarity, up to equivalence and up to con ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Bisimulationupto enhances the bisimulation proof method for process equivalence. We present its generalization from labelled transition systems to arbitrary coalgebras, and show that for a large class of systems, enhancements such as bisimulation up to bisimilarity, up to equivalence and up to context are sound proof techniques. This allows for simplified bisimulation proofs for many different types of statebased systems.
Weighted bisimulations in linear algebraic form
, 2009
"... We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the statespace of the automaton is represented by a vector space, and the transitions and weighting maps by linear morphisms over this vect ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the statespace of the automaton is represented by a vector space, and the transitions and weighting maps by linear morphisms over this vector space. Weighted bisimulations are represented by subspaces that are invariant under the transition morphisms. We show that the largest bisimulation coincides with weighted language equivalence, can be computed by a geometrical version of partition refinement and that the corresponding quotient gives rise to the minimal weightedlanguage equivalence automaton. Relations to Larsen and Skou’s probabilistic bisimulation and to classical results in Automata Theory are also discussed.