this paper presents a new approach for the development of data-intensive web applications that depend on sophisticated application logic. E-Commerce web sites, on-line auction systems and large enterprise web portals ...
详细信息
ISBN:
(纸本)1595933522
this paper presents a new approach for the development of data-intensive web applications that depend on sophisticated application logic. E-Commerce web sites, on-line auction systems and large enterprise web portals fall into this category as they require comprehensive data access, data processing and data manipulation capabilities. However, existing methodologies mainly concentrate on modeling content, navigation and presentation aspects of read-only web sites. In our opinion these models are not sufficient to express complex operations that access or modify web application content. therefore, we propose an additional Operation Model defining the operation logic of a web application. We show that based on this model a significant part of a web application's Operation Layer can be generated, still allowing the manual implementation of arbitrary additional functionality. We evaluate our approach and present experimental results based on a large example application for the area of innovation management.
We have reported previously [I] results of a study with a sample of bug reports from four off-the-shelf SQL servers. We checked whether these bugs caused failures in more than one server. We found that very few bugs c...
详细信息
ISBN:
(纸本)0769526489
We have reported previously [I] results of a study with a sample of bug reports from four off-the-shelf SQL servers. We checked whether these bugs caused failures in more than one server. We found that very few bugs caused failures in two servers and none caused failures in more than two. this would suggest a fault-tolerant server built with diverse off-the-shelf servers would be a prudent choice for improving failure detection. To study other aspects of fault tolerance, namely failure diagnosis and state recovery, we have studied the "data diversity" mechanism and we defined a number of SQL rephrasing rules. these rules transform a client sent statement to an additional logically equivalent statement, leading to more results being returned to an adjudicator. these rules therefore help to increase the probability of a correct response being returned to a client and maintain a correct state in the database.
As an important part of service-oriented software engineering, service retrieval receives much attention from industry and academia, but which still leaves much to be expected: how the truth of the advertisement of se...
详细信息
We illustrate how to employ metacircular assume/guarantee reasoning to reduce the verification complexity of finite instances of protocols for safety, using nothing more than an explicit state model checker. the forma...
详细信息
ISBN:
(纸本)9780769527079
We illustrate how to employ metacircular assume/guarantee reasoning to reduce the verification complexity of finite instances of protocols for safety, using nothing more than an explicit state model checker. the formal underpinnings of our method are based on establishing a simulation relation between the given protocol M, and several overapproximations thereof, (M) over tilde (1),...,(M) over tilde (k). Each (M) over tilde (i) simulates M, and represents one "view" of it. the A is depend on each other both to define the abstractions as well as to justify them. We show that in case of our hierarchical coherence protocol, its designer could easily construct each of the (M) over tilde (i) in a counterexample guided manner. this approach is practical, considerably reduces the verification complexity, and has been successfully applied to a complex hierarchical multicore cache coherence protocol which could not be verified through traditional model checking.
Despite decades of efforts and successes in logic synthesis, algorithm runtime has rarely been taken as a first class objective in research. As design complexity soars and million gate designs become common, as deep s...
详细信息
ISBN:
(纸本)0780392108
Despite decades of efforts and successes in logic synthesis, algorithm runtime has rarely been taken as a first class objective in research. As design complexity soars and million gate designs become common, as deep submicron effects dominate and frequently invoking logic synthesis within a low-level physical design environment, or a high-level architectural exploration environment become mandatory, it becomes necessary to revisit the fundamental logic synthesis infrastructure and algorithms. In this paper, we demonstrate FBDD, an open sourced, Binary Decision Diagram (BDD) based logic synthesis package, which employs several new techniques, including folded logic transformations and two-variable sharing extraction. Towards the goal of scaling logic synthesis algorithms, we show that for standard benchmarks, and for field programmable gate array (FPGA) technology, FBDD can produce circuits with comparable area with commercial tools, while running one order of magnitude faster.
We propose a framework which extends Antitonic logic Programs [Damásio and Pereira, in: Proc. 6th Int. Conf. on logicprogramming and Nonmonotonic Reasoning, Springer, 2001, p. 748] to an arbitrary complete bilat...
详细信息
this paper presents how fuzzy goal programming can be efficiently used for modelling and solving land-use planning problems in agricultural systems for optimal production of several seasonal crops in a planning year. ...
详细信息
this paper presents how fuzzy goal programming can be efficiently used for modelling and solving land-use planning problems in agricultural systems for optimal production of several seasonal crops in a planning year. In the model formulation of the problem, utilization of total cultivable land, supply of productive resources, aspiration levels of various production of crops as well as the total expected profit from the farm are fuzzily described. In the decision-making situation, minimization of the under-deviational variables of the membership goals with highest membership value (unity) as their achievement levels defined for the membership functions of the fuzzy goals of the problem on the basis of the priorities of importance of achieving the aspired levels of the fuzzy goals to the extent possible is considered. As a study region, the District Nadia, West Bengal, India is taken into account. To expound the potential use of the approach, the model solution is compared withthe existing cropping plan of the District as well as a solution of the problem obtained by using the additive fuzzy goal programming model studied by Tiwari et al. (Fuzzy sets and systems 24(1987)27.) previously. (c) 2004 Elsevier Ltd. All rights reserved.
Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in an agent-based platform called CARREL...
详细信息
ISBN:
(纸本)0769524540
Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in an agent-based platform called CARREL. It is an agent-agency which mediates organ transplants. We present two possible ways to infer the stable and preferred extensions of an argumentation framework, one in a declarative way using Answer Set programming(ASP) and the other one in a procedure way.
To verify software and system functionality during the design process of complex SoCs, designers routinely use instruction set simulators (ISSs) as high level processor models. Typically, an ISS needs to simulate bill...
详细信息
ISBN:
(纸本)0780392108
To verify software and system functionality during the design process of complex SoCs, designers routinely use instruction set simulators (ISSs) as high level processor models. Typically, an ISS needs to simulate billions of target instructions to verify a single task of the system in design, which is a very time-consuming process. therefore, the simulation speed of ISSs has become one important concern of SoC designers. In this paper, we present a new technique to improve the speed of ISSs. Specifically, we focus on the translation of memory addresses between the target memory space and the host memory space. Such translation is performed by 4 hash table in many ISS implementations. To accelerate the translation, we introduce a software cache called translation buffer (TB) to cache the hashing results for quick future access. With properly chosen TB sizes, our implementation effectively exploits the abundant locality inherent in the memory footprints of real-world application programs and greatly reduces the overall address translation overhead. We integrated the technique into three popular ISSs and achieved a 15-32% improvement in simulation speed.
We consider the model checking problem for Process Rewrite Systems (PRSs), an infinite-state formalism (non Turing-powerful) which subsumes many common models such as Pushdown Processes and Petri Nets. PRSs can be ado...
详细信息
ISBN:
(纸本)354024297X
We consider the model checking problem for Process Rewrite Systems (PRSs), an infinite-state formalism (non Turing-powerful) which subsumes many common models such as Pushdown Processes and Petri Nets. PRSs can be adopted as formal models for programs with dynamic creation and synchronization of concurrent processes, and with recursive procedures. the model-checking problem for PRSs w.r.t. action-based linear temporal logic (ALTL) is undecidable. However, decidability for some interesting fragment of ALTL remains an open question. In this paper we state decidability results concerning generalized acceptance properties about infinite derivations (infinite term rewriting) in PRSs. As a consequence, we obtain decidability of the model-checking (restricted to infinite runs) for PRSs and a meaningful fragment of ALTL.
暂无评论