Computer and information sciences topic list of research papers
-
Towards Secure Mobile Multiagent Based Electronic Marketplace Systems
Abstract In this paper we aim at a generic methodology to validate, assess, and construct mobile multi-agent systems in the domain of virtual market places. It rests upon research carried out in the past to develop innovative engineering solutions...
2004 / Klaus Fischer, Dieter Hutter, Matthias Klusch, Werner Stephan -
A graphical approach to monad compositions
Abstract In this paper we show how composite expressions involving natural transformations can be pictorially represented in order to provide graphical proof support for providing monad compositions. Examples are drawn using powerset monads composed ...
2005 / P. Eklund, M.A. Galán, J. Medina, M. Ojeda-Aciego, A. Valverde -
A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424.
Abstract We present a generic scheme for the declarative debugging of functional logic programs which is valid for eager as well as lazy programs. In particular we show that the framework extends naturally some previous work and applies to the most...
2004 / María Alpuente, Franciso Correa, Moreno Falaschi -
Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic1 1Research supported by the MURST Project TOSCA.
Abstract In recent years, logical frameworks and tile logic have been separately proposed by our research groups, respectively in Udine and in Pisa, as suitable metalanguages with higher-order features for encoding and studying nominal calculi. This ...
2004 / Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan -
Towards Symbolic Analysis of Visual Modeling Languages
Abstract Graph transformation has recently become more and more popular as a general, rule-based visual specification paradigm to formally capture the operational semantics of modeling languages based on metamodeling techniques as demonstrated by...
2004 / Dániel Varró -
An Executable Specification of Asynchronous Pi-Calculus Semantics and May Testing in Maude 2.0
Abstract We describe an executable specification of the operational semantics of an asynchronous version of the π-calculus in Maude by means of conditional rewrite rules with rewrites in the conditions. We also present an executable specification of ...
2005 / Prasanna Thati, Koushik Sen, Narciso Martí-Oliet -
Reasoning about efficiency within a probabilistic μ-calculus
Abstract Expectation-based probabilistic predicate transformers [15] provide a logic for probabilistic sequential programs, giving access to expressions such as ‘the probability that predicate A is achieved finally’. Using expectations more...
2005 / A.K. McIver -
Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01).
Abstract We explore how different proof orderings induce different notions of saturation and completeness. We relate completion, paramodulation, saturation, redundancy elimination, and rewrite system reduction to proof orderings. ...
2004 / Nachum Dershowitz -
Geodesic Paths Approach to Color Image Enhancement
Abstract New filter class for multichannel image processing is introduced and analyzed. The new technique of image enhancement is capable of reducing impulsive and Gaussian noise and it significantly outperforms the standard methods of noise...
2004 / M. Szczepanski, B. Smolka, D. Slusarczyk, K.N. Plataniotis, A.N. Venetsanopoulos -
Transforming Application Compositions with XSLTs
Abstract Architectural Description Languages (ADLs) allow developers to describe the architecture of a software system but provide only limited support for their execution. In this paper, we present ACL/1, an XML based Application Composition...
2004 / Johann Oberleitner, Thomas Gschwind -
Building continuous webbed models for system F
Abstract We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the model of Barbanera and Berardi [2], hence it contains complete...
2005 / S. Berardi, C. Berline -
Model-Checking View-Based Partial Specifications
Abstract We develop foundations for the view-based specification of software artifacts in first-order logic. Standard notions of models and semantics of first-order logic are generalized to partial models that do not have access to the entire global ...
2004 / Michael Huth, Shekhar Pradhan -
Non Truth-Functional Many-Valuedness
Abstract Many-valued logics are standardly defined by logical matrices. They are truth-functional. In this paper non truth-functional many-valued semantics are presented, in a philosophical and mathematical perspective.
2004 / Jean-Yves Béziau -
Debugging Prolog Using Annotations
Abstract We present an annotation language well-suited for rendering aspects of Prolog execution. Our annotations are special Prolog goals that act as executable comments, performing debugging at run-time. No restrictions are placed upon the object...
2005 / M. Kulaš -
Preface
Abstract A large class of systems can be specified and verified by abstracting away from the temporal aspects. In time-critical systems, instead, time issues become essential. Their correctness depends not only on which actions a system can perform...
2005 / Walter Vogler, Kim Larsen -
Alice in the Land of Oz An Interoperability-based Implementation of a Functional Language on Top of a Relational Language
Abstract This paper reports practical experience in implementing Alice, an extension of Standard ML, on top of an existing implementation of Oz. This approach yields a high-quality implementation with little effort. The combination is an advanced...
2005 / Leif Kornstaedt -
Refining Specifications to Programmable Logic
Abstract Combined hardware/software systems are increasingly being used for safety-critical systems, with hardware taking processing load off the software. To attain the necessary safety integrity levels, new safety standards require that the...
2005 / Adrian Hiltont, Jon G. Hall -
Proposal to Provide Security in MANET's DSRRouting Protocol
Abstract Mobile Ad-hoc network (MANET) is infrastructure less, self-organizing bandwidth constraint on demand wireless network. MANET is a multi-hop wireless network therefore, needs an efficient routing protocol to transmit data packet from source...
2015 / Milan Kumar Dholey, G.P. Biswas -
Building Interpreters with Rewriting Strategies
Abstract Programming language semantics based on pure rewrite rules suffers from the gap between the rewriting strategy implemented in rewriting engines and the intended evaluation strategy. This paper shows how programmable rewriting strategies can ...
2004 / Eelco Dolstra, Eelco Visser -
An Abstract Module Concept for Graph Transformation Systems1 1This work has been supported by the EEC TMR network GETGRATS (General Theory of Graph Transformation Systems). The complete investigation on this subject is the result of a collaboration with Martin Große–Rhode, Dirk Janssens and Francesco Parisi Presicce
Abstract Graph transformation systems are a well known formal specification technique that support the rule based specification of the dynamic behaviour of systems. Recently, many specification languages for graph transformation systems have been...
2004 / Marta Simeoni