Computer and information sciences topic list of research papers
-
Local directional denoising2005 / S.C. Olhede, A.T. Walden
-
A space-time channel estimator and single-user receiver for code-reuse ds-cdma systems2003 / A. Manikas, M. Sethi
-
Temporal Induction by Incremental SAT Solving
Abstract We show how a very modest modification to a typical modern SAT-solver enables it to solve a series of related SAT-instances efficiently. We apply this idea to checking safety properties by means of temporal induction, a technique strongly...
2005 / Niklas Eén, Niklas Sörensson -
Formal Topology and Domains
Abstract The theme of this paper is the relation between formal topology and the theory of domains. On one hand, domain theory can be seen as a branch of formal topology. On the other hand, the influence of domain theory on formal topology is...
2005 / Giovanni Sambin -
Joyal's arithmetic universes via type theory
Abstract André Joyal constructed arithmetic universes to provide a categorical proof of Gödel incompleteness results. He built them in three stages: he first took a Skolem theory, then the category of its predicates and finally he made the exact...
2004 / Maria Emilia Maietti -
Formalizing and testing the consistency of DSL transformations2016 / Sarmen Keshishzadeh, Arjan J. Mooij
-
A Calculus of Terms for Coalgebras of Polynomial Functors
Abstract A syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is developed, extending earlier work [4] on monomial coalgebras to include functors constructed using coproducts. A modified ultrapower construction...
2004 / Robert Goldblatt -
Operational Techniques in PVS — A Preliminary Evaluation
Abstract In this paper we present a preliminary analysis of the suitability of using PVS as a tool for developing operational semantics and programming logics in a semi-automatic fashion. To this end we present a formalized proof of the...
2004 / Jonathan M. Ford, Ian A. Mason -
Tactics and Parameters
Abstract In this paper we discuss the problem of internalizing the meta-level transformations between (representations of) incomplete proofs and terms in a theorem prover based on Type Theory. These transformations (usually referred to as tactics)...
2004 / Gueorgui Jojgov -
Formal Methods:
Abstract The paper defines formal methods (FMs) and describes economic issues involved in their application. From these considerations and the concepts implicit in “No Silver Bullet”, it becomes clear that FMs are best applied during requirements...
2004 / Daniel M. Berry -
Concurrent Semantics for the π-calculus1 1Work supported in part by Esprit Basic Research project CONFER and working group COMPUGRAPH II and by Progetto Speciale CNR “Specifica ad Alto Livelloe Verifica Formale di Sistemi Digitali”.
Abstract In this paper we give both operational and abstract concurrent semantics for the π-calculus (a process algebra with the ability of handling channels as messages [23]) and discuss their consistency. For the operational semantics [15,6];, for ...
2004 / Ugo Montanari, Marco Pistore -
On sparseness and Turing reducibility over the reals
Abstract We prove some results about existence of NP-complete and NP-hard (for Turing reductions) sparse sets on different settings over the real numbers.
2004 / Felipe Cucker -
Defining Standard Prolog in Rewriting Logic
Abstract The coincidence between the model-theoretic and the procedural semantics of SLD-resolution does not carry over to a Prolog system that also implements non-logical features like cut and whose depth-first search strategy is incomplete. The...
2005 / M. Kulaš, C. Beierle -
Vague Domains, S-Unification and Logic Programming
Abstract The purpose of this paper is to give some insights to the use of vague (fuzzy) constants and similarity in logic programming. The basis of semantics for Similarity based Logic Programming (SbLP) is presented. S-unification, or similarity...
2004 / Harry E. Virtanen -
Zeus: A Distributed Timed Model-Checker Based on Kronos
Abstract In this work we present Zeus, a Distributed Model-Checker that evolves from the tool Kronos [8] and that currently can handle backwards computation of TCTL-reachability properties [1] over timed-automata [2]. Zeus was...
2005 / V. Braberman, A. Olivero, F. Schapachnik -
Test Set Coinduction -- Toward Automated Verification of Behavioural Properties —
Abstract Coinduction (co-induction) is considered to be a standard method for verifications of behavioural properties. However, users have to find a candidate for behavioural congruence relation (hidden congruence) for using coinducion. For...
2005 / Michihiro Matsumoto, Kokichi Futatsugi -
Symbolic simulation of synchronous programs
Abstract This paper proposes an intermediate approach between simulation and formal verification. This method called symbolic simulation allows to simulate a reactive program by giving it the set of its possible inputs. An important aspect of this...
2005 / David Garriou -
Rewriting Semantics of Meta-Objects and Composable Distributed Services1 1Supported by DARPA through Rome Laboratories Contract F30602-97-C-0312, by DARPA and NASA through Contract NAS2-98073, by Office of Naval Research Contract N00014-99-C-0198, and by National Science Foundation Grants CCR-9505960 and CCR-9633363, and CCR-9900334.
Abstract Communication between distributed objects may have to be protected against random failures and malicious attacks; also, communication timeliness may be essential or highly desired. Therefore, a distributed application often has to be...
2005 / G. Denker, J. Meseguer, C. Talcott -
Constraints, Adjunctions and (Co)algebras
Abstract The connection between constraints and universal algebra has been looked at in, e.g., Jeavons, Cohen and Pearson, 1998, and has given interesting results. Since the connection between universal algebra and category theory is so obvious, we...
2005 / Ola Angelsmark -
ILOG JViews Graph Layout: a Java library for highly demanding graph-based applications
Abstract We present the Graph Layout module of the ILOG J Views Component Suite, which is a set of pure Java components for building sophisticated interactive commercial graph-based user interfaces.
2005 / Georg Sander, Adrian Vasiliu