Computer and information sciences topic list of research papers
-
Research on the Framework of the Product Data Model
Abstract Product model is the basic data foundation of product development. To satisfy complex product development requirement, the integrated model is brought out and the architecture of it is constructed by level modeling. It includes demand,...
2012 / Mi Jie -
Reengineering the Wikipedia for Reputation
Abstract The Wikipedia is a free online encyclopedia collaboratively edited by Internet users with a minimum of administration. Anybody can write an article for the Wikipedia and there is no verification of the author's expertise on the particular...
2009 / Thomas Rune Korsgaard, Christian D. Jensen -
Constructive Membership Predicates as Index Types
Abstract In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we motivate and explore this idea in the concrete setting of lists ...
2007 / James Caldwell, Josef Pohl -
A Calculus of Components with Dynamic Type-Checking
Abstract We present a simple module calculus modeling software composition in an open environment, where some components can be provided from the outside after execution has started. Operators for combining software components are as in previous...
2007 / Sonia Fagorzi, Elena Zucca -
An Abstract Specification Language for Static Program Analysis
Abstract Static program analysers typically come with a set of hard-coded checks, leaving little room for the user to add additional properties. In this work, we present a uniform approach to enable the specification of new static analysis checks in ...
2009 / Michael Vistein, Frank Ortmeier, Wolfgang Reif, Ralf Huuck, Ansgar Fehnker -
Abstraction and Model Checking of Core Erlang Programs in Maude
Abstract This paper provides a contribution to the formal verification of programs written in the concurrent functional programming language Erlang, which is designed for telecommunication applications. We present a formalization of this language in ...
2007 / Martin Neuhäußer, Thomas Noll -
Interactions in Transport Networks
Abstract We present a model that captures basic interactions occurring in transport networks, including routing and flow control. Many network processes can be seen as solving an optimisation problem, or seeking a balance between competing...
2005 / Nigel Walker, Marc Wennink -
Exploring an Option Space to Engineer a Ubiquitous Computing System
Abstract Engineering natural and appropriate interactive behaviour in ubiquitous computing systems presents new challenges to their developers. This paper explores formal models of interactive behaviour in ubiquitous systems. Of particular interest...
2008 / Michael D. Harrison, Christian Kray, José Creissac Campos -
Rule-Based Operational Semantics for an Imperative Language
Abstract Operational semantics for programming languages usually come in two flavours: big-step and small-step. Both are defined using deduction rules with a congruence rule allowing reduction in certain contexts. For a description based on rewrite...
2007 / Florent Kirchner, François-Régis Sinot -
A Rewriting Logic Framework for Soft Constraints
Abstract Soft constraints extend classical constraints to deal with non-functional requirements, over-constrained problems and preferences. Bistarelli, Montanari and Rossi have developed a very elegant and abstract semiring based theory of soft...
2007 / Martin Wirsing, Grit Denker, Carolyn Talcott, Andy Poggio, Linda Briesemeister -
Partial and Fuzzy Constraint Satisfaction to Support Coalition Formation
Abstract The creation of dynamic coalitions is a challenging task, seen from a security perspective. Due to the presence of conflicting requirements and specifications, the policy negotiation and policy merging processes call for the use of...
2007 / Petros Belsis, Stefanos Gritzalis, Sokratis K. Katsikas -
Peirce's Rule in a Full Natural Deduction System
Abstract Natural deduction (ND) for first order classical logic is obtainable from the intuitionist system by the addition of Peirce rule. In a previous paper [Luiz Carlos Pereira, Edward Hermann Haeusler, Vaston G. Costa, and Wagner Sanz....
2009 / Vaston G. Costa, Wagner Sanz, Edward H. Haeusler, Luiz C. Pereira -
Preface2005 / Juan Bicarregui, Andrew Butterfield, Alvaro Arenas
-
Functional Elimination of Φ-instructions
Abstract We present a functional analogue of the elimination of Φ-instructions from Static Single Assignment (SSA) code. Extending earlier work on the relationship between SSA and functional languages we show that transformations from A-normal form...
2007 / Lennart Beringer -
Propositional Statecharts for Agent Interaction Protocols
Abstract Current representations of interaction protocols either concentrate on ease of understanding and neglect the need to specify protocols unambiguously (e.g. [B. Bauer, J.P. Muller, J.Odell, Agent UML: A Formalism for Specifying Multiagent...
2005 / H.R. Dunn-Davies, R.J. Cunningham, S. Paurobally -
Maude's Internal Strategies
Abstract Maude is a reflective language supporting both rewriting logic and membership equational logic. Reflection is systematically exploited in Maude, endowing the language with powerful metaprogramming capabilities, including declarative...
2005 / Francisco Durán -
Asynchronous Components with Futures: Semantics and Proofs in Isabelle/HOL
Abstract Components provide an easy to use programming paradigm allowing for better re-usability of application code. In the context of distributed programming, autonomous hierarchical components provide a simple model for creating efficient...
2010 / Ludovic Henrio, Muhammad Uzair Khan -
Checking Equivalence for Reo Networks
Abstract Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of the components by means of a network of channels. This paper ...
2008 / Tobias Blechmann, Christel Baier -
Monoidal Indeterminates and Categories of Possible Worlds
Abstract Given any symmetric monoidal category C, a small symmetric monoidal category Σ and a strong monoidal functor j : Σ → C ...
2009 / C. Hermida, R.D. Tennent -
A Novel Adaptive Bio-Inspired Clustered Routing for MANET
Abstract MANET (Mobile Ad-hoc Network) is a mobile multi-hop wireless self-organized distributed ad-hoc network thatdoes not require the basic internal construction. Routing in MANET is a challenging problem which draws researcher's vision, due to...
2012 / K.G. Santhiya, N. Arumugam