Predicate abstraction is a form of abstract interpretation where the abstract domain is constructed from a finite set of predicates over the variables of the program. this paper explores a way to integrate predicate a...
详细信息
ISBN:
(纸本)3642002544
Predicate abstraction is a form of abstract interpretation where the abstract domain is constructed from a finite set of predicates over the variables of the program. this paper explores a way to integrate predicate abstraction into a calculus for deductive program verification based on symbolic execution, where it allows us to infer loop invariants automatically that would otherwise have to be given interactively. the approach has been implemented as a part of the KeY verification system. (C) 2010 Elsevier B.V. All rights reserved.
the paper addresses the optimal design of the last branch of the supply chain, i.e., the Distribution Network (DN). We extend a deterministic optimization model previously proposed by the authors, using fuzzy numbers ...
详细信息
Recycling has been gaining ground, thanks to the recent progress made in the related technology. However, a limiting factor to its wide adoption, is the lack of modern tools for managing the collection of recyclable r...
详细信息
ISBN:
(数字)9783642239601
ISBN:
(纸本)9783642239601;9783642239595
Recycling has been gaining ground, thanks to the recent progress made in the related technology. However, a limiting factor to its wide adoption, is the lack of modern tools for managing the collection of recyclable resources. In this paper, we present EcoTruck, a management system for the collection of recyclable paper products. EcoTruck is modelled as a multi-agent system and its implementation employs Erlang, a distribution-oriented declarative language. the system aims to automate communication and cooperation of parties involved in the collection process, as well as optimise vehicle routing. the latter have the effect of minimising vehicle travel distances and subsequently lowering transportation costs. By speeding up the overall recycling process, the system could increase the service throughput, eventually introducing recycling methods to a larger audience.
Indexes are ubiquitous. Examples include associative arrays, dictionaries, maps and hashes used in applications such as databases, file systems and dynamic languages. Abstractly, a sequential index can be viewed as a ...
详细信息
ISBN:
(纸本)9781450309400
Indexes are ubiquitous. Examples include associative arrays, dictionaries, maps and hashes used in applications such as databases, file systems and dynamic languages. Abstractly, a sequential index can be viewed as a partial function from keys to values. Values can be queried by their keys, and the index can be mutated by adding or removing mappings. Whilst appealingly simple, this abstract specification is insufficient for reasoning about indexes accessed concurrently. We present an abstract specification for concurrent indexes. We verify several representative concurrent client applications using our specification, demonstrating that clients can reason abstractly without having to consider specific underlying implementations. Our specification would, however, mean nothing if it were not satisfied by standard implementations of concurrent indexes. We verify that our specification is satisfied by algorithms based on linked lists, hash tables and B-Link trees. the complexity of these algorithms, in particular the B-Link tree algorithm, can be completabely hidden from the client's view by our abstract specification.
Motivated by the fact that nearly all conditional logics are axiomatised by so-called shallow axioms (axioms with modal nesting depth <= 1) we investigate sequent calculi and cut elimination for modal logics of thi...
详细信息
ISBN:
(纸本)9783642221187;9783642221194
Motivated by the fact that nearly all conditional logics are axiomatised by so-called shallow axioms (axioms with modal nesting depth <= 1) we investigate sequent calculi and cut elimination for modal logics of this type. We first provide a generic translation of shallow axioms to (one-sided, unlabelled) sequent rules. the resulting system is complete if we admit pseudo-analytic cut, i.e. cuts on modalised propositional combinations of subformulas, leading to a generic (but sub-optimal) decision procedure. In a next step, we show that, for finite sets of axioms, only a small number of cuts is needed between any two applications of modal rules. More precisely, completeness still holds if we restrict to cuts that form a tree of logarithmic height between any two modal rules. In other words, we obtain a small (PSPACE-computable) representation of an extended rule set for which cut elimination holds. In particular, this entails PSPACE decidability of the underlying logic if contraction is also admissible. this leads to (tight) PSPACE bounds for various conditional logics.
Previously we provided two formal behavioural semantics for the Business Process Modelling Notation (BPMN) in the process algebra CSP. By exploiting CSP's refinement orderings, developers may formally compare thei...
详细信息
ISBN:
(纸本)3642002544
Previously we provided two formal behavioural semantics for the Business Process Modelling Notation (BPMN) in the process algebra CSP. By exploiting CSP's refinement orderings, developers may formally compare their BPMN models. However, BPMN is not a specification language, and it is difficult and sometimes impossible to use it to construct behavioural properties against which other BPMN models may be verified. this paper considers a pattern-based approach to expressing behavioural properties. We describe a property specification language PL for capturing a generalisation of Dwyer et al.'s Property Specification Patterns, and present a translation from PL into a bounded, positive fragment of linear temporal logic, which can then be automatically translated into CSP for simple refinement checking. We present a detailed example studying the behavioural properties of an airline ticket reservation business process. Using the same example we also describe some recent results on expressing behavioural compatibility within our semantic models. these results lead to a compositional approach for ensuring deadlock freedom of interacting business processes. (C) 2010 Elsevier B.V. All rights reserved.
this work presents a histogram based color object classification by SVM for laboratory automation. In the laboratory environment, existing problem is the classification of color objects which is understood as blob lik...
详细信息
ISBN:
(纸本)9783642247279
this work presents a histogram based color object classification by SVM for laboratory automation. In the laboratory environment, existing problem is the classification of color objects which is understood as blob like pictures by the system via a camera. this automated system is located at hospitals, blood banks where we introduce the system different blood samples for different research purposes. the blood samples for different research purposes are realized with different colors of tube caps. these caps constitute the main problem here since their images are often blob like pictures. the segmented, multi color cap pictures are investigated in this paper by SVM for color object classification. To validate the performance of the system with SVM method, its output also compared to the other classification methods. In the future work different color spaces will be incorporated with SVM for better color classification.
In this paper we investigate the use of probabilistic machine-learning techniques to extract latent factors from semantically enriched service descriptions. the latent factors provide a model to represent service desc...
详细信息
In this paper we investigate the use of probabilistic machine-learning techniques to extract latent factors from semantically enriched service descriptions. the latent factors provide a model to represent service descriptions of any type in vector form. Withthis conversion, heterogeneous service descriptions can be represented on the same homogeneous plane thus achieving interoperability between different service description technologies. automated service discovery and ranking is achieved by extracting latent factors from queries and representing the queries in vector form. Vector algebra can then be used to match services to the query. this approach is scalable to large service repositories and provides an efficient mechanism for publishing new services after the system is deployed.
this paper presents a novel approach of using unmanned vehicles for automated Meter Reading (AMR) applications in rural areas where there are a few consumers scattered around a wide area. the proposed system does not ...
详细信息
this paper presents a novel approach of using unmanned vehicles for automated Meter Reading (AMR) applications in rural areas where there are a few consumers scattered around a wide area. the proposed system does not require a fixed network infrastructure to transfer data to a central database, since data collection is carried out by unmanned vehicles. Compared to traditional meter reading systems, the use of unmanned vehicles for AMR brings several advantages, such as low cost operation, flexibility, and online system management. However, the realization of these potential gains directly depends on reliable communication capabilities of the deployed system and successful navigation of unmanned vehicles. Overall, in this paper, the design principles and challenges of using unmanned vehicles for AMR applications in rural areas have been presented. Also, the communication architecture of the proposed system has been explained and comparative simulation studies have been performed in terms of energy efficiency and navigation accuracy.
Wireless Sensor Networks are increasingly being deployed in enterprise scenarios involving multiple actors. the capabilities of sensors must be shared across many applications and sensors must cooperate across federat...
详细信息
Wireless Sensor Networks are increasingly being deployed in enterprise scenarios involving multiple actors. the capabilities of sensors must be shared across many applications and sensors must cooperate across federations spanning administrative domains. this paper describes our efforts towards constructing federated wireless sensor systems. It leverages and details key building blocks designed to achieve federation and sharing: a component model with distributed event-based communication, a policy-driven control infrastructure for resources and communications, a deployment architecture and a mechanism to establish and propagate trust into the wireless sensor network. the building blocks focus on the specific and necessary in-network extensions, such as extensions to sensor run-time, middleware and programming abstractions, rather than the backend challenges. the combination of the building blocks creates a security middleware that supports multiparty federated sensor networks. An estimate of the total cost of federation in terms of footprint is provided and first experiences of application of the middleware are reported upon.
暂无评论