The Construction of Verification Models for Embedded Systems

The usefulness of verification hinges on the quality of the verification model. Verification is useful if it increases our confidence that an artefact bahaves as expected. As modelling inherently contains non-formal elements, the qualityof models cannot be captured by purely formal means. Still, we argue that modelling is not an act of irrationalism and unpredictable geniality, but follows rational arguments, that often remain implicit. In this paper we try to identify the tacit rationalism in the model construction as performed by most people doing modelling for verification. By explicating the different phases, arguments, and design decisions in the model construction, we try to develop guidelines that help to improve the process of model construction and the quality of models

Obtaining Formal Models through Non-Monotonic Refinement

When designing a model for formal verification, we want to\ud be certain that what we proved about the model also holds for the system we modelled. This raises the question of whether our model represents the system, and what makes us confident about this. By performing so called, non-monotonic refinement in the modelling process, we make the steps and decisions explicit. This helps us to (1) increase the confidence that the model represents the system, (2) structure and organize the communication with domain experts and the problem owner, and (3) identify rational steps made while modelling. We focus on embedded control systems

Timed Analysis of Security Protocols

We propose a method for engineering security protocols that are aware of timing aspects. We study a simplified version of the well-known Needham Schroeder protocol and the complete Yahalom protocol, where timing information allows the study of different attack scenarios. We model check the protocols using UPPAAL. Further, a taxonomy is obtained by studying and categorising protocols from the well known Clark Jacob library and the Security Protocol Open Repository (SPORE) library. Finally, we present some new challenges and threats that arise when considering time in the analysis, by providing a novel protocol that uses time challenges and exposing a timing attack over an implementation of an existing security protocol

Optical Photometry and Spectroscopy of the Suspected Cool Algol AV Delphini: Determination of the Physical Properties

We present new spectroscopic and BVRI photometric observations of the double-lined eclipsing binary AV Del ( period = 3:85 days) conducted over six observing seasons. A detailed radial velocity and light-curve analysis of the optical data shows the system to be most likely semidetached, with the less massive and cooler star filling its Roche lobe. The system is probably a member of the rare class of ‘‘cool Algol’’ systems, which are distinguished from the ‘‘classical’’ Algol systems in that the mass-gaining component is also a late-type star rather than a B- or A-type star. By combining the spectroscopic and photometric analyses, we derive accurate absolute masses for the components of M1 = 1.453 + 0.028 M and M2 = 0.705 + 0.014 M and radii of R1 = 2.632 + 0.030 R and R2 = 4.233 + 0.060 R, as well as effective temperatures of 6000 + 200 and 4275 + 150 K for the primary and secondary, respectively. There are no obvious signs of activity (spottedness) in the optical light curve of the binary

Synthesis and Stochastic Assessment of Cost-Optimal Schedules

We present a novel approach to synthesize good schedules for a class of scheduling problems that is slightly more general than the scheduling problem FJm,a|gpr,r_j,d_j|early/tardy. The idea is to prime the schedule synthesizer with stochastic information more meaningful than performance factors with the objective to minimize the expected cost caused by storage or delay. The priming information is obtained by stochastic simulation of the system environment. The generated schedules are assessed again by simulation. The approach is demonstrated by means of a non-trivial scheduling problem from lacquer production. The experimental results show that our approach achieves in all considered scenarios better results than the extended processing times approach

Job Shadowing Experiences as a Teaching Tool: A New Twist on a Tried and True Technique

Job shadowing has a long history of utilization. It is primarily considered a way for youth to become aware of the world-of-work through programs sponsored by schools or social organizations. For example, Junior Achievement International, in cooperation with several government agencies, has sponsored Groundhog Job Shadow Day for nearly 20 years. A quick internet search for job shadowing yielded over 24 million hits with the vast majority of those focused on programs aimed at high school students. Internet offerings detail anecdotal accounts of experiences, methods for setting up and executing programs, and extolment of the virtues of shadowing as a tool for high school students to prepare for college career direction. Other internet offerings focus on employer-developed programs aimed at internal advancement or as a recruitment tool for potential employees. There has been very little published addressing the use of job shadowing at the college level. Yet, job shadowing can be a great tool for college students to explore potential careers prior to committing to a specific major. This project details a pilot program in which professional selling students engage in a job shadowing experience that yields not only personal experience for themselves, but that also generates information which can be used as a teaching tool for all students

Gender Differences In Responses To Hypothetical Business Ethical Dilemmas By Business Undergraduates

Business leaders are often failing to display ethical behavior in business decisions. This paper examines the gender differences found in undergraduate business students when faced with ethical decision making dilemmas