Within telecommunications development it is vital to have frameworks and systems to replay complicated scenarios on equipment under test, often there are not enough available scenarios. In this paper we study the prob...
详细信息
ISBN:
(纸本)9783981537024
Within telecommunications development it is vital to have frameworks and systems to replay complicated scenarios on equipment under test, often there are not enough available scenarios. In this paper we study the problem of testing a test harness, which replays scenarios and analyses protocol logs for the Public Warning System service, which is a part of the Long Term Evolution (LTE) 4G standard. Protocol logs are sequences of messages with timestamps;and are generated by different mobile network entities. In our case study we focus on user equipment protocol logs. In order to test the test harness we require that logs have both incorrect and correct behaviour. It is easy to collect logs from real system runs, but these logs do not show much variation in the behaviour of system under test. We present an approach where we use constraint logic programming (CLP) for both modelling and test generation, where each test case is a protocol log. In this case study, we uncovered previously unknown faults in the test harness.
constraint logic programming (CLP) is a language scheme for combining two declarative paradigms: constraint solving and logicprogramming. Concurrent constraintprogramming (CCP) is a declarative model for concurrency...
详细信息
ISBN:
(纸本)9783030138387;9783030138370
constraint logic programming (CLP) is a language scheme for combining two declarative paradigms: constraint solving and logicprogramming. Concurrent constraintprogramming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints in a shared store. In a previous paper, we developed a framework for dynamic slicing of CCP where the user first identifies that a (partial) computation is wrong. Then, she marks (selects) some parts of the final state corresponding to the data (constraints) and processes that she wants to study more deeply. An automatic process of slicing begins, and the partial computation is "depurated" by removing irrelevant information. In this paper we give two major contributions. First, we extend the framework to CLP, thus generalizing the previous work. Second, we provide an assertion language suitable for both, CCP and CLP, which allows the user to specify some properties of the computations in her program. If a state in a computation does not satisfy an assertion then some "wrong" information is identified and an automatic slicing process can start. We thus make one step further towards automatizing the slicing process. We show that our framework can be integrated with the previous semi-automatic one, giving the user more choices and flexibility. We show by means of examples and experiments the usefulness of our approach.
Model-driven simulation can make the design and delivery of instruction more efficient and effective. We describe two computational models that support both the design and delivery of instruction. BEST (the Bench-mark...
详细信息
ISBN:
(纸本)9783642028113
Model-driven simulation can make the design and delivery of instruction more efficient and effective. We describe two computational models that support both the design and delivery of instruction. BEST (the Bench-marked Experiential System for Training) can guide experts through the space of domain problems during the knowledge engineering phase of instructional design;it can guide trainees through the space of training objectives during instruction. PRESTO (Pedagogically Relevant Engineering of Scenarios for Training Objectives) builds scenarios on the fly to elicit the knowledge of experts during instructional design, and to satisfy the instructional objectives of trainees.
logicprogramming has been advocated as a language for system specification, especially for logical behaviours, rules and knowledge. However, modeling problems involving negation, which is quite natural in many cases,...
详细信息
ISBN:
(纸本)3540206426
logicprogramming has been advocated as a language for system specification, especially for logical behaviours, rules and knowledge. However, modeling problems involving negation, which is quite natural in many cases, is somewhat restricted if Prolog is used as the specification/implementation language. These constraints are not related to theory viewpoint, where users can find many different models with their respective semantics; they concern practical implementation issues. The negation capabilities supported by current Prolog systems are rather limited, and a correct and complete implementation there is not available. Of all the proposals, constructive negation [1,2] is probably the most promising because it has been proven to be sound and complete [4], and its semantics is fully compatible with Prolog’s.
Resource-constrained scheduling problems are commonly found in various areas, such as project management, manufacturing, transportation, software engineering, computer networks, and supply chain management. Its proble...
详细信息
ISBN:
(纸本)9783319396309;9783319396293
Resource-constrained scheduling problems are commonly found in various areas, such as project management, manufacturing, transportation, software engineering, computer networks, and supply chain management. Its problem models involve a large number of constraints and discrete decision variables, including binary and integer. In effect, the representation of resource allocation, for instance, is often expressed using binary or integer decision variables to form several constraints according to the respective scheduling problem. It significantly increases the number of decision variables and constraints as the problem scales;such kind of traditional approaches based on operations research is insufficient. Therefore, a hybrid approach to decision support for resource-constrained scheduling problems which combines operation research (OR) and constraint logic programming (CLP) is proposed. Unlike OR-based approaches, declarative CLP provides a natural representation of different types of constraints. This approach provides: (a) decision support through the answers to the general and specific questions, (b) specification of the problem based on a set of facts and constraints, (c) reduction to the combinatorial solution space. To evaluate efficiency and applicability of the proposed hybrid approach and implementation platform, implementation examples of job-shop scheduling problem are presented separately for the three environments, i.e., Mathematical programming (MP), CLP, and hybrid implementation platform.
IT projects are characterized by high complexity, implementation of the latest technological solutions and specialized competence of contractors and high costs. The key element in IT project management is to have empl...
详细信息
ISBN:
(纸本)9783030420581;9783030420574
IT projects are characterized by high complexity, implementation of the latest technological solutions and specialized competence of contractors and high costs. The key element in IT project management is to have employees with appropriate substantive competencies (programmers, designers, analysts, etc.). Before starting an IT project, the IT project manager must answer the following questions: Do I have the right set of team competences to start the project? If the team lacks competence, then in what area and to what extent? The article proposes a model of employee competence configuration and a procedure for their verification in the context of IT project management. Also presented is the method of model implementation and numerous computational examples verifying its usefulness and effectiveness of implementation.
We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We systematically formalize and implement the semant...
详细信息
ISBN:
(纸本)9783642231957
We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We systematically formalize and implement the semantics of a range of qualitative spatial calculi using a system of non-linear polynomial equations in the context of a classical constraint logic programming framework. Whereas CLP(QS) is a general framework, we demonstrate its applicability for the domain of Computer Aided Architecture Design. With CLP(QS) serving as a prototype, we position declarative spatial reasoning as a general paradigm open to other formalizations, reinterpretations, and extensions. We argue that the accessibility of qualitative spatial representation and reasoning mechanisms via the medium of high-level, logic-based formalizations is crucial for their utility toward solving real-world problems.
This paper describes the hybrid approach to optimization of decision problems in supply chain management (SCM). The hybrid approach proposed here combines the strengths of mathematical programming (MP) and constraint ...
详细信息
ISBN:
(纸本)9783319184227;9783319184210
This paper describes the hybrid approach to optimization of decision problems in supply chain management (SCM). The hybrid approach proposed here combines the strengths of mathematical programming (MP) and constraint logic programming (CLP), which leads to a significant reduction in the search time necessary to find the optimal solution, and allows solving larger problems. The proposed hybrid approach is presented as a concept of an additional layer of decision-making in integrated systems, for example ERP, DRP, etc. This solution allows the implementation of complete decision-making models, additional constraints as well as a set of questions for these models. The illustrative model presented in the article illustrate the advantages of the approach.
The transformation of constraintlogic programs (CLP programs) has been shown to be an effective methodology for verifying properties of imperative programs. By following this methodology, we encode the negation of a ...
详细信息
The transformation of constraintlogic programs (CLP programs) has been shown to be an effective methodology for verifying properties of imperative programs. By following this methodology, we encode the negation of a partial correctness property of an imperative program prog as a predicate incorrect defined by a CLP program T, and we show that prog is correct by transforming T into the empty program (and thus incorrect does not hold) through the application of semantics preserving transformation rules. We can also show that prog is incorrect by transforming T into a program with the fact incorrect (and thus incorrect does hold). Some of the transformation rules perform replacements of constraints that are based on properties of the data structures manipulated by the program prog. In this paper we show that constraint Handling Rules (CHR) are a suitable formalism for representing and applying constraint replacements during the transformation of CLP programs. In particular, we consider programs that manipulate integer arrays and we present a CHR encoding of a constraint replacement strategy based on the theory of arrays. We also propose a novel generalization strategy for constraints on integer arrays that combines CHR constraint replacements with various generalization operators on integer constraints, such as widening and convex hull. Generalization is controlled by additional constraints that relate the variable identifiers in the imperative program prog and the CLP representation of their values. The method presented in this paper has been implemented and we have demonstrated its effectiveness on a set of benchmark programs taken from the literature.
暂无评论