Computer and information sciences topic list of research papers
-
Automatic Modulation Recognition Using Wavelet Transform and Neural Networks in Wireless Systems2010 / K Hassan, I Dayoub, W Hamouda, M Berbineau
-
MIP models for connected facility location: A theoretical and computational study
Abstract This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines facility location and Steiner trees: given a set of...
2010 / Stefan Gollowitzer, Ivana Ljubić -
Parallel processing of large graphs
Abstract More and more large data collections are gathered worldwide in various IT systems. Many of them possess a networked nature and need to be processed and analysed as graph structures. Due to their size they very often require the usage of a...
2013 / Tomasz Kajdanowicz, Przemyslaw Kazienko, Wojciech Indyk -
Runtime Verification of Concurrent Haskell Programs
Abstract In this article we use model checking techniques to debug Concurrent Haskell programs. LTL formulas specifying assertions or other properties are verified at runtime. If a run which falsifies a formula is detected, the debugger emits a...
2005 / Volker Stolz, Frank Huch -
EClean - An Embedded Functional Language
Abstract C++ template metaprogramming is often regarded as a functional language, however, nowadays metaprogram libraries are not implemented in functional programming style. In this paper we discuss a compile-time graph-rewriting engine based on...
2009 / Ádám Sipos, Viktória Zsók -
On Type Inference in the Intersection Type Discipline
Abstract We introduce a new unification procedure for the type inference problem in the intersection type discipline. We show that unification exactly corresponds to reduction in an extended λ-calculus, where one never erases arguments that would be ...
2005 / Gérard Boudol, Pascal Zimmer -
Compositional Operational Semantics of a UML-Kernel-Model Language
Abstract We define a compositional operational semantics for state machines and their composition in UML. Each state machine describes the behavior of an object of a class. If a class of a newly generated object is active, a new activity group,...
2006 / Harald Fecher, Marcel Kyas, Willem-Paul de Roever, Frank S. de Boer -
Types for Access Control in a Calculus of Mobile Resources
Abstract This paper presents a type system for the calculus of Mobile Resources (MR) proposed by Godskesen et al. The type system is able to prevent undesirable border-crossing behaviour such as Trojan horses. This is achieved by combining the...
2007 / Hans Hüttel, Morten Kühnrich -
Dynamic Evaluation Tree for Presenting Expression Evaluations Visually
Abstract Novice programmers have difficulties with their visual attention strategies when following program visualizations. This article presents work in progress on improving the user interfaces of visualization tools to support students in the...
2009 / Essi Lahtinen, Tuukka Ahoniemi -
Reasoning about B+ Trees with Operational Semantics and Separation Logic
Abstract The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, probably, computing in general. In this paper, we apply two...
2008 / Alan Sexton, Hayo Thielecke -
Preface2006 / Farhad Arbab, Marjan Sirjani
-
Towards an Integrated View on Architecture and its Evolution
Abstract Information about the evolution of a software architecture can be found in the source basis of a project and in the release history data such as modification and problem reports. Existing approaches deal with these two data sources...
2005 / Martin Pinzger, Harald Gall, Michael Fischer -
Reusable Idioms and Patterns in Graph Transformation Languages
Abstract Software engineering tools based on Graph Transformation techniques are becoming available, but their practical applicability is somewhat reduced by the lack of idioms and design patterns. Idioms and design patterns provide prototypical...
2005 / Aditya Agrawal, Attila Vizhanyo, Zsolt Kalmar, Feng Shi, Anantha Narayanan, et al. -
Using Verified Data-Flow Analysis-based Optimizations in Attribute Grammars
Abstract Building verified compilers is difficult, especially when complex analyses such as type checking or data-flow analysis must be performed. Both the type checking and program optimization communities have developed methods for proving the...
2007 / Eric Van Wyk, Lijesh Krishnan -
A Web Service Architecture for Enforcing Access Control Policies
Abstract Web services represent a challenge and an opportunity for organizations wishing to expose product and services offerings through the Internet. The Web service technology provides an environment in which service providers and consumers can...
2005 / Claudio Agostino Ardagna, Ernesto Damiani, Sabrina De Capitani di Vimercati, Pierangela Samarati -
Rule-based Programming in Java For Protocol Verification
Abstract This paper presents an approach for the development of model-checkers in a framework, called TOM, merging declarative and imperative features. We illustrate our method by specifying in TOM the Needham-Schroeder public-key protocol that aims ...
2005 / Horatiu Cirstea, Pierre-Etienne Moreau, Antoine Reilles -
Connector Rewriting with High-Level Replacement Systems
Abstract Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed from primitive channels with well-defined behavior. These channels are...
2008 / Christian Koehler, Alexander Lazovik, Farhad Arbab -
Reporting Failures in Functional Logic Programs
Abstract Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a deterministic top-level computation) but the evaluation fails...
2007 / Michael Hanus -
Transparent Process Monitoring in a Virtual Environment
Abstract PsycoTrace is a system that integrates static and dynamic tools to protect a process from attacks that alter the process self as specified by the program source code. The static tools build a context-free grammar that describes the...
2009 / Fabrizio Baiardi, Dario Maggiari, Daniele Sgandurra, Francesco Tamberi -
Performance Models For Master/Slave Parallel Programs
Abstract This paper proposes the use of Stochastic Automata Networks (SAN) to develop models that can be efficiently applied to a large class of parallel implementations: master/slave (m/s) programs. We focus our technique in the description of the...
2005 / Lucas Baldo, Leonardo Brenner, Luiz Gustavo Fernandes, Paulo Fernandes, Afonso Sales