Web services might be the most popular and powerful software development technology in today's software world. Yet it brings software developers and testers a lot of challenges also. this is mainly caused by the i...
详细信息
Web services might be the most popular and powerful software development technology in today's software world. Yet it brings software developers and testers a lot of challenges also. this is mainly caused by the insufficient information provided by the WSDL file of a Web service. From the WSDL file, we can not get the information useful for testing, such as dependence information. To solve this problem, we proposed and practiced to extend the WSDL to support this kind of information description. In this paper, four kinds of extension are considered: input-output dependency, invocation sequence, hierarchical functional description and concurrent sequence specifications. Also their advantages are discussed.
We present a framework for the combination of Constraint logicprogramming (CLP) and higher-order Hereditary Harrop Formulas (hoHH). Our aim is to improve the expressiveness of traditional logicprogramming withthe b...
详细信息
ISBN:
(纸本)3540417397
We present a framework for the combination of Constraint logicprogramming (CLP) and higher-order Hereditary Harrop Formulas (hoHH). Our aim is to improve the expressiveness of traditional logicprogramming withthe benefits of both fields: CLP and hoHH. the result is denoted higher-order Hereditary Harrop Formulas with Constraints (hoHH(C)). the syntax of hoHH is introduced using lambda-terms and is enriched with a basic constraint system. then an intuitionistic sequent calculus is defined for this combined logic, that preserves the property of an abstract logicprogramming language. In addition, a sound and complete procedure for goal solving is presented as a transformation system that explains the operational semantics.
the use of the Java programming language for implementing server-side application logic is increasing in popularity, yet there is very little known about the architectural requirements of this emerging commercial work...
详细信息
the use of the Java programming language for implementing server-side application logic is increasing in popularity, yet there is very little known about the architectural requirements of this emerging commercial workload. We present a detailed characterization of the Transaction Processing Council's TPC- W web benchmark, implemented in Java. the TPC-W benchmark is designed to exercise the web server and transaction processing system of a typical e-commerce web site. We have implemented TPC-W as a collection of Java servlets, and present an architectural study detailing the memory system and branch predictor behavior of the workload. We also evaluate the effectiveness of a coarse-grained multithreaded processor at increasing system throughput using TPC- W and other commercial workloads. We measure system throughput improvements from 8% to 41% for a two context processor, and 12% to 60% for a four context uniprocessor over a single-threaded uniprocessor, despite decreased branch prediction accuracy and cache hit rates.
In this paper, we present two methods to overcome the combinatorial complexity when solving large discrete optimization problems. the basic idea relies on combining mixed integer programming (MIP) and constraint logic...
详细信息
In this paper, we present two methods to overcome the combinatorial complexity when solving large discrete optimization problems. the basic idea relies on combining mixed integer programming (MIP) and constraint logicprogramming (CLP) to exploit their complementary strengths. these strategies are illustrated in the area of job-shop scheduling and trim-loss problems. Comparisons of the strategies are presented with direct solutions on MIP and CLP problems. (C) 2000 Elsevier Science Ltd. All rights reserved.
this paper describes the application of a method to carry out a formally correct implementation of a logic controller for an event-driven process system. Given a control architecture and the functional specification o...
详细信息
this paper describes the application of a method to carry out a formally correct implementation of a logic controller for an event-driven process system. Given a control architecture and the functional specification of each controller module, formal proofs are established and discharged to demonstrate the logical equivalence between the functional specification and the code implementation of logic controllers. the methodology is illustrated with an example. (C) 2000 Elsevier Science Ltd. All rights reserved.
this paper introduces a novel approach for the specialization of functionallogic languages. We consider a maximally simplified abstract representation of programs (which still contains all the necessary information) ...
详细信息
ISBN:
(纸本)3540412859
this paper introduces a novel approach for the specialization of functionallogic languages. We consider a maximally simplified abstract representation of programs (which still contains all the necessary information) and define a non-standard semantics for these programs. Boththings mixed together allow us to design a simple and concise partial evaluation method for modern functionallogic languages, avoiding several limitations of previous approaches. Moreover, since these languages can be automatically translated into the abstract representation, our technique is widely applicable. In order to assess the practicality of our approach, we have developed a partial evaluation tool for the multi-paradigm language Curry. the partial evaluator is written in Curry itself and has been tested on an extensive benchmark suite (even a meta-interpreter). To the best of our knowledge, this is the first purely declarative partial evaluator for a functionallogic language.
the proceedings contain 30 papers. the special focus in this conference is on Nonmononic reasoning and Descriptive complexity. the topics include: On the complexity of theory curbing;graph operations and monadic secon...
ISBN:
(纸本)3540412859
the proceedings contain 30 papers. the special focus in this conference is on Nonmononic reasoning and Descriptive complexity. the topics include: On the complexity of theory curbing;graph operations and monadic second-order logic;efficient first order functional program interpreter with time bound certifications;encoding temporal logics in executable Z;behavioural constructor implementation for regular algebras;an extensible proof text editor;a tactic language for the system Coq;proof simplification for model generation and its applications;compiling and verifying security protocols;equational binary decision diagrams;a PVS proof obligation generator for lustre programs;efficient structural information analysis for real CLP languages;playing logic programs withthe alpha-beta algorithm;logicprogramming approaches for representing and solving constraint satisfaction problems;proof-search in implicative linear logic as a matching problem;a new model construction for the polymorphic lambda calculus;church’s lambda delta calculus;querying inconsistent databases;static reduction analysis for imperative object oriented languages;an abstract interpretation approach to termination of logic programs and using an abstract representation to specialize functionallogic programs.
A programmable controller (PC) programming technique using SFC (sequential function chart) has been adopted in sequential control system design because SFC can graphically represent the sequence how of control logic. ...
详细信息
A programmable controller (PC) programming technique using SFC (sequential function chart) has been adopted in sequential control system design because SFC can graphically represent the sequence how of control logic. However, when we design an SFC program, we must verify the program withthe design specifications. For this purpose, we can use scenario simulation and exhaustive simulation. In this paper, we propose to model boththe controlled object and the SFC program by a Petri net for verification by both types of simulations. (C) 2000 Elsevier Science Ltd. All rights reserved.
In this paper, we present two methods to overcome the combinatorial complexity when solving large discrete optimization problems. the basic idea relies on combining mixed integer programming (MIP) and constraint logic...
详细信息
In this paper, we present two methods to overcome the combinatorial complexity when solving large discrete optimization problems. the basic idea relies on combining mixed integer programming (MIP) and constraint logicprogramming (CLP) to exploit their complementary strengths. these strategies are illustrated in the area of job-shop scheduling and trim-loss problems. Comparisons of the strategies are presented with direct solutions on MIP and CLP problems. (C) 2000 Elsevier Science Ltd. All rights reserved.
暂无评论