Computer and information sciences topic list of research papers
-
Studying provability in implicational intuitionistic logic
Abstract We use an alternative graphical representation for formulas in implicational intuitionistic logic in order to obtain and demonstrate results concerning provability. We demonstrate the adequateness of the method in this area, showing that...
2004 / Sabine Broda, Luís Damas -
Declarative Reflection and its Application as a Pattern Language
Abstract The paper presents the reflection facilities of the specification language Slam-sl. Slam-sl is an object oriented specification language where class methods are specified by pre and postconditions. The reflection capabilities allow managing ...
2004 / A. Herranz, J.J. Moreno, N. Maya -
Scenario Views for Visual Behavior Models in GenGED* *This work is supported by the German-Brazilian Cooperation for Graphical Support of Formal and Semi-Formal Methods for Software Specification and Development (GRAPHIT).
Abstract Visualizing and simulating the behavior of formal models in an adequate and flexible way becomes increasingly important in the design of complex systems. With GenGED, a tool is available which automatically generates a visual environment to ...
2004 / C. Ermel, R. Bardohl -
A CLP framework in Java
Abstract This paper discusses some basic ideas about the implementation of GC, a constraint propagation system, with three different implementations of finite variables domains. As it has been our wish to develop a system that uses the OO approach,...
2005 / Lígia Ferreira, Salvador Abreu -
On proving syntactic properties of CPS programs
Abstract Higher-order program transformations raise new challenges for proving properties of their output, since they resist traditional, first-order proof techniques. In this work, we consider (1) the “one-pass” continuation-passing style (CPS)...
2005 / Olivier Danvy, Belmina Dzafic, Frank Pfennin -
The Ciao Module System: A New Module System for Prolog
Abstract It is now widely accepted that separating programs into modules has proven very useful in program development and maintenance. While many Prolog implementations include useful module systems, we feel that these systems can be improved in a...
2005 / Daniel Cabeza, Manuel Hermenegildo -
ASF+SDF parsing tools applied to ELAN
Abstract This paper describes the development a new ELAN parser using ASF+SDF parsing technology. Asf+Sdf and ELAN are two modern rule-based systems. Both systems have their own features and application domains, however, both formalisms have...
2005 / M.G.J. van den Brand, C. Ringeissen -
The Category of Cpos From a Synthetic Viewpoint
Abstract We provide an internal characterization of the category ω-Cpo of ω-complete posets and ω-continuous functions within the model ℋ of SDT recently introduced by the authors. It follows that ω-cpos lie between the two extreme synthetic notions ...
2005 / Marcelo Fiore, Giuseppe Rosolini -
Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding
Abstract The starting point of this paper is McMillan's complete finite prefix of an unfolding that has been obtained from a Petri net or a process algebra expression. The paper addresses the question of how to obtain the (possibly infinite) system...
2005 / Rom Langerak -
Integrating Computational and Deduction Systems Using OpenMath
Abstract The standard OpenMath is a crucial ingredient for creating an integrated environment combining systems for computer algebra with proof checkers. OpenMath consists of a formal grammar of OpenMath objects, their encodings, Content...
2005 / O. Caprotti, A.M. Cohen -
On the way to certify Computer Algebra Systems
Abstract The FOC project, started at the fall 1997, is aimed to build a programming environment for the development of certified symbolic computation. The working languages are Coq and Ocaml. In this paper, we present first the motivations of the...
2005 / S. Boulmé, T. Hardin, D. Hirschkoff, V. Ménissier-Morain, R. Rioboo -
Notes on Coalgebras, Cofibrations and Concurrency
Abstract We consider categories of coalgebras as (co)-fibred over a base category of parameters and analyse categorical constructions in the total category of deterministic and non-deterministic coalgebras.
2005 / Alexander Kurz, Dirk Pattinson -
Modal Logic for Rewriting Theories
Abstract We view models of rewrite theories enriched with observations coalgebraically. This allows us on the one hand to use “off the shelf” logics for coalgebras to specify and, on the other hand, to verify properties of rewriting programs and to...
2005 / Dirk Pattinson -
On the expressiveness of Timed Concurrent Constraint Programming
Abstract We prove that both the synchronous data flow language Lustre restricted to finite value types and the synchronous state oriented language Argos are embedded in the synchronous paradigm Timed Concurrent Constraint (tcc). In fact, for each of ...
2005 / Simone Tini -
XT
Abstract XT bundles existing and newly developed program transformation libraries and tools into an open framework that supports component-based development of program transformations. We discuss the roles of XT's constituents in the development...
2004 / Merijn de Jonge, Eelco Visser, Joost Visser -
Specifying Real-Time Systems in Rewriting Logic
Abstract This work investigates the suitability of rewriting logic as a semantic framework for modeling real-time and hybrid systems. We present a general method to specify and symbolically simulate such systems in rewriting logic and illustrate it...
2004 / Peter Csaba Ölveczky, José Meseguer -
Local Realizability Toposes and a Modal Logic for Computability
Abstract This work is a step toward developing a logic for types and computation that includes both the usual spaces of mathematics and constructions and spaces from logic and domain theory. Using realizability, we investigate a configuration of...
2004 / Steven Awodey, Lars Birkedal, Dana S. Scott -
Heuristic-driven Techniques for Test Case Selection
Abstract We propose an approach to testing that combines formal methods with practical criteria, close to the testing engineer's experience. It can be seen as a framework to evaluate and select test suites using formal methods, assisted by informal...
2004 / J.C. Burguillo, M. Llamas, M.J. Fernández, T. Robles -
The Practice of Cryptographic Protocol Verification
Abstract We present CASRUL, a compiler for cryptographic protocols specifications. Its purpose is to verify the executability of protocols and to translate them into rewrite rules that can be used by several kinds of automatic or semi-automatic...
2004 / Michael Rusinowitch -
A Conceptual and Formal Framework for the Integration of Data Type and Process Modeling Techniques
Abstract A conceptual framework for the integration of data type and process modeling techniques, called integration paradigm, has been presented by the authors in previous papers already. The aim of this paper is to give a short review of this...
2004 / Hartmut Ehrig, Fernando Orejas