Computer and information sciences topic list of research papers
-
Approximations for Strategies and Termination
Abstract The theorem of Huet and Lévy stating that for orthogonal rewrite systems (i) every reducible term contains a needed redex and (ii) repeated contraction of needed redexes results in a normal form if the term under consideration has a normal...
2004 / Aart Middeldorp -
Encoding Generic Judgments
Abstract Operational semantics is often presented in a rather syntactic fashion using relations specified by inference rules or equivalently by clauses in a suitable logic programming language. As it is well known, various syntactic details of...
2004 / Dale Miller -
Preface
Abstract This volume contains the proceedings of the third Workshop on Proof Search in Type-Theoretic Languages, in conjunction with CADE-15 Conference. It was held in Lindau, Germany, 5 July 1998. Many recent works have been...
2005 / Didier Galmiche -
Computing Large Planar Regions in Terrains
Abstract We consider the problem of computing the largest region in a terrain that is approximately contained in some two-dimensional plane. We reduce this problem to the following one. Given an embedding of a degree-3 graph G on the unit sphere ...
2004 / Katharina Lange, Rahul Ray, Michiel Smid, Ulrich Wendt -
Preface
Abstract This volume contains the Proceedings of the Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT 2002). The conference was a two-day event and took place in the National University...
2005 / Ted Hurley -
Exploiting XPG for Visual Languages Definition, Analysis and Development
Abstract In this paper we present the approach based on the formalism of Extended Positional Grammars (XPG) for specifying, designing and implementing visual languages. Special emphasis is put on describing the benefits deriving from the use of such ...
2005 / G. Costagliola, V. Deufemia, F. Ferrucci, C. Gravino -
Transactions for Software Model Checking
Abstract This paper presents a software model checking algorithm that combats state explosion by decomposing each thread's execution into a sequence of transactions that execute atomically. Our algorithm infers transactions using the theory of...
2005 / Cormac Flanagan, Shaz Qadeer -
Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking
Abstract We explore the use of distributed processing to enhance the performance of explicit state enumeration based safety model-checking. State enumeration based model-checkers employ a hash-table to cut off search when a state is revisited....
2005 / Hemanthkumar Sivaraj, Ganesh Gopalakrishnan -
Verification with the Undefined
Abstract Partially defined processes have been used in verification for more than a decade. When a notion of “the undefined” is added to a process description formalism, it also has to be added to the semantics, to guarantee that sophisticated...
2004 / Antero Kangas, Antti Valmari -
Automatic Detection of Copies Divergence in Collaborative Editing Systems1 1The authors would like to thank Pascal Molli and Gérald Oster for useful comments on an earlier draft of this paper.
Abstract The design of collaborative editing (CE) system is a difficult and error-prone activity, since building the correct operations for maintaining good convergence properties of the local copies requires examining a large number of situations....
2004 / Abdessamad Imine, Pascal Urso -
A Notion of Classical Pure Type System (Preliminary version)
Abstract We present a notion of classical pure type system, which extends the formalism of pure type system with a double negation operator.
2005 / Gilles Barthe, John Hatcliff, Morten Heine Sørensen -
Stone Coalgebras
Abstract In this paper we argue that the category of Stone spaces forms an interesting base category for coalgebras, in particular, if one considers the Vietoris functor as an analogue to the power set functor. We prove that the so-called...
2004 / Clemens Kupke, Alexander Kurz, Yde Venema -
Towards a theory of mathematical operational semantics
Abstract Turi and Plotkin gave a precise mathematical formulation of a notion of structural operational semantics in their paper “Towards a mathematical operational semantics.” Starting from that definition and at the level of generality of that...
2004 / John Power -
A Logic Based Asynchronous Multi-Agent System
Abstract We present a logic programming based asynchronous multi-agent system in which agents can communicate with one another; update themselves and each other; abduce hypotheses to explain observations, and use them to generate actions. The...
2004 / Pierangelo Dell'Acqua, Ulf Nilsson, Luís Moniz Pereira -
Using Meta-Modelling and Graph Grammars to Create Modelling Environments
Abstract This paper presents the combined use of meta-modelling and graph grammars for the generation of visual modelling tools for simulation formalisms. In meta-modelling, formalisms are described at a meta-level. This information is used by a...
2004 / Juan de Lara Jaramillo, Hans Vangheluwe, Manuel Alfonseca Moreno -
Preface
Abstract US - Brazil Joint Workshops on the Formal Foundations of Software Systems Rio de Janeiro, May 5 - 9, 1997 and New Orleans, November 13 - 16, 1997 The papers in this volume form the Proceedings of two workshops that took...
2005 / Rance Cleaveland, Michael Mislove, Philip Mulry -
Refinement and Development of Programs from Relational Specifications
Abstract These tutorial notes present an overview of specification and refinement concepts and methods that are based on relations.
2004 / Wolfram Kahl -
Abstracts of Invited Talks
Abstract Towards Adaptive Real-Time Systems Giorgio Buttazzo University of Pavia Italy Modern real-time applications, including multimedia systems, mobile robotics, and...
2005 / Giorgio Buttazzo, Avi Efrati, John Hooker, Claude Le Pape, Joseph Sifakis -
Coloring based Hierarchical Routing Approach
Abstract Graph coloring was exploited in wireless sensor networks to solve many optimization problems. These problems are related in general to channel assignment. In this paper, we propose to jointly use coloring for routing purposes. We introduce...
2013 / Dhouha Ghrab, Bilel Derbel, Imen Jemili, Amine Dhraief, Abdelfettah Belghith, et al. -
Towards Incremental Mutation Testing
Abstract Proponents of Agile development processes claim that adhering to Agile principles leads to the delivery of high quality code in evolutionary increments. Confidence in resulting systems is mostly gained through the use of unit test suites,...
2013 / Mark Anthony Cachia, Mark Micallef, Christian Colombo