| 1. |
|
|
| 2. |
- Amadini, Roberto, et al.
(författare)
-
MiniZinc with strings
- 2017
-
Ingår i: Logic-Based Program Synthesis and Transformation. - Cham : Springer. - 9783319631387 - 9783319631394 ; , s. 59-75
-
Konferensbidrag (refereegranskat)abstract
- Strings are extensively used in modern programming languages and constraints over strings of unknown length occur in a wide range of real-world applications such as software analysis and verification, testing, model checking, and web security. Nevertheless, practically no constraint programming solver natively supports string constraints. We introduce string variables and a suitable set of string constraints as builtin features of the MiniZinc modelling language. Furthermore, we define an interpreter for converting a MiniZinc model with strings into a FlatZinc instance relying only on integer variables. This conversion is obtained via rewrite rules, and does not require any extension of the existing FlatZinc specification. This provides a user-friendly interface for modelling combinatorial problems with strings, and enables both string and non-string solvers to actually solve such problems.
|
|
| 3. |
|
|
| 4. |
- Arafailova, Ekaterina, et al.
(författare)
-
Global Constraint Catalog Volume II: Time-Series Constraints
- 2016
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme. Second it provides the corresponding synthesised catalogue of structural time-series constraints where each constraint is explicitly described in terms of automata with accumulators.
|
|
| 5. |
- Arafailova, Ekaterina, et al.
(författare)
-
Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints
- 2016
-
Ingår i: Principles and Practice of Constraint Programming. - Cham : Springer Publishing Company. - 9783319449524 - 9783319449531 ; , s. 13-29
-
Konferensbidrag (refereegranskat)abstract
- Integer time series are often subject to constraints on the aggregation of the integer features of all occurrences of some pattern within the series. For example, the number of inflexions may be constrained, or the sum of the peak maxima, or the minimum of the peak widths. It is currently unknown how to maintain domain consistency efficiently on such constraints. We propose parametric ways of systematically deriving glue constraints, which are a particular kind of implied constraints, as well as aggregation bounds that can be added to the decomposition of time-series constraints [5]. We evaluate the beneficial propagation impact of the derived implied constraints and bounds, both alone and together.
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
- Balck, Kenneth, et al.
(författare)
-
Model-based protocol log generation for testing a telecommunication test harness using CLP
- 2014
-
Ingår i: 2014 DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION (DATE). - 9783981537024
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 9. |
- Beldiceanu, Nicolas, et al.
(författare)
-
A Modelling Pearl with Sortedness Constraints
- 2015. - 9
-
Ingår i: GCAI 2015. Global Conference on Artificial Intelligence. - : EasyChair. ; , s. 27-41
-
Konferensbidrag (refereegranskat)abstract
- Some constraint programming solvers and constraint modelling languages feature the Sort(L,P,S) constraint, which holds if S is a nondecreasing rearrangement of the list L, the permutation being made explicit by the optional list P. However, such sortedness constraints do not seem to be used much in practice. We argue that reasons for this neglect are that it is impossible to require the underlying sort to be stable, so that Sort cannot be guaranteed to be a total-function constraint, and that L cannot contain tuples of variables, some of which form the key for the sort. To overcome these limitations, we introduce the StableKeysort constraint, decompose it using existing constraints, and propose a propagator. This new constraint enables a powerful modelling idiom, which we illustrate by elegant and scalable models of two problems that are otherwise hard to encode as constraint programs.
|
|
| 10. |
|
|
