Computer and information sciences topic list of research papers
-
Test Case Generation by Contract Mutation in Spec#
Abstract Mutation testing is a well known fault-based testing technique that is normally used to assess the quality of a test suite. In this paper we use the mutation operation to derive test cases that demonstrate the absence of certain faults in...
2009 / Willibald Krenn, Bernhard K. Aichernig -
Dataflow Architectures for GALS
Abstract In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on the channels. KPN provides a semantic model of computation,...
2008 / Syed Suhaib, Deepak Mathaikutty, Sandeep Shukla -
Preface2010 / Michael Mislove, Peter Selinger
-
Equational Abstractions for Reducing the State Space of Rewrite Theories
Abstract The combinatorial explosion of state spaces is the biggest problem in applying model checking methods to concurrent systems. In this paper we present a new state-space reduction technique that is tailored to system specifications in...
2009 / Lars Helge Haß, Thomas Noll -
Graphical Calculus for Quantum Key Distribution (Extended Abstract)
Abstract Controlled complementary measurements are key to quantum key distribution protocols, among many other things. We axiomatize controlled complementary measurements within symmetric monoidal categories, which provides them with a corresponding ...
2011 / Bob Coecke, Quanlong Wang, Baoshan Wang, Yongjun Wang, Qiye Zhang -
Semantics-preserving Migration of Semantic Rules During Left Recursion Removal in Attribute Grammars
Abstract Several tools for source-to-source transformation are based on top down parsers. This restricts the user to use grammars without left recursion. Removing left recursion of a given grammar often makes it unreadable, preventing a user from...
2004 / Wolfgang Lohmann, Günter Riedewald, Markus Stoy -
Tinycals: Step by Step Tacticals
Abstract Most of the state-of-the-art proof assistants are based on procedural proof languages, scripts, and rely on LCF tacticals as the primary tool for tactics composition. In this paper we discuss how these ingredients do not interact well with...
2007 / Claudio Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli -
On Products of Transition Systems
Abstract For an arbitrary set endofunctor F we give a sufficient and necessary criterium for the existence of products of F-coalgebras. In the case of transition systems, where F = ...
2008 / Egbert Fohry -
Preface2007 / Daniele Gorla, Catuscia Palamidessi
-
Verification of Random Graph Transformation Systems
Abstract In this paper we describe some statistical results obtained by the verification of random graph transformation systems (GTSs). As a verification technique we use over-approximation of GTSs by Petri nets. Properties we want to verify are...
2007 / Vitali Kozioura -
OclType – A Type or Metatype ?2004 / Stephan Flake
-
Probabilistic Guarded Commands Mechanized in HOL
Abstract The probabilistic guarded-command language pGCL [Carroll Morgan, Annabelle McIver. pGCL: formal reasoning for random algorithms. South African Computer Journal (1999)] contains both demonic and probabilistic nondeterminism, which makes it...
2005 / Joe Hurd, Annabelle McIver, Carroll Morgan -
Deontic Logic, Contrary to Duty Reasoning and Fault Tolerance
Abstract Deontic Logic was introduced in the first half of the last century to formalize aspects of legal reasoning. Since then a lot of effort has gone into improving the formalism(s) and widening their applicability, including in Computer Science...
2009 / Pablo F. Castro, T.S.E. Maibaum -
On the Observable Behaviour of Composite Components
Abstract The crucial strength of the component paradigm lies in the possibility to encapsulate behaviours. In this work, we focus on the observable behaviour of composite components which encapsulate the behaviour of (possibly large) assemblies of...
2009 / Rolf Hennicker, Stephan Janisch, Alexander Knapp -
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings
Abstract The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in which they are interpreted. That, in particular, holds for most...
2010 / Davide Bresolin, Dario Della Monica, Valentin Goranko, Angelo Montanari, Guido Sciavicco -
Algebraic Information Theory For Binary Channels
Abstract We study the algebraic structure of the monoid of binary channels and show that it is dually isomorphic to the interval domain over the unit interval with the operation from [K. Martin. Entropy as a fixed point. ICALP 2004. Theoretical...
2006 / Keye Martin, Ira S. Moskowitz, Gerard Allwein -
Multi-scale 2D tracking of articulated objects using hierarchical spring systems
Abstract This paper presents a flexible framework to build a target-specific, part-based representation for arbitrary articulated or rigid objects. The aim is to successfully track the target object in 2D, through multiple scales and occlusions....
2010 / Nicole M. Artner, Adrian Ion, Walter G. Kropatsch -
The Research of Tax Text Categorization based on Rough Set
Abstract To solve the problem of effective of categorization of text data in taxation system, the paper analyses the text data and the size calculation of key issues first, then designs text categorization based on rough set model. ...
2012 / Bin Liu, Guang Xu, Qian Xu, Nan Zhang -
Design and Implementation of Embedded RFID Middleware
Abstract An embedded RFID (Radio Frequency Identification) middleware based on ARM Linux operating system and S3C2410 hardware platform was designed and implemented. The system architecture and platform of software and hardware of this middleware...
2012 / Li. Zhen-xiang, Zhang Yu-xiang -
To Improve the Interactivity of the History Educational Games with Digital Interactive Storytelling
Abstract DIS and History Educational Games are two important tools in Technology-Enhances Learning for History knowledge that would benefit from their mutual cooperation. On the one hand History Educational Games can help the history courses more...
2012 / Qiulian Song, Ling He, Xiaoqiang Hu