Showing papers in "Electronic Notes in Theoretical Computer Science in 2000"

TL;DR: This approach constitutes a bridge between modal languages for coalgebras and the modal logic for Kripke-structures, and presents a sound and complete deduction calculus in case the constants in F are finite.

TL;DR: A novel model of security for reactive systems, generalizing previous definitions relying on the simulatability paradigm is presented, and it has the first general composition theorem, and a link to requirements formulated in logics.

TL;DR: This work characterises Turi and Plotkin's model of GSOS as a distributive law of a monad over a co-pointed endofunctor, and analyses generalised coiteration and coalgebraic coinduction “up-to” in terms of a distributives law of the underlying pointed end ofunctor of amonad over an endof unctor.

TL;DR: It is proved that one can characterize any given coalgebra up to simulation (and, in certain conditions, up to bisimulation) by a single sentence, and it is shown that truth for this logic can be understood as a simulation relation itself, but with respect to a richer functor F.

TL;DR: In this article, a Markovian process algebra with probabilities, priorities, zero durations, and a master-reactive slaves synchronization mechanism is introduced and proved congruence w.r.t.

TL;DR: An abstract interpretation-based analysis for automatically proving non-trivial properties of mobile systems of processes based on properties relying on the number of occurrences of processes during computation sequences, such as mutual exclusion and non-exhaustion of resources is proposed.

TL;DR: The solution is based on CINNI, a new calculus of explicit substitutions that makes use of a term representation that contains both the standard named notation and de Bruijn's indexed notation as special subcases.

TL;DR: This paper will give an overview of quantum computation from the point of view of a complexity theorist and see that one can think of BQP as yet another complexity class and study its power without focusing on the physical aspects behind it.

TL;DR: A characterization of monos in Set F in terms of congruences and bisimulations is given, which explains, under which conditions monos must be injective maps.

TL;DR: This paper introduces (back-and-forth) transformations between coalgebras of simple polynomial functors and certain Boolean algebrAs with operators (BAOs) that take the form of an adjunction.

TL;DR: This paper proves coinduction theorems for final coalgebras of endofunctors on categories of partial orders and (generalized) metric spaces and gives a condition under which the operational notion of simulation coincides with the denotational notion of final semantics.

TL;DR: A technique is introduced which can be used to model both sequential and parallel composition (in interleaving semantics) while providing the general advantages of the technique of continuations while applying the CSC technique in designing operational and denotational models for two simple nonuniform concurrent languages.

TL;DR: It is shown that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not recursively enumerable, which means that there are no automatic methods for proving all true statements; in particular, behavioral logics do not admit complete deduction systems.

TL;DR: It is argued that the problem is not a lack of good design strategies, but confusion about the meaning of ‘authentication’, which has misled attempts to formalize this concept.

TL;DR: Two conditions of the E-strategy with and without on-demand flags on which an evaluated term is always in head normal form are proposed and a method of obtaining normal forms if a way to get head normal forms is given is given.

TL;DR: This work investigates a hierarchy of domains with totality where some selected base domains are closed, including domains for the reals, the natural numbers and the boolean values, under cartesian products and restricted function spaces.

TL;DR: This paper is a survey of the new notions and results scattered in [13,11,12], however the speculations of Section 5 and Section 6 are new.

TL;DR: In this paper, the relation between formal topology and the theory of domains is discussed, and it is shown that some open problems in one of the two fields could already have a solution in the other, and that is why an intensification of contact should be rewarding.

TL;DR: Two executable languages: the rewriting logic based specification language Maude and the higher-order, lazy, functional programming language Haskell are compared experimentally on a problem in modeling and reasoning about a security protocol for authentication.

TL;DR: There have been several proposals for logic programming language based on linear logic: Lolli, Lygon, and Forum, however, none of them have been implemented in Java.

TL;DR: This paper investigates how the coalgebraic semantics of objects accounts for subtyping, and shows that different characterisations of so-called behavioural subtyped found in the literature can conveniently be expressed in coal algebraic terms.

TL;DR: This paper extends the results of [4,7] by showing that NDC can be also easily adapted to detect secrecy attacks over networks.

TL;DR: Mercury as mentioned in this paper is a Prolog-based debugger with a shared infrastructure that supports three debuggers: a simple procedural debugger similar to the tracing systems of Prolog implementations, a prototype declarative debugger, and a debugger based on the idea of automatic trace analysis.

TL;DR: A systematic categorical analysis of basic concepts, constructions, and results in Universal Algebra is presented and a concept of coequational specification strictly dual to the concept of equational specification in UniversalAlgebra is developed.

TL;DR: A model suitable for describing a distributed real-time system and a notion of implementation for such systems on a uniprocessor system are discussed.

TL;DR: It is shown that polytypic programming can be reduced to metaprogramming, and that can be developed in a reflective first-order language like Maude, without having to extend the language.

TL;DR: This paper presents a method for specifying reconfigurations or transformations over the topology of the architecture style, being sure that if the transformation can be specified, then its application over the system will be consistent with respect to the expected architecture style configuration.

TL;DR: This work proposes a technique based on model checking to verify that actual information flows between applets are authorized, and proposes a security policy that associates levels to applet attributes and methods and defines authorized flows between levels.

TL;DR: An algorithm is proposed that progressively refines the ESRG classes until a lumped Markov chain is obtained for almost symmetrical Stochastic Well-formed Net models.

TL;DR: The authors would like to thank the Maude group and especially Jose Meseguer for many fruitful discussions and Brad Smith for helping to understand the PIM-DM protocol and kindly providing his pseudo-code.