waashk/dblp huggingface dataset:
framework composition conformance via refinement checking. a major challenge related to the composition of software frameworks is to ensure that certain services provided by the frameworks are preserved. since, in general, such a composition might involve heterogeneous frameworks with incompatible interfaces (distinct signatures or protocols), some glue code is usually needed for an integration. naturally, the right design of the glue code is critical because otherwise the composition might exercise the original frameworks only partially, and the original services may malfunction in subtle ways. the notion of conformance of these services does not directly correspond to standard refinement. in this paper, we build on a systematic strategy for framework composition based on the csp process algebra. we propose notions of conformance for behaviour preservation based on failures refinement for csp and show how conformance can be mechanically checked using a csp model checker (fdr).
on to formal semantics for path expression pointcuts. in aspect-oriented programming (aop), the join point selection depends heavily on the context exposed to aspects by means of special pointcut constructs. this context is either local to the join point (e.g. target of method calls) or non-local (e.g. call-stack). path expression pointcut (pep) is a special kind of pointcut that provides aspects with the access to non-local object information. in order to implement pep, a well-defined unambiguous semantics for pep is needed. this paper proposes a denotational semantics for pep, which unambiguously describes the result of evaluating the pep. moreover, it helps to guide future developments of the pep and its integration with aop system.
preeme: preemptive real-time task management for event-driven sensor operating systems. this paper proposes preeme, which is a preemptive realtime task management scheme for event-driven sensor operating systems. by efficiently allocating independent stack space for each task, preeme enables the preemptive task management for the event-driven systems. the size of the minimal stack space for each task is determined at compiletime, and dynamic stack allocation is performed at run-time. simulation results show that preeme significantly reduces scheduling latency with small execution overhead.
selectivity estimation in spatial networks. modern applications requiring spatial network processing pose many interesting query optimization challenges. in many cases, query processing depends on the corresponding graph size (number of nodes and edges) and other graph parameters. in this paper, we present novel methods to estimate the number of nodes in regions of interest in spatial networks, towards predicting the space and time requirements of range queries. we examine all methods by using real-life and synthetic spatial networks. experimental results show that the number of nodes can be estimated efficiently and accurately with small space requirements, thus providing useful information to the query optimizer.
requirements engineering process improvement: a knowledge transfer experience. in the last decade, research in requirements engineering has achieved great advances. several methods, techniques and processes have been proposed in the literature. however, the pace of requirements engineering technology transfer has been slow. this paper presents a technology transfer project to improve the requirements engineering process in four software companies. we discuss this experience from the perspective of researchers and practitioners from one participating company.
evaluating the partial deployment of an as-level ip traceback system. distributed denial of service (ddos) attacks currently represent a serious threat to the appropriate operation of internet services. we propose an ip traceback system to be deployed at the level of autonomous systems (ases) to deal with this threat. our proposed as-level ip traceback system contrasts with previous work as it requires a priori no knowledge of the network topology while allowing single packet traceback and incremental deployment. we also investigate and evaluate the strategic placement of our systems, showing that the partial deployment offered by our proposed system provides relevant results in ip traceback, rendering it feasible for large-scale networks such as the internet.
context addressing using context-aware flooding. due to the proliferation of small networked mobile devices, the number of (indirectly) interconnected services in pervasive computing environments may grow without bound. the network contains a potentially enormous amount of context aware services that sense, gather and distribute context information. without a central context repository, or a central server that locates the context information, it is a challenge to address parts of the environment that contain relevant context information. in this paper, we propose a model for addressing context and an algorithm for context gathering and distribution that imposes a virtual structure on the network, that aligns with the actual context information within a pervasive computing environment. distribution of context uses an adapted form of flooding, that is context aware. our evaluation shows that the algorithm performs substantially better than bounded flooding, if address accuracy is at least 30%.
special track on information access and retrieval: editorial message. there is a growing need to access and retrieve relevant information across media, across languages and across modalities. the research context concerning information access and retrieval aims at modelling, designing and implementing systems able to provide a fast and effective content-based access to a large amount of multimedia information. the aim of such systems is to estimate the relevance of documents to a user information need. this is a very hard and complex task due to several distinct reasons that a large volume of research has attempted to analyse and tackle. information retrieval (ir) can be considered as the first historical research area aimed at defining systems for the automatic access to huge amounts of information (together with dbmss whose main aim is to manage and access huge amounts of data).
decentralized coordination strategies for the vehicle routing problem. modern software control systems must cope with uncertainty, manage dynamic environments, as well as provide greater flexibility. distributed agent-based control systems are the ideal candidates to manage such dynamic and unpredictable application domains, like transportation systems. this paper shows how to implement a decentralized decision strategy, based on an extended version of the probability collective (pc) framework.
isometry group, words and proofs of geometric theorems. this paper shows that considering the group generated by orthogonal symmetries relatively to lines may give very short and readable proofs of geometric theorems. a short and readable proof of the fundamental pascal's theorem is provided for illustration.
on the control of adaptation in ubiquitous computing. a core subclass of ubiquitous computing (ubicomp) applications comprises those that are context-aware, which adapt their behavior to the prevailing resource availability levels aiming to optimize and enrich user-environment interactions and to reduce the demand for user intervention. the problem of adaptation control is related to the orchestration of adaptations carried out by concurrent applications. in this process, the adaptation controller needs to promote system stability and should consider other desirable properties: resource consumption, reactiveness etc. in this paper we introduce actus, an on-going proposal of generic framework for building adaptation controllers targeting ubicomp.
privacy preservation services: challenges and solutions. the current internet architecture was designed at a time when many of the current network applications did not even exist. as a result, it has become increasingly difficult to deploy new and secure services on the internet. hence, a new internet architecture is required to address the security and usability issues that affect the current internet. in this paper, we examine the current internet architecture from various security and user perspectives using two privacy services and propose some architectural guidelines and principles for the future internet architecture. the two aforementioned privacy services that we chose are: i) anonymous communication services and ii) identity management systems. we examine the challenges in implementing anonymous communication services, and identity management systems and identify the problems with existing solutions for these challenges. based on the problems identified in the current internet architecture, we propose a virtualization-motivated set of architectural principles and design rules for the future internet.
enterprise ontology in enterprise engineering. originating from quite different fields of theory and practice, the terms "enterprise ontology" and "enterprise architecture" currently belong to the standard vocabulary of those professionals who are concerned with (re) designing and (re) engineering enterprises, thereby exploiting modern information and communication technologies for innovating products and services as well as for optimizing operational performance. because of the inherent characteristics of modern enterprises, often operating within networks of cooperating enterprises, the task of these professionals can rightly be characterized as having to master unprecedented high complexity. the statement, put forward in the paper, that the current notion of enterprise ontology does not offer satisfactory help and thus needs to evolve into an effective conceptual tool, is clarified in a historical context. a standard is recently set by demo (design and engineering methodology for organizations). in this methodology, enterprise ontology is conceptually defined as the implementation independent essence of an enterprise, understood from a holistic systemic point of view. operationally, it consists of a complete, consistent and coherent set of ontological aspect models, by which a reductio of complexity is achieved of well over 90%. the new, evolved notion of enterprise ontology is clarified and illustrated using a case example.
mining disease-specific molecular association profiles from biomedical literature: a case study. we developed a new literature mining paradigm with the ultimate goal of enabling knowledge discovery in molecular association profiles generated from literature and prior knowledge. we show how to implement the paradigm by building a prototype literature mining framework and performing molecule-biogist association mining. the framework consists of two modules. the first module, textual data mining, takes the synonym-expanded disease-related molecule names and outputs a list of biogist list. the second module, structured data mining, takes two inputs, initial disease-related molecular query terms and extracted biogist list from the first module, and outputs a molecule-biogist association matrix. our approach is novel because biomedical literature mining is used here not only as an "information retrieval" tool, but also as a "hypothesis generation and validation" platform. we applied the framework to a molecular pharmacology study of breast cancer. based on 214 breast cancer-related proteins, 429,067 medline abstracts were retrieved, and 4,491 drug compounds were identified as biogists. we evaluated 172 hydrocarbons in the above biogist list, and found that more than 82.5% hydrocarbons were verified to be related to breast cancer. brca1 and brca2 were found to have similar profiles in drug compound studies, whereas "doxorubicin", "etoposide", and "paclitaxel" were identified to have similar pharmacological profiles to treat breast cancer.
using adaptive distinguishing sequences in checking sequence constructions. a number of methods have been published to construct checking sequences for testing from finite state machine-based specifications. many of these methods require the existence of a preset distinguishing sequence in the model. in this paper, we show that usually an adaptive distinguishing sequence is sufficient for these methods to work. this result is significant because adaptive distinguishing sequences are strictly more common and up to exponentially shorter than preset ones.
autonomic trust reasoning enables misbehavior detection in olsr. ad hoc networks do not rely on any centralized administration or fixed network infrastructure and their nodes establish a routing structure in a self-organized way, by means of an ad hoc routing protocol such as olsr. ad hoc route discovery and maintenance introduce specific security problems for routing protocols to prevent, detect or respond. solutions to secure these routing protocols using some centralized units or trusted third-parties actually constrain the self-organization of ad hoc networks. in this paper, we propose for olsr the integration of trust reasonings into each node behavior, so as to allow a self-organized trust-based control to help nodes to detect misbehavior attacks. our analysis of olsr brings out the trust rules that characterize this protocol and allows us to express formally the trust-related properties that can be verified by each node to assess the correct behavior of the other nodes. simulation of olsr with nodes reasoning on trust allows us to demonstrate the effectiveness of our approach and to compare trust-based routing choices with the bare olsr reachability-based choices.
implementing secure document circulation: a prototype. interoperable e-business applications are essential for increasing efficiency in the digital economy. we present an infrastructure based on our secure document circulation architecture model, designed for securing information flow for interorganisational workflows. we view this initial prototype as simply a proof-of-concept, and plug in various software tools to implement the prototype components. a simple example, based on a loan application workflow, is discussed to indicate the potential of this work.
special track on document engineering: editorial message. document engineering is a discipline within computer science that investigates systems for documents in any form and in all media. document engineering is concerned with principles, tools and processes that improve our ability to create, manage, store, compact, access, and maintain documents. the fields of document recognition and retrieval have grown rapidly in recent years. this development has been fueled by the emergence of new application areas such as the world wide web (www), digital libraries, and video- and camera-based ocr. the use of ocr is spreading from high-volume, niche domains to more general tasks, including the processing of noisy "real-world" documents, photocopies, and faxes.
introducing self-adaptability into transaction processing. in a database system, the scheduler has the goal of synchronizing operations belonging to several concurrent transactions. in order to achieve its goal, the scheduler implements a concurrency control protocol, which may have either conservative or aggressive behavior. this paper presents a self-adaptable scheduler, called intelligent transaction scheduler (its), which has the ability of dynamically changing its behavior (from conservative to aggressive and vice-versa) to adapt itself to the characteristics of the computing environment (e.g., the aborted transaction rate and conflicting operation rate). the proposed scheduler adapts its behavior without any human interference by using an expert system based on fuzzy logic. in order to evaluate its, it was applied in a mobile database community (mdbc). an mdbc can be characterized as a dynamically configurable environment, since an mdbc is a dynamic collection of autonomous mobile databases, interconnected through a mobile ad hoc network (manet). therefore, self-adaptability plays a key role for schedulers running in dynamically configurable environments. the experimentation results show the efficiency of its for synchronizing transactions in mdbcs
removing useless variables in cost analysis of java bytecode. automatic cost analysis has interesting applications in the context of verification and certification of mobile code. for instance, the code receiver can use cost information in order to decide whether to reject mobile code which has too large cost requirements in terms of computing resources (in time and/or space) or billable events (smss sent, bandwidth required). existing cost analyses for a variety of languages describe the resource consumption of programs by means of cost equation systems (cess), which are similar to, but more general than recurrence equations. cess express the cost of a program in terms of the size of its input data. in a further step, a closed form (i.e., non-recursive) solution or upper bound can sometimes be found by using existing computer algebra systems (cass), such as maple and mathematica. in this work, we focus on cost analysis of java bytecode, a language which is widely used in the context of mobile code and we study the problem of identifying variables which are useless in the sense that they do not affect the execution cost and therefore can be ignored by cost analysis. we identify two classes of useless variables and propose automatic analysis techniques to detect them. the first class corresponds to stack variables that can be replaced by program variables or constant values. the second class corresponds to variables whose value is cost-irrelevant, i.e., does not affect the cost of the program. we propose an algorithm, inspired in static slicing which safely identifies cost-irrelevant variables. the benefits of eliminating useless variables are two-fold: (1) cost analysis without useless variables can be more efficient and (2) resulting cess are more likely to be solvable by existing cass.
profile based comparative analysis for aose methodologies evaluation. this study focuses on the analysis and evaluation of agent-oriented methodologies. different studies have been proposed for the evaluation of agent-oriented methodologies adopting specifics types of evaluation and criteria. the present work proposes to adopt the profile analysis technique for comparing evaluations carried out by different authors (perhaps using different evaluation frameworks) with the aim of improving the acceptability of agent-oriented methodologies evaluation in the agent community. to exemplify the proposal, we present the application of the profile analysis technique on a case study.
special track on multimedia and visualization track: editorial message. the multimedia and visualization (mmv) track has been a popular track because of its appeal for the current trends in daily life applications. visualization is the key to comprehending the continuously changing complex phenomena around us. multimedia combines information from local and remote sources. the users may view this information on on-demand basis. there are many issues associated with this: data manipulation, display, motion, security etc. this track attracts investigators from pure research to applications in wide variety of areas. some of the papers included were: consistency checking and temporal relations, digital watermarking, digital ink, multimedia information representation, rule based visualization techniques, scientific visualization with genetic algorithms, security, video indexing, video on demand, volume visualization, visualization techniques for data mining and surface modeling.
using formal methods to develop a complex information system: a practical/theoretical experience. in this paper we apply a new model to formally represent complex information systems. we show how this formalism, based on finite state machines, has been used as the basis to develop a real information system. this exercise convinced us that a formal approach to develop complex systems can facilitate some of the development phases.
message from the software engineering track chairs: editorial. welcome to the software engineering track of acm sac 2008 -- the 23nd annual acm symposium on applied computing. this year we have a special focus on "emerging techniques for dependable software development". the objective is to provide researchers and practitioners with an embedded forum for presenting and discussing their ideas and experiences with technologies, theories, and tools used for producing highly dependable software more efficiently asnd effectively. the software engineering track is big enough to represent major topics in software engineering, but also small enough to provide an in-depth representation of theory and practice in these areas. it provides an opportunity for academic researchers and industry participants to share their ideas and practices. it not only allows the software engineering academic community to understand the areas that are vital to the software industry, but it also gives software engineering practitioners an opportunity to express their needs.
control of system calls from outside of virtual machines. a virtual machine monitor (vmm) can isolate virtual machines (vms) for trusted programs from vms for untrusted ones. the security of vms for untrusted programs can be enhanced by monitoring and controlling the behavior of the vms with security systems running in a vm for trusted programs. however, programs running outside of a monitored vm usually obtain only low-level events and states such as interrupts and register values. therefore, it is not straight-forward for the programs to understand the high-level behavior of an operating system in a monitored vm and to control resources managed by the operating system. in this paper, we propose a security system that controls the execution of processes from the outside of vms. it consists of a modified vmm and a program running in a trusted vm. the system intercepts system calls invoked in a monitored vm and controls the execution according to a security policy. to fill the semantic gap between low-level events and high-level behavior, the system uses knowledge of the structure of a given operating system kernel. the user creates the knowledge with a tool when building an operating system. we implemented the system using xen, and measured the overhead through experiments using microbenchmarks and a benchmark for the apache web server.
a model-based semi-quantitative approach for evaluating security of enterprise networks. a challenging issue in enterprise risk management (erm) is to quantify network attributes with respect to security. this paper presents a model-based semi-quantitative approach for evaluating the security of enterprise networks. instead of focusing on particular attacks/intrusions, our approach aims at characterizing attacker behaviors by examining attacker intent, objective, and attack consequence, which are essential for enforcing an attack scheme. in particular, an attack scheme involving several atomic attacks is formulated as a partially observable markov decision process: a goal-directed attacker takes a sequence of actions to achieve the malicious goal, and a reward signal is used as feedback to integrate the attacker's intent, cost and objective and guides its advances. it is also used to measure attack impact, from security analyst's economic perspective, by considering the significance of network assets. our approach provides network administrators a useful tool for performing better countermeasures during the risk management process. we carry out a real trace study to demonstrate its feasibility in practice and validate its performance.