Computer and information sciences topic list of research papers
-
On the decidability of fragments of the asynchronous π-calculus
Abstract We study the decidability of a reachability problem for various fragments of the asynchronous π-calculus. We consider the combination of three main features: name generation, name mobility, and unbounded control. We show that the...
2004 / Roberto M. Amadio, Charles Meyssonnier -
Efficient Automated Trace Analysis
Abstract Opium, Morphine and Coca are three automated trace analyzers based on the same principles for three different programming languages. An automated trace analyzer is connected to an event-oriented tracer. The traced program is run in...
2004 / Mireille Ducassé, Erwan Jahier -
Dynamic Channel Screening in the Higher Order π-Calculus
Abstract Recently programming languages have been designed to support mobile code, i.e. higher-order code that is transferred from a remote location or domain and executed within the local environment. This may expose the internal interfaces and...
2004 / José-Luis Vivas, Nobuko Yoshida -
Certifying Term Rewriting Proofs in ELAN
Abstract Term rewriting has been shown to be a good environment for both programming and proving. For analysing and debugging rule-based programs, we propose in this work a formalism based on the rewriting calculus with explicit substitutions...
2004 / Quang-Huy Nguyen -
Adventures in sequent calculus modulo equations
Abstract We apply the notion of an oriented rewrite theory and the associated coherence techniques in order to construct a framework for theorem proving modulo equations. This is achieved using existing rewriting techniques and a few simple lemmas,...
2005 / Patrick Viry -
A Note on Parallel Splicing on Images
Abstract The concept of splicing on images which is done in parallel is introduced. This is an extension of the operation of splicing on strings extensively studied in the context of DNA computing. Various properties of splicing on images are...
2004 / P.Helen Chandra, K.G. Subramanian, D.G. Thomas, D.L. Van -
Translating Combinatory Reduction Systems into the Rewriting Calculus
Abstract The last few years have seen the development of the rewriting calculus (or rho-calculus, ρCal) that extends first order term rewriting and λ-calculus. The integration of these two latter formalisms has been already handled either by...
2004 / Clara Bertolissi, Horatiu Cirstea, Claude Kirchner -
Preface
Abstract Introduction Bohm's theorem: applications to Computer Science Theory - BOTH 2001 This part of the volume contains the Proceedings of the ICALP 2001 Satellite Workshop on Bohm's theorem: applications to...
2005 / Jean-Jacques Levy -
An overview of JML tools and applications1 1www.jmlspecs.org
Abstract The Java Modeling Language (JML) can be used to specify the detailed design of Java classes and interfaces by adding annotations to Java source files. The aim of JML is to provide a specification language that is easy to use for Java...
2004 / Lilian Burdy, Yoonsik Cheon, David Cok, Michael D. Ernst, Joe Kiniry, et al. -
Information Leakage Detection in Boundary Ambients1 1Partially supported by MIUR Projects “Interpretazione Astratta, Type Systems e Analisi Control-Flow” and “Modelli formali per la sicurezza”, and the EU Contract IST-2001-32617 “Models and Types for Security in Mobile Distributed Systems”.
Abstract A variant of Mobile Ambient Calculus is introduced, called Boundary Ambient, to model multilevel security policies. Ambients that may guarantee to properly protect their content are explicitly identified as boundaries: a boundary can be...
2004 / Chiara Braghin, Agostino Cortesi, Riccardo Focardi -
Higher Dimensional Syntax
Abstract The aim of this paper is to present the notion of higher-dimensional syntax, which is a hierarchy of languages. Each term of a n-dimensional language will be typed by terms of the underlying n — 1-dimensional language. This is an...
2005 / Martin Wehr -
Saxo–rt: Interpreting Esterel Semantic on a Sequential Execution Structure
Abstract The Saxo-rt compiler implements a original method for compiling the concurrent synchronous language Esterel into sequential C code. The method is optimized for embedded systems with very tight memory and real-time constraints and shows...
2005 / Etienne Closse, Michel Poize, Jacques Pulou, Patrick Venier, Daniel Weil -
Pruning Terms for Principal Type Assignment
Abstract Affine terms are lambda terms in which no variable occurs twice, and linear terms are affine terms in which each bound variable occurs exactly once. The principal type of a term is the most general type which is assignable to the term....
2005 / Takeuti Izumi -
Rewriting Logic as a Framework for Generic Verification Tools
Abstract In this paper we propose to employ Rewriting Logic as a generic and uniform approach to support different specification languages for distributed systems in verification tools. We present a compiler generator which, given the definition of...
2005 / Martin Leucker, Thomas Noll -
An Operational Semantics for Declarative Multi-Paradigm Languages1 1This work has been partially supported by CICYT TIC 2001-2705-C03-01, by the MCYT under grants HA2001-0059, HU2001-0019 and HI2000-0161, and by the DFG under grant Ha 2457/1-2.
Abstract Practical declarative multi-paradigm languages combine the main features of functional, logic and concurrent programming (e.g., laziness, sharing, higher-order, logic variables, non-determinism, search strategies). Usually, these languages...
2004 / Elvira Albert, Michael Hanus, Frank Huch, Javier Oliver, Germán Vidal -
Denotational Completeness Revisited
Abstract We define a notion of Kripke logical predicate for models of classical linear logic. A Kripke logical predicate on a type A will be a set of generalised elements of A satisfying certain closure properties. Denotations of proofs of A will be ...
2005 / Thomas STREICHER -
Recursion and Corecursion Have the Same Equational Logic
Abstract This paper is concerned with the equational logic of corecursion, that is of definitions involving final coalgebra maps. The framework for our study is iteration theories (cf. e.g. [1,2]), recently reintroduced as models of the FLR ...
2004 / Lawrence S. Moss -
A Concurrent Object Calculus
Abstract We obtain a new formalism for concurrent object-oriented languages by extending Abadi and Cardelli's imperative object calculus with operators for concurrency from the π-calculus and with operators for synchronisation based on mutexes. Our...
2004 / Andrew D. Gordon, Paul D. Hankin -
Categories of dimaps and their dihomotopies in po-spaces and local po-spaces
Abstract This report 1 1 This research was supported by a 3-week visiting fellowship from the University of Aalborg, Denmark, by the...
2004 / Stefan Sokolowski -
Automatic Generation of Language-based Tools
Abstract Many tools can be automatically derived from formal language definitions, such as compilers/interpreters, editors, analyzers, visualizers/animators, etc. Some examples of language-based tools generated automatically by the LISA system are...
2004 / Pedro Rangel Henriques, Maria João Varanda Pereira, Marjan Mernik, Mitja Lenič, Enis Avdičaušević, et al.