Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model

To harness the power of multi-core and distributed platforms, and to make the development of concurrent software more accessible to software engineers, different object-oriented concurrency models such as SCOOP have been proposed. Despite the practical importance of analysing SCOOP programs, there are currently no general verification approaches that operate directly on program code without additional annotations. One reason for this is the multitude of partially conflicting semantic formalisations for SCOOP (either in theory or by-implementation). Here, we propose a simple graph transformation system (GTS) based run-time semantics for SCOOP that grasps the most common features of all known semantics of the language. This run-time model is implemented in the state-of-the-art GTS tool GROOVE, which allows us to simulate, analyse, and verify a subset of SCOOP programs with respect to deadlocks and other behavioural properties. Besides proposing the first approach to verify SCOOP programs by automatic translation to GTS, we also highlight our experiences of applying GTS (and especially GROOVE) for specifying semantics in the form of a run-time model, which should be transferable to GTS models for other concurrent languages and libraries.Comment: In Proceedings GaM 2015, arXiv:1504.0244

A design view of capability

In order to optimise resource deployment in a rapid changing operational environment, capability has received increasing concerns in terms of maximising the utilisation of resources. As a result of such extant research, different domains were seen to endow different meanings to capability, indicating a lack of common understanding of the true nature of capability. This paper presents a design view of capability from design artefact knowledge perspective. Capability is defined as an intrinsic quality of an entity closely related to artefact behavioural and structural knowledge. Design artefact knowledge was categorised across expected, instantiated, and interpreted artefact knowledge spaces (ES, IsS, and ItS). Accordingly, it suggests that three types of capability exist in the three spaces, which can be used in employing resources. Moreover, Network Enabled Capability (NEC), the capability of a set of linked resources within a specific environment is discussed, with an example of how network resources are deployed in a Virtual Integration Platform (VIP)

Optimizing a Law School’s Course Schedule

[Excerpt] “Just like other educational institutions, law schools must schedule courses by taking into consideration student needs, faculty resources, and logistical support such as classroom size and equipment needs. Course scheduling is an administrative function, typically handled by an Assistant Dean or an Associate Dean, who works with the faculty and the registrar to balance these considerations in advance of the registration process. Usually, the entire academic year is scheduled in advance, although the spring semester may be labeled tentative until registration begins for that semester. It’s hard to imagine, but some schools even publish a two-year schedule of upper-division courses so that students can plan their entire law school career in advance. In order to give assistance to those academics involved for the first time in the scheduling process, this article discusses the law school scheduling process and how a scheduling software package has worked to successfully automate what has been seen as one of the most abysmal administrative tasks of an Associate Dean. We first provide a background to course scheduling at a typical law school. We then present a review of the tools for, and literature on, course scheduling, followed by a discussion of how technology can be applied to course scheduling in general, and our outcomes of applying this technology in a law school environment. We close with a brief summary.

Natural Language Dialogue Service for Appointment Scheduling Agents

Appointment scheduling is a problem faced daily by many individuals and organizations. Cooperating agent systems have been developed to partially automate this task. In order to extend the circle of participants as far as possible we advocate the use of natural language transmitted by e-mail. We describe COSMA, a fully implemented German language server for existing appointment scheduling agent systems. COSMA can cope with multiple dialogues in parallel, and accounts for differences in dialogue behaviour between human and machine agents. NL coverage of the sublanguage is achieved through both corpus-based grammar development and the use of message extraction techniques.Comment: 8 or 9 pages, LaTeX; uses aclap.sty, epsf.te