Computer and information sciences topic list of research papers
-
Linearization of Automatic Arrays and Weave Specifications
Abstract Grabmayer, Endrullis, Hendriks, Klop, and Moss [C. Grabmayer, J. Endrullis, D. Hendriks, J.W. Klop, and L.S. Moss. Automatic sequences and zipspecifications. In Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer...
2013 / David Sprunger -
Generic Axiomatized Digital Surface-Structures
Abstract In digital topology, Euclidean n-space R n is usually modeled either by the set of points of a discrete grid, or by ...
2004 / Sébastien Fourey, T. Yung Kong, Gabor T. Herman -
Type Inference using Constraint Handling Rules
Abstract In this paper we present an implementation of the general system for type inference algorithms HM(X), using Prolog and Constraint Handling Rules. In our implementation the difference between the general aspects of the type inference...
2004 / Sandra Alves, Mário Florido -
Isolating Resource Consumption in Linear Logic Proof Search
Abstract This work presents an extension of the Tag-Frame resource management system previously developed by the authors. The extended system is able to isolate the consumption of a given goal/clause without incurring extra runtime costs. We believe ...
2004 / Pablo Lòpez, Ernesto Pimentel, Joshua S. Hodas, Jeffrey Polakow, Lubomira Stoilova -
Cooperation of Constraint Solvers: Using the New Process Control Facilities of ELAN
Abstract In this paper, we introduce new process control facilities in the ELAN language as low-level primitives and high-level concurrent strategies. The low-level primitives are similar to those existing in UNIX for process control and...
2005 / Peter Borovanský, Carlos Castro -
From Rewrite Theories to Temporal Logic Theories
Abstract The work presented here aims at bridging the gap between executable specifications and formal verification. In this paper we combine two levels of description without changing the framework. The operational level of Maude/rewriting logic...
2005 / Grit Denker -
Abstracts2011 /
-
Polymorphic type-checking for the ramified theory of types of Principia Mathematica
Abstract A formal presentation of the ramified theory of types of the Principia Mathematica of Russell and Whitehead is given. The treatment is inspired by but differs sharply from that in a recent paper of Kamareddine, Nederpelt and Laan. A...
2004 / M.Randall Holmes -
An Elementary Algorithm for Digital Arc Segmentation
Abstract This paper is concerned with the digital circle recognition problem and more precisely with the circular separating algorithm. It tries to go further in implementation details, giving pseudo-code algorithms for the main points, and avoids...
2004 / David Coeurjolly, Laure Tougne, Yan Gérard, Jean-Pierre Reveillès -
New Foundations for Rewriting Logic
Abstract This paper presents an abstract treatment of the foundations of rewriting logic, generalising in three ways: an arbitrary 2-category plays the role of the specific 2-category Cat; the foundations are rendered fully independent of the...
2005 / Hendrik Hilberdink -
CCS Semantics via Proved Transition Systems and Rewriting Logic
Abstract Abstracts We consider (a slight variant of) the ccs calculus, and we analyze two operational semantics defined in the literature: the first exploits Proved Transition Systems (PTS) and the second Rewriting Logic (RL). We...
2005 / Georgia Carabetta, Pierpaolo Degano, Fabio Gadducci -
What is a 'Good' Encoding of Guarded Choice?
Abstract The π-calculus with synchronous output and mixed-guarded choices is strictly more expressive than the π-calculus with asynchronous output and no choice. As a corollary, Palamidessi recently proved that there is no fully compositional...
2005 / Uwe Nestmann -
Preface
Abstract Foreword This volume contains the Proceedings of the Thirteenth Conference on the Mathematical Foundations of Programming Semantics. The Conference was held on the campus of Carnegie Mellon University, Pittsburgh, PA from March 23 to March...
2005 / Steve Brookes, Michael Main, Austin Melton, Michael Mislove -
Automath and Pure Type Systems
Abstract We study the position of the Automath systems within the framework of Pure Type Systems (PTSs). In [1,15], a rough relationship has been given between Automath and PTSs. That relationship ignores three of the most important features of...
2004 / Fairouz Kamareddine, Twan Laan, Rob Nederpelt -
UPGRADE: A Framework for Building Graph-Based Interactive Tools
Abstract Construction of interactive tools for visual languages is a challenging task. The UPGRADE framework leverages tool builders by integrating application logic and GUI components. It is based on attributed graphs as its internal data model. At ...
2005 / B. Böhlen, D. Jäger, A. Schleicher, B. Westfechtel -
Automatic Derivation of the Irrationality of e
Abstract As part of a project on automatic generation of proofs involving both logic and computation, we have automatically generated a proof of the irrationality of e. The proof involves inequalities, bounds on infinite series, type distinctions...
2005 / Michael Beeson -
Bireflectivity
Abstract Motivated by a model for syntactic control of interference, we introduce a general categorical concept of bireflectivity. Bireflective subcategories of a category A ...
2004 / P.J. Freyd, P.W. O'Hearn, A.J. Power, M. Takeyama, R.D. Tennent -
Modeling Process Calculi with PVS
Abstract In this work we show how process calculi can be embedded into the general-purpose verification system PVS. We make use of PVS's higher order predicate logic to define the abstract co-data type “process” as a terminal coalgebra of the finite ...
2004 / Dmitri Schamschurko -
Turing Machines, Transition Systems, and Interaction
Abstract We present Persistent Turing Machines (PTMs), a new way of interpreting Turing-machine computation, one that is both interactive and persistent. We show that the class of PTMs is isomorphic to a very general class of effective transition...
2004 / Dina Q. Goldin, Scott A. Smolka, Peter Wegner -
Improving Content Privacy on Social Networks Using Open Digital Rights Management Solutions
Abstract Among Internet users, the social networks have gained a huge popularity. Millions of users are part of some online social network in order to share their own experiences and content with others. Documents, videos, music and pictures are...
2014 / Joaquim Marques, Carlos Serrão