Computer and information sciences topic list of research papers
-
A study of an adaptive replication framework for orchestrated composite web services2013 / Marwa F Mohamed, Hany F ElYamany, Hamed M Nassar
-
Living with Paradoxes
Abstract A good knowledge representation system has to find a balance between expressive power on the one hand and efficient reasoning on the other. Furthermore it is necessary to understand its limitations and problems. A logic which contains...
2005 / Manfred Kerber -
A State Space Distribution Policy Based on Abstract Interpretation
Abstract We aim at improving the performance of distributed algorithms for model checking and state space reduction. To this end, we introduce a new distribution policy of states over workers. This policy reduces the number of transitions between...
2005 / Simona Orzan, Jaco van de Pol, Miguel Valero Espada -
Modelchecking Correctness of Refactorings - Some Experiments
Abstract Refactorings are changes made to programs, models or specifications with the intention of improving their structure and thus making them clearer, more readable and re-usable. Refactorings are required to be behaviour-preserving in that the...
2007 / H.-Christian Estler, Thomas Ruhroth, Heike Wehrheim -
Verification of Quantum Protocols with a Probabilistic Model-Checker
Abstract Channel modeling is crucial for studying the behavior of quantum channels in order to build an efficient error correction scheme in addition to security verification of different protocols. While most current analyses of quantum protocols...
2011 / Amir M. Tavala, Soroosh Nazem, Ali A. Babaei-Brojeny -
μ-Calculus Model Checking in Maude
Abstract In this paper, a rewrite theory for checking μ-calculus properties is developed. We use the same framework proposed in [Steven Eker, José Meseguer, and Ambarish Sridharanarayanan. The Maude LTL model checker. In Proceedings of the Fourth...
2005 / Bow-Yaw Wang -
Computerizing Mathematical Text with MathLang
Abstract Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangement of black marks on paper, while at the other end there are...
2008 / Fairouz Kamareddine, J.B. Wells -
Machine-Verifiable Responsiveness
Abstract Individual components in an inter-operating system will require assurance both of appropriate functionality and of responsiveness from other components. We have developed properties which capture the notion of non-blocking responsive...
2006 / J.N. Reed, A.W. Roscoe, J.E. Sinclair -
A Diagrammatic Logic for Object-Oriented Visual Modeling
Abstract Formal generalized sketches is a graph-based specification format that borrows its main ideas from categorical and ordinary first-order logic, and adapts them to software engineering needs. In the engineering jargon, it is a modeling...
2008 / Zinovy Diskin, Uwe Wolter -
Propositional Games with Explicit Strategies
Abstract This paper introduces a game-theoretic semantics for LP, Artemov's Logic of Proofs, taking the viewpoint that LP is a logic of explicit strategies on propositional verification games. To demonstrate the utility of this viewpoint, we define...
2006 / Bryan Renne -
Towards Syntax-Aware Editors for Visual Languages
Abstract Editors for visual languages should provide a user-friendly environment supporting end users in the composition of visual sentences in an effective way. Syntax-aware editors are a class of editors that prompt users into writing...
2005 / Gennaro Costagliola, Vincenzo Deufemia, Giuseppe Polese -
Speeding up Polyhedral Analysis by Identifying Common Constraints
Abstract Sets of linear inequalities are an expressive reasoning tool for approximating the reachable states of a program. However, the most precise way to join two states is to calculate the convex hull of the two polyhedra that are represented by...
2010 / Axel Simon -
The Traveling Salesman Problem in Circulant Weighted Graphs With Two Stripes
Abstract The Symmetric Circulant Traveling Salesman Problem asks for the minimum cost of a Hamiltonian cycle in a circulant weighted undirected graph. The computational complexity of this problem is not known. Just a constructive upper bound, and a...
2007 / Federico Greco, Ivan Gerace -
A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine
Abstract We investigate the possibility of performing new reduction strategies with the Geometry of Interaction Machine (GOIm). To this purpose, we appeal to Lévy's labelled lambda calculus whose labels describe: a) the path that the GOIm will...
2007 / Nikolaos Siafakas -
Preface2005 / Pierpaolo Degano, Luca Viganò
-
A Case Study in Parallel Verification of Component-Based Systems
Abstract In large component-based systems, the applicability of formal verification techniques to check interaction correctness among components is becoming challenging due to the concurrency of a large number of components. In our approach, we...
2008 / N. Beneš, I. Černá, J. Sochor, P. Vařeková, B. Zimmerova -
Contorsion: A Semantic XPath Processor
Abstract This work describes the architecture of Contorsion, a semantic XPath processor that acts over an RDF mapping of XML. It contributes to a recent research trend that defines an XML-to-RDF mapping allowing XML documents interoperate at the...
2006 / Rubén Tous, Jaime Delgado -
A Logical Framework with Explicit Conversions
Abstract The type theory λP corresponds to the logical framework LF. In this paper we present λH, a variant of λP where convertibility is not implemented by means of the customary conversion rule, but instead type conversions are made explicit in...
2008 / Herman Geuvers, Freek Wiedijk -
Preface2009 / Christel Baier, Alessandra di Pierro
-
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
Abstract We present an observational semantics for λ ( fut ) , a concurrent λ-calculus with reference cells and futures. The...
2007 / Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer