Computer and information sciences topic list of research papers
-
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures
Abstract This paper is concerned with learning categorial grammars in the model of Gold. We show that rigid and k-valued non-associative Lambek grammars are learnable from function-argument structured sentences. In fact, function-argument structures ...
2004 / Denis Béchet, Annie Foret -
Research of Genetic Training Algorithm for Identifying Mechanical Failure Modes within the Framework of Case-Based Reasoning
Abstract The combination of case-based reasoning (CBR) and genetic algorithm (GA) is considered in the problem of failure mode identification in aeronautical component failure analysis. Several implementation issues such as matching attributes...
2011 / Yuan-ming XU, Yang ZHANG, Li-na CHEN -
Characters of (relatively) integrable modules over affine Lie superalgebras2015 / Maria Gorelik, Victor G. Kac
-
Towards Weak Bisimulation For Coalgebras
Abstract This paper contains a novel approach to observational equivalence for coalgebras. We describe how to define weak homomorphisms, weak bisimulation, and investigate the connection between them as well as the relation to the known theory of...
2004 / Jan Rothe, Dragan Mašulović -
Semantics for Algebraic Operations
Abstract Given a category C with finite products and a strong monad T on C, we investigate axioms under which an ObC-indexed family of operations of the form α x :(Tx) ...
2004 / Gordon Plotkin, John Power -
The Alamo Execution Monitor Architecture
Abstract Future programming environments will incorporate a tighter coupling between language runtime systems and the monitoring tools that are used to debug, tune, visualize, and understand them. Many innovations that are developed first in higher...
2005 / Clinton L. Jeffery -
Bounded Model Checking for Timed Automata1 1This research was supported by the National Science Foundation under grants CCR-00-82560 and CCR-00-86096.
Abstract Given a timed automaton M, a linear temporal logic formula φ, and a bound k, bounded model checking for timed automata determines if there is a falsifying path of length k to the hypothesis that M satisfies the specification φ. This problem ...
2004 / Maria Sorea -
Symbolic State Exploration
Abstract The exploration of the state space of the model is at the heart of model checking. Symbolic algorithms often use Binary Decision Diagrams for the representation of sets of states, and have to pay attention to the size of the BDDs. We review ...
2004 / Fabio Somenzi -
Preface
Abstract This volume contains the proceedings of the First International Workshop on Symbolic Model Checking (SMC'99), held in Trento, Italy, on July 6, 1999, as part of the Second Federated Logic Conference (FLoC'99). Symbolic...
2005 / Alessandro Cimatti, Orna Grumberg -
Topological Investigations of the Operators of the Well-Founded, and Alternating Fixed-Point Semantics of Normal Logic Programs
Abstract We present a progress report on ongoing work to investigate topologies on spaces of interpretations in which one obtains the continuity of the operators associated with the well-founded, and alternating fixed-point semantics of a normal...
2004 / Roland Heinze -
Tree Morphisms and Bisimulations
Abstract A category of (action labelled) trees is defined that can be used to model unfolding of labelled transition systems and to study behavioural relations over them. In this paper we study five different equivalences based on bisimulation for...
2005 / Rocco De Nicola, Anna Labella -
Flow Logic and Operational Semantics
Abstract Flow logic is a “fast prototyping” approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the flow logic as well as in ...
2005 / Flemming Nielson, Hanne Riis Nielson -
A logical approach to A-Prolog
Abstract It has been recently provided a characterization of Answer Sets by intuitionistic logic as follows: a literal is entailed by a program in the stable model semantics if and only if it belongs to every intuitionistically complete and...
2004 / Mauricio Osorio, Juan Antonio Navarro, José Arrazola -
Languages for Coalgebras on Datafunctors
Abstract We investigate languages to describe coalgebras on datafunctors. First, a syntactical characterization of a given datafunctor F leads to a functional description of the terminal F-coalgebra. It also provides an infinitary modal language ...
2005 / Martin Rößiger -
Subtyping in Logical Form
Abstract By using intersection types and filter models we formulate a theory of types for a λ-calculus with record subtyping via a finitary programming logic. Types are interpreted as spaces of filters over a subset of the language of properties...
2004 / Ugo de'Liguoro -
VOC
Abstract There is a growing awareness, both in industry and academia, of the crucial role of formally proving the correctness of safety-critical components of systems. Most formal verification methods verify the correctness of a high-level...
2004 / Lenore Zuck, Amir Pnueli, Yi Fang, Benjamin Goldberg -
Types, Logic, and Semantics for Nested Databases
Abstract This work presents first steps towards a denotational semantics for relational databases. It is argued that such a semantics will increase the chances of successfully incorporating relational databases into typed programming languages....
2004 / Achim Jung, Hermann Puhlmann -
Aspect and XML-oriented Semantic Framework Generator
Abstract SmartTools is a semantic framework generator, based on XML and object technologies. Thanks to a process of automatic generation from specifications, SmartTools makes it possible to quickly develop environments dedicated to domain-specific...
2004 / Didier Parigot, Carine Courbis, Pascal Degenne, Alexandre Fau, Claude Pasquier, et al. -
A Survey of Rewriting Strategies in Program Transformation Systems
Abstract Program transformation is used in a wide range of applications including compiler construction, optimization, program synthesis, refactoring, software renovation, and reverse engineering. Complex program transformations are achieved through ...
2004 / Eelco Visser -
Foundations for a Combination of Heterogeneous Specification Components
Abstract In this paper, we advocate an approach to combine formal specification components. Our work aims at building or reusing specification components, and compose them with a gluing language constituted of a minimal but sufficient set of...
2004 / Gwen Salaün, Michel Allemand, Christian Attiogbé