Automated Analysis of Concurrent and Real-Time Software

This paper surveys the current status of our work on automated anal-ysis of the logical and timing properties of concurrent software based on the constrained expression approach. It describes our analysis toolset, reports some extremely encouraging results of using the toolset to ana-lyze logical properties of nontrivial concurrent systems, and discusses the modifications we have made to the toolset to apply it to analyzing tim-ing properties. It then outlines ongoing and planned research directed at further improving these methods

An Integrated Collection of Tools for Continuously Improving the Processes by Which Health Care Is Delivered: A Tool Report

With the availability of powerful computational and commu- nication systems, scientists now readily access large, complicated derived datasets and build on those results to produce, through further processing, yet other derived datasets of interest. The scientific processes used to create such datasets must be clearly documented so that scientists can evaluate their soundness, reproduce the results, and build upon them in responsible and appropriate ways. Here, we present the concept of an analytic web, which defines the scientific processes employed and details the exact appli- cation of those processes in creating derived datasets. The work described here is similar to work often referred to as “scientific workflow,” but em- phasizes the need for a semantically rich, rigorously defined process defi- nition language. We illustrate the information that comprises an analytic web for a scientific process that measures and analyzes the flux of water through a forested watershed. This is a complex and demanding scientific process that illustrates the benefits of using a semantically rich, executable language for defining processes and for supporting automatic creation of process provenance metadata

USING INTEGER PROGRAMMING TO VERIFY GENERAL SAFETY AND LIVENESS PROPERTIES

. Analysis of concurrent systems is plagued by the state explosion problem. We describe an analysis technique that uses necessary conditions, in the form of linear inequalities, to verify certain properties of concurrent systems, thus avoiding the enumeration of the potentially explosive number of reachable states of the system. This technique has been shown to be capable of verifying simple safety properties, like freedom from deadlock, that can be expressed in terms of the number of certain events occurring in a finite execution, and has been successfully used to analyze a variety of concurrent software systems. In this paper, we extend the technique to the verification of more complex safety properties that involve the order of events and to the verification of liveness properties, which involve infinite executions. Keywords: Concurrent systems, automated verification, integer programming, safety, liveness 1. Introduction Many concurrent systems can be modeled as a set of communic..