Modern manufacturing is caught in a trade-off between maximizing efficiency and staying flexible dynamic markets. Inter-organizational sharing of capacities on digital marketplace could contribute to gain flexibility, reduce cost capital employed as well provide further business opportunities. Although current research has already prepared the ground for its technical conceptualization, such ma...

Bounded Model Checking (BMC) is a successful method for refuting properties of erroneous systems. Initially applied to discrete systems only, BMC could be extended to more complex domains like linear hybrid automata. The increasing complexity coming along with these complex models, but also recent optimizations of SAT-based BMC, like excessive conflict learning, reveal a memory explosion proble...

A new approach to verification of timed security protocols is given. The idea consists in modelling a finite number of users (including an intruder) of the computer network and their knowledge about secrets by timed automata. The runs of the product automaton of the above automata correspond to all the behaviours of the protocol for a fixed number of sessions. Verification is performed using th...

This paper proposes a standard testing platform for Information Retrieval (IR) that can be used for testing different IR statistical models in a controlled environment or in the Web. The development of a standard system avoids the effort of developing a specific testing system to validate each method or model on the IR field of activity, working as a common platform. Examples of applications on...

Cross-platform software development is a complex and challenging activity. Frequently, developers have to create portions of code that use platform-specific data types and functions. This has led to two largely adopted practices: either making extensive use of the preprocessor, or splitting the software package into several branches, one for each target platform. Both practices have their drawb...

This paper presents the DA-BMC tool chain that allows one to combine dynamic analysis and bounded model checking for finding synchronisation errors in concurrent Java programs. The idea is to use suitable dynamic analyses to identify executions of a program being analysed that are suspected to contain synchronisation errors. Some points in such executions are recorded, and then the executions a...

Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search for a counter example in executions whose length is bounded by some integer k. The BMC problem can be eeciently reduced to a propositional satissabil-ity problem, and can therefore be solved by SAT methods rather than BDDs. SAT p...