Computer and information sciences topic list of research papers
-
Finding Objects with Segmentation Strategy based Multi Robot Exploration in Unknown Environment
Abstract In this paper we address exploration algorithm in flat experimental environment with colored objects for multi robots system. The aim of exploration in unknown environment is finding target points like mine detection in outdoor environment...
2013 / Reza Arezoumand, Syamsiah Mashohor, Mohammad Hamiruce Marhaban -
A Geometric Semantics for Dialogue Game Protocols for Autonomous Agent Interactions
Abstract Formal dialogue games studied by philosophers since the time of Aristotle have recently found application in Artificial Intelligence as the basis for protocols for interactions between autonomous software agents. For instance, game...
2004 / Peter McBurney, Simon Parsons -
Coequational Logic for Finitary Functors
Abstract Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Adámek. However, the logic is more complicated for other functors...
2008 / Daniel Schwencke -
Preface
Abstract This volume contains the papers presented at the Third Workshop on Language Descriptions, Tools and Applications (LDTA ′03), held in Warsaw, Poland, April 6, 2003, as a satellite event of the European Joint Conferences on Theory and...
2005 / Barrett Bryant, João Saraiva -
Preface
Abstract Formal Methods Elsewhere A Satellite Workshop of FORTE-PSTV-2000 devoted to applications of formal methods to areas other than communication protocols and software engineering ...
2005 / Howard Bowman -
Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de Enseñanza Superior e Investigación Cientifica, SB 97-00110508
Abstract In this paper we propose a Chomsky-Schützenberger type characterization of k-poly-slender context-free languages, as the homomorphical image of an intersection of a Dyck language and a (2k + 1)-poly-slender regular language. A stronger...
2005 / Masami Ito, Carlos Martín-Vide, Victor Mitrana -
Mapping OMRS to Rewriting Logic
Abstract The long-term objective of the Open Mechanized Reasoning Systems (OMRS) project is to provide a framework for specifying and structuring reasoning systems, and a technology for integrating and interoperating diverse proof systems with each...
2005 / José Meseguer, Carolyn Talcott -
Implementation with evidence2012 / Navin Kartik, Olivier Tercieux
-
A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)
Abstract This paper gives a simple and direct algorithm for computing the always regular set of reachable states of a pushdown system. It then exploits this algorithm for obtaining model checking algorithms for linear-time temporal logic as well as...
2005 / Alain Finkel, Bernard Willems, Pierre Wolper -
On Extracting Static Semantics
Abstract We examine the problem of automatically extracting a static semantics from a language's semantic definition. Traditional approaches require manual construction of static and dynamic semantics, followed by a proof that the two are...
2004 / John Hannan -
Model-Generation of a Fictitious Clock Real-Time Logic Using Sharing Trees
Abstract We present first the logic mtl, a real-time temporal logic that is at the heart of the real-time specification language Albert. Since this logic is undecidable, we approximate it (using the theory of Abstract Interpretation) by its...
2004 / Laurent Ferier, Jean-François Raskin, Pierre-Yves Schobbens -
Introduction to COMPUGRAPH
Abstract This is a survey of the main aims and results of the ESPRIT Basic Research Working Group COMPUTING BY GRAPH TRANSFORMATION with main emphasize on COMPUGRAPH II, 1992–1996, following up the first phase of COMPUGRAPH, 1989–1992. Starting with ...
2005 / Hartmut Ehrig -
UML-based Tool for Constructing Component Systems via Component Behaviour Inheritance
Abstract We present a tool which integrates the Unified Modeling Language with a processoriented technique for component system specification and design. We have transformed the definition of process inheritance into definitions of inheritance of...
2004 / E.E. Roubtsova, S.A. Roubtsov -
Management of Railroad Impedances for Shortest Path-based Routing
Abstract The routing of traffic is a major logistical concern for transportation services. For railroads, routing has historically been handled by large, hard-coded tables. Norfolk Southern Railways developed a more sophisticated routing system that ...
2004 / Jeff Day, George L. Nemhauser, Joel S. Sokol -
Open Learning at a Distance: Lessons for Struggling MOOCs2013 / P. McAndrew, E. Scanlon
-
Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph).2004 / Giorgio Busatto, Berthold Hoffmann
-
A graph-based approach to the compositional specification of distributed systems
Abstract Distributed graph transformation is introduced as a formal specification technique for the compositional specification of distributed systems. Distributed graph transformations are an intuitive, graphical and rule-based formalism to model...
2004 / Manuel Koch -
Matching typed and untyped realizability
Abstract Realizability interpretations of logics are given by saying what it means for computational objects of some kind to realize logical formulae. The computational objects in question might be drawn from an untyped universe of computation, such ...
2004 / John Longley -
Regular Model Checking using Widening Techniques
Abstract In this paper, we consider symbolic model checking of safety properties of linear parametrized systems. Sets of configurations are represented by regular languages and actions by regular relations. Since the verification problem amounts to...
2004 / Tayssir Touili -
Simple Easy Terms
Abstract We illustrate the use of intersection types as a semantic tool for proving easiness result on λ-terms. We single out the notion of simple easiness for λ-terms as a useful semantic property for building filter models with special purpose...
2004 / F. Alessi, S. Lusin