Computer and information sciences topic list of research papers
-
Mechanising a Modal Logic for Value-Passing Agents in HOL
Abstract An extension of Hennessy-Milner logic to value-passing CCS is embedded in the HOL system. The resulting proof environment allows one to formally verify modal properties of communicating agents, which are defined over an infinite value...
2005 / Monica Nesi -
Continuation Semantics and Self-adjointness
Abstract We give an abstract categorical presentation of continuation semantics by taking the continuation type constructor ¬ (or cont in Standard ML of New Jersey) as primitive. This constructor on types extends to a contravariant functor on terms...
2005 / Hayo Thielecke -
Intersection Types and Computational Rules
Abstract The invariance of the meaning of a λ-term by reduction/expansion w.r.t. the considered computational rules is one of the minimal requirements for a λ-model. Being the intersection type systems a general framework for the study of semantic...
2004 / Fabio Alessi, Franco Barbanera, Mariangiola Dezani-Ciancaglini -
The Impact of Linearity Information on the Performance of TyCO
Abstract We describe a linear channel inference system for the TyCO programming language, where channel usage is tracked through method invocations as well as definition instantiations. We then apply linear channel information to optimize code...
2004 / Francisco Martins, Luís Lopes, Vasco T. Vasconcelos -
Preface
Abstract This volume contains the Proceedings of EXPRESS'99, the sixth International Workshop on Expressiveness in Concurrency. The workshop was held in Eindhoven, The Netherlands, on 23 August 1999, as a satellite event to the CONCUR '99...
2005 / Ilaria Castellani, Björn Victor -
Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP
Abstract In this paper we investigate the decidability of history-preserving bisimilarity (HPB) and hereditary history-preserving bisimilarity (HHPB) for basic parallel processes (BPP). We find that both notions are decidable for this class of...
2005 / Sibylle Fröschle -
Compatibility between Syntax and Semantics of Graph Grammars
Abstract Graph grammars are a suitable formalism for the specification of systems. In particular, systems that involve a large amount of parallelism can be very well modeled as graph grammars. Relationships among graph grammars describe structural...
2005 / Leila Ribeiro Korff -
The development of interactive algorithms for the Mathematical Environment
Abstract The Mathematical Environment which is under development at the Glushkov Institute of Cybernetics is a system of tools supporting the interactive manipulation of knowledge represented in the form of (formalized) mathematical texts. The...
2005 / A.A. Letichevsky, J.V. Kapitonova, V.A. Volkov, A. Chugayenko, V. Khomenko, et al. -
Semantic Domains for Handel-C
Abstract Handel-C is a programming language which is a hybrid of CSP and C, designed to target hardware implementations, specifically field-programmable gate arrays (FPGAs). The language is C-like with CSP-like parallel constructs and channel...
2004 / Andrew Butterfield, Jim Woodcock -
Efficient compilation of array iterators for Lustre
Abstract In this paper, we present a compilation scheme along with optimizations for array iterators in the synchronous data flow language Lustre. We present the iterators (inspired from functional languages mechanisms such as map and foldl…) and...
2005 / Lionel Morel -
A Topological Approach to Distributed Computing
Abstract In several state-based approaches to distributed computing, e.g., action systems, or UNITY, the computing nodes are commonly left unspecified or implicit. For instance, an action system comes with an informal description on how the system...
2005 / Luigia Petre, Kaisa Sere, Marina Waldén -
Inverse Kinematics Using Particle Swarm Optimization, A Statistical Analysis
Abstract This paper investigates the relative performances of PSO variants when used to solve inverse kinematics. Inverse kinematics is a key issue in robotics; for problems such as path planning, motion generation or trajectories optimization, they ...
2013 / Nizar Rokbani, Adel.M. Alimi -
Towards Behavioral Maude
Abstract How can algebraic and coalgebraic specifications be integrated? How can behavioral equivalence be addressed in an algebraic specification language? The hidden-sorted approach, originating in work of Goguen and Meseguer in the early 80's,...
2004 / José Meseguer, Grigore Roşu -
Automated validation of distributed software using the IF environment
Abstract This paper summarizes our experience with IF, an open validation environment for distributed software systems. Indeed, face to the increasing complexity of such systems, none of the existing tools can cover by itself the whole validation...
2004 / Marius Bozga, Susanne Graf, Laurent Mounier -
Is Strategic Programming a Viable Paradigm?
Abstract This discussion paper for the Workshop on Reduction Strategies in Programming and Rewriting (WRS'01) speculates on the viability of strategic programming in mainstream programming and in two selected application areas: theorem proving and...
2004 / Paul Klint -
Trivial Reals
Abstract Solovay showed that there are noncomputable reals α such that H(α ∥ n) ≤ H(1n)+O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the connection between algorithmic complexity and effective...
2004 / Rod G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan -
An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems
Abstract We show how the tree-automata techniques proposed by Lugiez and Schnoebelen apply to the reachability analysis of RPPS systems. Using these techniques requires that we express the states of RPPS systems in a tailor-made process rewrite...
2004 / A. Labroue, Ph. Schnoebelen -
TPAP
Abstract This paper describes a timed process algebra called TPAP. The aim of this algebra is to allow the modelisation of real time embedded processes sharing common resources, and which are sensitive to communication delays and scheduling...
2004 / Jérôme Ermont, Frédéric Boniol -
A Meta-analysis on the Antecedents and Consequences of Computer Anxiety
Abstract The purpose of the study is to examine the correlates of computer anxiety, using meta-analytic procedures. Analyses included 38 studies containing 79 correlation coefficients. Significant antecedents of computer anxiety are trait anxiety...
2014 / Laurentiu P. Maricutoiu -
Coalition Formation Based Multi-item Multi-attribute Negotiation of Supply Chain Networks
Abstract In this paper, a coalition formation based negotiation protocol, which aims to reduce the workload and time of the manufacturer agent (MA), is proposed for the material supplier agent (MSA) to find partners to establish a coalition when the ...
2013 / Fang Yu, Toshiya Kaihara, Nobutada Fujii