TL;DR: A portable debugger for full Haskell is described, building only on commonly implemented extensions, based on the concept of observation of intermediate data structures, rather than the more traditional stepping and variable examination paradigm used by traditional imperative debuggers.

TL;DR: In this article, the authors describe properties of a process calculus that has been developed for the purpose of analyzing security protocols, which is a restricted form of -calculus with bounded replication and probabilistic polynomial time expressions allowed in messages and boolean tests.

TL;DR: This paper introduces a new approach to the theory of Ω-categories enriched by a frame and introduces concepts of adjoints and a kind of convergence in an L-Fuzzy poset that makes the theory “constructive” or “computable”.

TL;DR: A pattern language based on the neighborhood relationship induced by the topology of the collection, which is devoted to the simulation of biological processes, especially those whose state space must be computed jointly with the current state of the system.

TL;DR: A particular tableau construction for the incremental analysis of execution traces during test, simulation or model-checking is presented, which forms the basis of a monitor that detects both good and bad prefix of a particular kind, namely those that are informative for the property under investigation.

TL;DR: In this article, a tool called JJForester is proposed to generate class structures from sdf grammar definitions, which implement a number of design patterns to facilitate construction and traversal of parse trees represented by object structures.

TL;DR: It is shown that it is possible to add function types, discriminated unions and parametric polymorphism to an existing, “real world” intermediary language and that this allows corresponding subsets of constructs to be compiled uniformly, which will allow programmers to use these constructs seamlessly between different languages.

TL;DR: The roles of {\ sc xt}''s constituents in the development process of program transformation tools, as well as some experiences with building program transformation systems with {\sc xt}.

TL;DR: The symbolic manipulations given in this paper are sufficient to verify TCTL-formulae fully symbolically and are shown how to do this efficiently by essentially quantifying out a special variable z which is used to represent the constant zero.

TL;DR: Two control flow analyses for the Java bytecode are proposed that safely approximate the set of permissions granted/denied to code at run-time and helps optimizing the implementation of the stack inspection algorithm.

TL;DR: A set of parser combinators for constructing deterministic, error-correcting parsers that may be used for the construction of large parsers to be used in compilers in practical use.

TL;DR: The author is reporting on the current state of the development of common exchange formats for graphs and graph transformation systems within the EU Working Group APPLIGRAPH (Applications of Graph Transformation).

TL;DR: The applicability of term rewriting to program transformation is limited by the lack of control over rule application and the context-free nature of rewrite rules, so this paper extends rewriting strategies with scoped dynamic rewrite rules.

TL;DR: An extension to the paradigm of directed model checking to shorten already established unacceptable long error trails to find shorter trails than blind depth-first search is contributed.

TL;DR: In this paper, the authors propose the paring of UML dynamic models with high-level timed Petri nets (HLTPN) to obtain a flexible and customizable means to reason on the dynamic aspects of object-oriented models, to simulate particular parts of these models, and if necessary analyze them.

TL;DR: A simple and efficient branch-and-bound algorithm for finding globally optimal solutions to geometric matching problems under a wide variety of allowable transformations and a wide range of allowable feature types is presented.

TL;DR: This paper shows that Rep( B ) is equivalent to a full coreflective subcategory of Equ, consisting of the so-called 0-equilogical spaces, and yields equivalent topological semantics of computation for all higher-order types over countably based T0-spaces.

TL;DR: The algebra of infinite trees is proved here to be a general coalgebraic phenomenon: let H be an endofunctor such that for every object X a final coalgebra, TX, of H(_) + X exists, and TX is an object-part of a monad which is completely iterative.

TL;DR: An encoding for finite processes of the mobile ambients calculus into term graphs is presented, proving its soundness and completeness with respect to the original, interleaving operational semantics.

TL;DR: This paper explains how the elimination of tail calls was solved in the Funnel compiler and presents some experimental results about the impact the technique has on both performance and size of the compiled programs.

TL;DR: A syntactic abbreviation, transformational patterns, is introduced, that is particularly useful when dealing with views, which provides the transformational-pattern construct with additional power to explicitly catch pattern match failure.

TL;DR: This paper adopts serializability as a criterion to evaluate the correctness of the JavaSpaces transaction semantics and proves thatserializability is satisfied only if the authors restrict to output, input, and read operations.

TL;DR: This paper presents an incremental algorithm to segment a discrete curve into digital arc, and gives pseudo-code algorithms for the main points, and avoids using the sophisticated machinery coming either from Computational Geometry or from Linear Programming.

TL;DR: This work presents sufficient conditions over a syntactic theory to circumvent this overhead of an interpreter for the call-by-value λ-calculus and a transformation into continuation-passing style (CPS), and mechanically changes the time complexity of this CPS transformation from potentially quadratic to linear.

TL;DR: This paper proposes a method for specifically proving termination of rewriting with particular strategies: local strategies on operators, based on an explicit induction on the termination property.

TL;DR: In this paper, a coinductive calculus of streams is developed, based on the presence of a final coalgebra structure on the set of streams (infinite sequences of real numbers).

TL;DR: This work describes how to embed a simple typed functional logic programming language in Haskell, which is a natural extension of the Prolog embedding by Seres and Spivey.

TL;DR: The.NET Common Language Runtime (CLR) offers a new opportunity to experiment with multi-language interoperation, and provides a relatively rare chance to explore deep interoperation of a wide range of programming language paradigms as mentioned in this paper.

TL;DR: This paper equips MSR with an extensible typing-infrastructure based on dependent types with subsorting, which elegantly captures and enforces basic relations among objects, and introduces the notion of memory predicate, where principals can store information that survives role termination.