Experiments with an improved constrained expression toolset

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Experiments with an improved constrained expression toolset

Full text

Pdf (1.01 MB)

Source

International Symposium on Software Testing and Analysis archive
Proceedings of the symposium on Testing, analysis, and verification table of contents

Victoria, British Columbia, Canada

Pages: 178 - 187

Year of Publication: 1991

ISBN:0-89791-449-X

Authors

George S. Avrunin	Department of Mathematics and Statistics, University of Massachusetts at Amherst, Amherst, MA
Ugo A. Buy	Department of Electrical Engineering and Computer Science, University of Illinois at Chicago, Box 4348, Chicago, IL
James C. Corbett	Department of Computer and Information Science, University of Massachusetts at Amherst, Amherst, MA
Laura K. Dillon	Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA
Jack C. Wileden	Department of Computer and Information Science, University of Massachusetts at Amherst, Amherst, MA

Sponsor

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 7, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/120807.120823 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	George S. Avrunin , Ugo A. Buy , James C. Corbett , Laura K. Dillon , Jack C. Wileden, Automated Analysis of Concurrent Systems with the Constrained Expression Toolset, IEEE Transactions on Software Engineering, v.17 n.11, p.1204-1222, November 1991 [doi>10.1109/32.106975]
	2	G. S. Avrunin, J. C. Corbett, L. K. Dillon, and J. C. Wileden. Automated constrained expression analysis of real-time software. Submitted for publication. Available as T&hnicat Report 90-117, Department of Computer and Information Science, University of Massachusetts, Dec. 1990.
	3	G. Avrunin , J. Wileden , L. Dillon, Experiments in automated analysis of concurrent software systems, ACM SIGSOFT Software Engineering Notes, v.14 n.8, p.124-130, Dec. 1989
	4	G S Avrunin , L K Dillon , J C Wileden , W E Riddle, Constrained expressions: Adding analysis capabilities to design methods for concurrent software systems, IEEE Transactions on Software Engineering, v.12 n.2, p.278-292, Feb. 1986
	5	Laura K. Dillon, Analysis of distributed systems using constrained expressions (concurrent systems), 1984
	6	L. K. Dillon. Overview of the constrained expression design language. Technical Report TRCS86-21, Department of Computer Science, University of California,Santa Barbara, October 1986.
	7	Laura K. Dillon , George S. Avrunin , Jack C. Wileden, Constrained expressions: toward broad applicability of analysis methods for distributed software systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.3, p.374-402, July 1988 [doi>10.1145/44501.44502]
	8	D. Helmbold and D. Luckham. Debugging Ada tasking programs. IEEE Software, 2(2):47-57, March 1985.
	9	G. M. Karam , R. J. A. Buhr, Starvation and Critical Race Analyzers for Ada, IEEE Transactions on Software Engineering, v.16 n.8, p.829-843, August 1990 [doi>10.1109/32.57622]
	10	M. A. Saunders. MINOS system manual. Technical Report SOL 77-31, Stanford University, Department of Operations Research, 1977.
	11	Kuo-Chung Tai, A graphical notation for describing executions of concurrent Ada programs, ACM SIGAda Ada Letters, v.VI n.1, p.94-103, Jan. 1986 [doi>10.1145/382256.382803]
	12	Sol M. Shatz , Shengru Tu , Tadao Murata , Sastry Duri, An Application of Petri Net Reduction for Ada Tasking Deadlock Analysis, IEEE Transactions on Parallel and Distributed Systems, v.7 n.12, p.1307-1322, December 1996 [doi>10.1109/71.553301]
	13	M. Young , R. Taylor , K. Forester , D. Brodbeck, Integrated concurrency analysis in a software development enviornment, ACM SIGSOFT Software Engineering Notes, v.14 n.8, p.200-209, Dec. 1989

CITED BY 3

	Shing Chi Cheung , Jeff Kramer, Context constraints for compositional reachability analysis, ACM Transactions on Software Engineering and Methodology (TOSEM), v.5 n.4, p.334-377, Oct. 1996
	S. Duri , U. Buy , R. Devarapalli , S. M. Shatz, Using state space reduction methods for deadlock analysis in Ada tasking, ACM SIGSOFT Software Engineering Notes, v.18 n.3, p.51-60, July 1993
	S. Duri , U. Buy , R. Devarapalli , S. M. Shatz, Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada, ACM Transactions on Software Engineering and Methodology (TOSEM), v.3 n.4, p.340-380, Oct. 1994