We present a novel approach to termination analysis. In a first step, the analysis uses a program as a black-box which exhibits only a finite set of sample traces. Each sample trace is infinite but can be represented by a finite lasso. The analysis can ”learn” a program from a termination proof for the lasso, a program that is terminating by construction. In a second step, the analysis checks t...

One of the challenges in building analytic performance models such as queuing network models is obtaining service demands for the various workloads and various devices. While some of these parameters can be easily measured, some may not be easy to obtain due to the complexity that the measurements may entail or because it may not be possible to stop the operation of a production system to colle...

We present an active learning algorithm for inferring extended finite state machines (EFSM)s, combining data flow and control behavior. Key to our learning technique is a novel learning model based on so-called tree queries. The learning algorithm uses the tree queries to infer symbolic data constraints on parameters, e.g., sequence numbers, time stamps, identifiers, or even simple arithmetic. ...

Specification-based testing is a particular case of black-box testing, which consists in deriving test cases from an analysis of a formal specification. We present in this paper an extension of the most popular and most efficient selection method widely used in the algebraic framework, called axiom unfolding, to coalgebraic specifications, using the modal logic provided by the CoCasl specificat...

Provenance traces captured by scientific workflows can be useful for designing, debugging and maintenance. However, our experience suggests that they are of limited use for reporting results, in part because traces do not comprise domain-specific annotations needed for explaining results, and the black-box nature of some workflow activities. We show that by basic mark-up of the data processing ...

Complicated control systems are used in many safety critical applications, such as in cars and airplanes. Due to the nature of these systems veri cation can be very di cult to do analytically or algorithmically. The only feasible analysis and veri cation method is often simulation. The generation of good test cases that can expose aws in models of the system is, therefore, of great importance. ...

Logic-based applications often use customized logics which are composed of several logics. These customized logics are also often embedded as a black-box in an application. Their implementation requires the speciication of a well-deened interface with common operations such as a parser, a printer, and a theorem prover. In order to be able to compose these logics, one must also deene composition...

We present the first fourth-order central scheme for two-dimensional hyperbolic systems of conservation laws. Our new method is based on a central weighted nonoscillatory approach. The heart of our method is the reconstruction step, in which a genuinely two-dimensional interpolant is reconstructed from cell averages by taking a convex combination of building blocks in the form of biquadratic po...

In real world, in order to transform an abstract and generic cryptographic scheme into actual physical implementation, one usually undergoes two processes: mathematical realization at algorithmic level and physical realization at implementation level. In the former process, the abstract and generic cryptographic scheme is transformed into an exact and specific mathematical scheme, while in the ...

A method for training patterns validation for modelling MR damper is proposed. The method was validated with two models based on black-box and semi-phenomenological approaches. An input pattern that allows a better identification of the MR damper model was found. Including a frequency modulated displacement and increased clock period in the training pattern, the MR damper model fitting is impro...