Conference Paper

Experiments with an Improved Constrained Expression Toolset.

DOI: 10.1145/120807.120823
Source: DBLP


At TAV3, we described a prelimimu-y version of the constrained expression toolset, and reported on the results of our initial experiments with it, Through those experiments we discovered shortcomings in some of the tools that limited the size of the examples that we could analyze. We have since redesigned and reimplementcd several components of the toolset, with performance improvements of more than two orders of magnitude in some cases. The improved toolset has been successfully used with designs that involve hundreds of concurrent processes. In this paper, we describe several experiments with the new version of the toolset, including preliminary experiments with a technique for analyzing systems that include an essentially arbitrary number of identical components.

2 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Without Abstract
    Computer Aided Verification, 3rd International Workshop, CAV '91, Aalborg, Denmark, July, 1-4, 1991, Proceedings; 01/1991
  • [Show abstract] [Hide abstract]
    ABSTRACT: Over the past few years, a number of research investigations have been initiated for static analysis of concurrent and distributed software. In this paper we report on experiments with various optimization techniques for reachability-based deadlock detection in Ada programs using Petri net models. Our experimental results show that various optimization techniques are mutually beneficial with respect to the effectiveness of the analysis.
    ACM SIGSOFT Software Engineering Notes 07/1993; 18(3):51-60. DOI:10.1145/154183.154197
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: OF THE DISSERTATION Static Detection of Deadlocks in Polynomial Time by Stephen P. Masticola, Ph.D. Dissertation Director: Dr. Barbara G. Ryder Parallel and distributed programming languages often include explicit synchronization primitives, such as rendezvous and semaphores. Such programs are subject to synchronization anomalies; the program behaves incorrectly because it has a faulty synchronization structure. A deadlock is an anomaly in which some subset of the active tasks of the program mutually wait on each other to advance; thus, the program cannot complete execution. In static anomaly detection, the source code of a program is automatically analyzed to determine if the program can ever exhibit a specific anomaly. Static anomaly detection has the unique advantage that it can certify programs to be free of the tested anomaly; dynamic testing cannot generally do this. Though exact static detection of deadlocks is NP-hard [Tay83a], many researchers have tried to detect deadlock by ...
Show more