Computer and information sciences topic list of research papers
-
On the Complexity of RSRL
Abstract In this paper we present a computability and a complexity result on Relational Speciate Reentrant Logic (RSRL). RSRL is a description logic designed to formalise the linguistic framework and theory Head-Driven Phrase Structure Grammar. We...
2005 / Stephan Kepser -
Mixing Up Nondeterminism and Probability: a preliminary report1 1This paper is an updated version of the paper presented at the PROBMIV′98 workshop, Indianapolis.
Abstract For a process language with both nondeterministic and probabilistic choice, and a form of failure a transition system is given from which, in a modular way, various operational models corresponding to various interpretations of...
2005 / J.I. den Hartog, E.P. de Vink -
Preface
Abstract This volume contains the Proceedings of the 10th Workshop on Logic, Language, Information and Computation (WoLLIC'2003). The Workshop was held in Ouro Preto, Minas Gerais, Brazil from July 29 to August 1, 2003, in the Escola de Minas of the ...
2005 / Ruy de Queiroz, Elaine Pimentel, Lucilia Figueiredo -
Foundations of Behavioural Specification in Rewriting Logic
Abstract We extend behavioural specification based on hidden sorts to rewriting logic by constructing a hybrid between the two underlying logics. This is achieved by defining a concept of behavioural satisfaction for rewriting logic. Our approach is ...
2004 / Răzvan Diaconescu -
Type Inference for Recursively Constrained Types and its Application to OOP
Abstract We define a powerful type inference mechanism with application to object-oriented programming. The types inferred are recursively constrained types, types that come with a system of constraints. These types may be viewed as generalizations...
2004 / Jonathan Eifrig, Scott Smith, Valery Trifonov -
Ambient Calculus and its Logic in the Calculus of Inductive Constructions
Abstract The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of the theory and metatheory of Ambient Calculus and its modal...
2004 / Ivan Scagnetto, Marino Miculan -
Termination, deadlock and divergence in the λ-calculus with multiplicities1 1Partially supported by the ESPRIT Basic Research Project 6454 - CONFER.
Abstract The λ-calculus with multiplicities is a refinement of the lazy λ-calculus where the argument in an application comes with a multiplicity, which is an upper bound to the number of its uses. This introduces potential deadlocks in the...
2004 / Gerard Boudol, Cosimo Laneve -
An OO interpretation of graphs as meta-CASE's meta-meta-model
Abstract This paper presents the meta-meta-model of a meta-CASE that is largely based on graphs. Nevertheless, the graph aspects have been hidden behind an extended object-oriented model that makes easier the modeling task: the generalization of...
2005 / Vincent Englebert -
Model checking of causal knowledge formulas
Abstract A model checking algorithm for a variant of the temporal logic of causal knowledge [25] is given. The temporal language is interpreted over labelled prime event structures. Knowledge operators express agents' history knowledge and the...
2005 / Wojciech Penczek, Stanislaw Ambroszkiewicz -
Tripos Theory in Retrospect
Abstract The notion of ‘tripos’ was motivated by the desire to explain in what sense Higgs' description of sheaf toposes as H-valued sets and Hyland's realizability toposes are instances of the same construction. The construction itself can be seen...
2004 / Andrew M. Pitts -
Toposes of Coalgebras and Hidden Algebras
Abstract There is a long tradition in computer science of modelling finite data types such as stacks and natural numbers by algebras. More recently coalgebras, which are dual to algebras, have been used to model infinite data types and in...
2004 / James Worrell -
DynaMICs
Abstract Software engineering strives to enable the economic construction of software systems that behave reliably, predictably, and safely. In other engineering disciplines, safety is assured in part by detailed monitoring of processes. In...
2004 / Ann Q. Gates, Steve Roach, Oscar Mondragon, Nelly Delgado -
Web-Based Integrated Timetable Information System for Railways and Airlines
Abstract The paper presents a traffic information system called KRJ that covers Polish railways and airlines transportation systems. Basic algorithmic foundations for the system are given. The system...
2004 / Krzysztof Goczyla -
Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)2004 / Marc Boyer
-
Visual Design of Software Architecture and Evolution based on Graph Transformation
Abstract The paper suggests a two-level approach to describe visually software architectures and their evolution. One visual modeling formalism is used to describe the architecture level while another is used to model the behavior of each component...
2004 / C. Ermel, R. Bardohl, J. Padberg -
Coinduction in Control of Partially Observed Discrete-Event Systems
Abstract Coalgebra and coinduction provide new results and insights for the supervisory control of discrete-event systems (DES) with partial observations. In the case of full observations, coinduction has been used to define a new operation on...
2004 / Jan Komenda -
Monoid-labeled transition systems
Abstract Given a V -complete (semi)lattice L , we consider L -labeled transition...
2004 / H. Peter Gumm, Tobias Schröder -
Ensuring Consistency of Conditional Graph Grammars - A Constructive Approach -
Abstract Consistency conditions describe basic properties of graphs as e.g. the existence or uniqueness of certain elements. A graph grammar is consistent if the start graph satisfies the consistency condition and the rules preserve this property....
2005 / Reiko Heckel, Annika Wagner -
Model Checking Semi-Continuous Time Models Using BDDs
Abstract The verification of timed systems is extremely important, but also extremely difficult. Several methods have been proposed to assist in this task, including extensions to symbolic model checking. One possible use of model checking to...
2004 / Sérgio Campos, Márcio Teixeira, Marius Minea, Andreas Kuehlmann, Edmund Clarke -
Broadening the denotational semantics of linear logic
Abstract The proof-theoretic origins and specialized models of linear logic make it primarily operational in orientation. In contrast first-order logic treats the operational and denotational aspects of general mathematics quite evenhandedly. Here...
2005 / Vaughan Pratt