Home > LASER Publications > Static Analysis > Experimentation
All Publications

Static Analysis
FLAVERS
PROPEL
Finite-State Verification
Property Specification
Fault-Tree Analysis
Failure Mode and Effect Analysis
MPI Verification
INCA
Experimentation »

Process Programming and Workflow [...]

Software Development [...]

Case Studies [...]

Electronic Enterprise Institute

Jump To:
2008
2006
2004
2001
1999
1996
1995

LASER Publications

Experimentation

 2008

Breaking Up is Hard to Do: An Evaluation of Automated Assume-Guarantee Reasoning
Jamieson M. Cobleigh, George S. Avrunin, Lori A. Clarke, ACM Transactions on Sofware Engineering and Methodology. Vol. 17, Issue 2, April 2008. (UM-CS-2007-27)

This is an updated version of TR UM-CS-2007-07, which was originally dated August 2007. This report is a revised and extended version of UM-CS-2004-022, which appeared in ISSTA 2006.

[ ACM ] [ PDF ] [ Online-only Appendix ] [ Experimental Subjects ]

 2006

Breaking Up is Hard to Do: An Investigation of Decomposition for Assume-Guarantee Reasoning
Jamieson M. Cobleigh, George S. Avrunin, Lori A. Clarke, ACM SIGSOFT 2006 International Symposium on Software Testing and Analysis (ISSTA '06) Portland, ME, pp. 97-108, July 2006. (UM-CS-2004-022)

This is an updated version originally dated May 2004. Please see "Breaking Up is Hard to Do: An Evaluation of Automated Assume-Guarantee Reasoning" UM-CS-2007-27 for a revised and extended version of this report.

[ ACM ] [ PDF ] [ PDF with Appendix B ] [ Slides ]

 2004

Heuristic-Guided Counterexample Search in FLAVERS
Jianbin Tan, George S. Avrunin, Lori A. Clarke, Shlomo Zilberstein, Stefan Leue, ACM SIGSOFT 2004, 12th International Symposium on the Foundations of Software Engineering (FSE 12), Newport Beach, CA, pgs 201-210, November 2004. (UM-CS-2004-023)

[ ACM ] [ PDF ] [ Slides ]

 2001

The Right Algorithm at the Right Time: Comparing Data Flow Analysis Algorithms for Finite State Verification
Jamieson M. Cobleigh, Lori A. Clarke, Leon J. Osterweil, 23rd International Conference on Software Engineering (ICSE 2001), Toronto, Canada, pp. 37-46, May 2001. (UM-CS-2000-046)

[ PostScript ] [ PDF ] [ IEEE ]

 1999

Comparing Finite-State Verification Techniques for Concurrent Software
George S. Avrunin, James C. Corbett, Matthew B. Dwyer, Corina S. Pasareanu, Stephen F. Siegel, Department of Computer Science, University of Massachusetts, Amherst, MA 01003, November 1999. (UM-CS-1999-069)

[ PostScript ] [ PDF ]

Benchmarking Finite-State Verifiers
George S. Avrunin, James C. Corbett, Matthew B. Dwyer, Department of Computer Science, University of Massachusetts, Amherst, MA 01003, July 1999. (UM-CS-1999-048)

[ PostScript ] [ PDF ]

 1996

An Empirical Comparison of Static Concurrency Analysis Techniques
A.T. Chamillard, Lori A. Clarke, George S. Avrunin, Department of Computer Science, University of Massachusetts, Amherst, MA 01003, May 1997 (Revised). (UM-CS-1996-084)

[ PostScript ] [ PDF ]

 1995

An Exploratory Study of Program Metrics as Predictors of Reachability Analysis Performance
A.T. Chamillard, 5th European Software Engineering Conference (ESEC 1995), Sitges, Spain, pp. 343-361, September 1995. (UM-CS-1995-016)

[ PostScript ] [ PDF ]

Improving Static Analysis Accuracy on Concurrent Ada Programs: Complexity Results and Empirical Findings
A.T. Chamillard, Department of Computer Science, University of Massachusetts, Amherst, MA 01003, June 1995. (UM-CS-1995-049)

[ PostScript ] [ PDF ]

Notice: We present this material to ensure timely and wide dissemination of our work. All persons copying this material must adhere to the terms of the relevant copyrights
 

This site is maintained by the Laboratory for Advanced Software Engineering Research.
© 2011 University of Massachusetts AmherstSite Policies