Computer and information sciences topic list of research papers
-
Meta-metric Evaluation of E-Commerce-related Metrics
Abstract User-perceived software quality is subjective, and thus difficult to be measured. Its importance however in user-centric, web-based systems such as e-commerce systems is huge. How can one measure the subjective? Metrics are one of the most...
2009 / A. Stefani, M. Xenos -
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
Abstract When modelling a complex system, such as one with distributed functionality, we need to choose an appropriate level of abstraction. When analysing quantitative properties of the system, this abstraction is typically probabilistic, since we...
2008 / Michael J.A. Smith -
Random Continuous Functions
Abstract We investigate notions of algorithmic randomness in the space C ( 2 N ...
2007 / Paul Brodhead, Douglas Cenzer, Jeffrey B. Remmel -
Modelling the Security of Smart Cards by Hard and Soft Types for Higher-Order Mobile Embedded Resources
Abstract We provide a type system inspired by affine intuitionistic logic for the calculus of Higher-Order Mobile Embedded Resources (Homer), resulting in the first process calculus combining affine linear (non-copyable) and non-linear (copyable)...
2007 / Mikkel Bundgaard, Thomas Hildebrandt, Jens Chr. Godskesen -
OOPS: An S5n Prover for Educational Settings
Abstract We present OOPS, an open source, cross-platform, easy-to-run tableau prover for S5n . OOPS is aimed at education in modal logics. Thus, it has several features that enable insight into its internal workings....
2010 / Gert van Valkenhoef, Elske van der Vaart, Rineke Verbrugge -
Decision Trees of Algorithms and a Semivaluation to Measure Their Distance
Abstract We use the set T n of binary trees with n leaves to study decision trees of algorithms. The set ...
2006 / M. O' Keeffe, H. Pajoohesh, M. Schellekens -
An Asymptotic Approach for Testing P0-Matrices
Abstract A direct approach to the P-matrix or P 0-matrix problem is to evaluate all the principal minors of matrix A using standard numerical linear algebra techniques with O ( ...
2009 / Lei Li, Koya Hattori -
Automated Security Protocol Analysis With the AVISPA Tool
Abstract The AVISPA Tool is a push-button tool for the Automated Validation of Internet Security Protocols and Applications. It provides a modular and expressive formal language for specifying protocols and their security properties, and integrates...
2006 / Luca Viganò -
Semantics of UML 2.0 Interactions with Variabilities
Abstract Means for the representation of variability in UML 2.0 interactions, as presented in a previous work, are further formalised and given a mathematically formal semantics. In this way, UML 2.0 interactions can be used in the conception and...
2006 / María Victoria Cengarle, Peter Graubmann, Stefan Wagner -
Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM
Abstract WS-CDL is a choreography language that describes peer-to-peer collaborations of participants by defining their common and complementary observable behaviors from a global viewpoint. The main use of a choreography description is to precisely ...
2009 / Samira Tasharofi, Marjan Sirjani -
Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes
Abstract Logical characterizations of nondeterministic, probabilistic, and Markovian variants of bisimulation equivalence rely on similar modal languages, each including true, negation, conjunction, and diamond. Likewise, logical characterizations...
2009 / Marco Bernardo -
Integrated Java Bytecode Verification
Abstract Existing Java verifiers perform an iterative data-flow analysis to discover the unambiguous type of values stored on the stack or in registers. Our novel verification algorithm uses abstract interpretation to obtain definition/use...
2005 / Andreas Gal, Christian W. Probst, Michael Franz -
A Certifying Code Generation Phase
Abstract Guaranteeing correctness of compilation is a vital precondition for correct software. Code generation can be one of the most error-prone tasks in a compiler. One way to achieve trusted compilation is certifying compilation. A certifying...
2007 / Jan Olaf Blech, Arnd Poetzsch-Heffter -
An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models
Abstract The notion of the least fixed-point of an operator is widely applied in computer science as, for instance, in the context of query languages for relational databases. Some extensions of first-order classical logic (FOL) with fixed-point...
2008 / Alexandre Matos Arruda, Ana Teresa Martins -
Trace-based Derivation of a Lock-Free Queue Algorithm
Abstract Lock-free algorithms have been developed to avoid various problems associated with using locks to control access to shared data structures. Instead of preventing interference between processes using mutual exclusion, lock-free algorithms...
2008 / Lindsay Groves -
Compositionality for Tightly Coupled Systems: A New Application of the Propositions-as-Types Interpretation
Abstract The design of complex software systems fundamentally relies on the understanding of abstract components and their interactions. Although compositional techniques are being successfully employed in practice, the use of such techniques is...
2006 / Mark-Oliver Stehr -
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
Abstract We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a...
2006 / Lars Birkedal, Rasmus E. Møgelberg, Rasmus L. Petersen -
A Probabilistic Reputation Algorithm for Decentralized Multi-Agent Environments
Abstract The importance of trust in electronic transactions is well understood. The majority of current trust models consist of a central entity that verifies compliance with the trust requirements, using standardized evaluation methods and...
2009 / Mozhgan Tavakolifard, Svein J. Knapskog -
Compositionality of Statically Scheduled IP
Abstract Timing Closure in presence of long global wire interconnects is one of the main current issues in System-on-Chip design. One proposed solution to the Timing Closure problem is Latency-Insensitive Design (LID) [Luca Carloni, Kenneth...
2008 / Julien Boucaron, Jean-Vivien Millo -
Autowrite: A Tool for Term Rewrite Systems and Tree Automata
Abstract Autowrite is an experimental software tool written in Common Lisp Oriented System (CLOS) which handles term rewrite systems and bottom-up tree automata. A graphical interface written using McCLIM, (the free...
2005 / Irène Durand