Article

Free access

Task interaction graphs for concurrency analysis

Authors:

Douglas L. Long,

Lori A. ClarkeAuthors Info & Claims

ICSE '89: Proceedings of the 11th international conference on Software engineering

Pages 44 - 52

https://doi.org/10.1145/74587.74592

Published: 15 May 1989 Publication History

PDF eReader

References

[1]

Reference Manual for the Ada Programming Language (ANSI/MIL-STD-iSiSA), United States Department of Defense, Washington, D.C., January 1983.

Google Scholar

[2]

George S. Avrunin, Laura K. Dillon, Jack C. Wileden, and WiIliam E. Riddle. Constrained Expressions: Adding Analysis Capabilities to Design Methods for Concurrent Software Systems. Dept. of Comp. and Info. Science, University of Massachusetts, Amherst, Technical Report 85-13, May 1985.

Google Scholar

[3]

Per Brinch Hansen. Distributed Processes: A Concurrent Programming Concept. Communications of the ACM, 21(11):934-941, November 1978.

Digital Library

Google Scholar

[4]

G. Bristow, C. Drey, B. Edwards and W. Riddle. Anomaly Detection in Concurrent Programs. Proceedings of the 4th International Conference on Software Engineering, 265-273, 1979.

Digital Library

Google Scholar

[5]

Richard DeMiIIo and Raymond Miller. Implicit Com- -putation of Synchronization Primitives. Information Processing Letters, 9( 1):35-38, July 1979.

Google Scholar

[6]

Laura K. Dillon. Symbolic Execution-Based Verification of Ada Tasking Programs. Proceedings of the Third International IEEE Conference on Ada Applications and Environments, 3-13, May 1988.

Google Scholar

[7]

David Helmbold and David Luckham. Debugging Ada Tasking Programs. IEEE Software, 2(2):47-57, March 1985.

Digital Library

Google Scholar

[8]

C. A. Il. Hoare. Communicating Sequential Processes. Communications of the ACM, 21(8):666-677, August 1978.

Digital Library

Google Scholar

[9]

L.J. Harrison and R.A. Kemmerer. An Interleaving Symbolic Execution Approach for the Formal Verification of Ada Programs with Tasking. Proceedings of the Third International IEEE Conference on Ada Applications and Environments, 3-13, May 1988.

Crossref

Google Scholar

[10]

Douglas L. Long and Lori A. Clarke. Task Interaction Graphs: A Representation For Concurrency Analysis. Department of Computer & Information Science, University of Massachusetts, Amherst, March 1988.

Digital Library

Google Scholar

[11]

E. Timothy Morgan and Rami Il. Razouk. Interactive State-Space Analysis of Concurrent Systems. IEEE Transactions on Soflware Engineering, SE-13(10):1080- 1091, October 1987.

Digital Library

Google Scholar

[12]

S. M. Shatz and W. K. Cheng. A Petri Net Framework for Automated Static Analysis of Ada Tasking Behavior. Journd of Systems and Software, 8(5):343-359.

Digital Library

Google Scholar

[13]

K.C. Tai. On Testing Concurrent Programs. Proceedings of COMPSAC 85, 310-317, October 1985.

Google Scholar

[14]

Richard N. Taylor and Leon J. Osterweil. Anomaly Detection In Concurrent Software By Static Data Flow Analysis. IEEE Transactions on Software Engineering, SE-6(3):265-278, May 1980.

Digital Library

Google Scholar

[15]

Richard N. Taylor. Complexity of Analyzing the Synchronization Structure of Concurrent Programs. Acta Inform&x, 19:57-84, 1983.

Google Scholar

[16]

Richard N. Taylor. A General-Purpose Algorithm For Analyzing Concurrent Programs. Communications of the ACM, 26(5):362-376, May 1983.

Digital Library

Google Scholar

[17]

Gordon K. Wampler. A Static Concurrency Analysis Tool for Ada (SCA). Master's Dissertation, University of California, Irvine, 1985.

Google Scholar

[18]

MichaI Young and Richard N. Taylor. Combining Static Concurrency Analysis With Symbolic Execution. In Proceedings of the Workshop on Software Testing:170-178, IEEE Computer Society Press, July 1986.

Google Scholar

Cited By

View all

Soomro PSasongko MUnat D(2018)BindMe: A thread binding library with advanced mapping algorithmsConcurrency and Computation: Practice and Experience10.1002/cpe.469230:21Online publication date: 25-Jun-2018
https://doi.org/10.1002/cpe.4692
Diener MCruz EAlves MNavaux P(2016)Communication in Shared Memory: Concepts, Definitions, and Efficient Detection2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)10.1109/PDP.2016.16(151-158)Online publication date: Feb-2016
https://doi.org/10.1109/PDP.2016.16
Railing BHein EConte T(2015)ContechACM Transactions on Architecture and Code Optimization10.1145/277689312:2(1-24)Online publication date: 8-Jul-2015
https://dl.acm.org/doi/10.1145/2776893
Show More Cited By

Index Terms

Task interaction graphs for concurrency analysis

Recommendations

Task Interaction Graphs for Concurrency Analysis
Task Interaction Graph: An Intermediate Representation for Concurrency
Comparability Graphs Among Cover-Incomparability Graphs
Algorithms and Discrete Applied Mathematics
Abstract
Comparability graphs and cover-incomparability graphs (C-I graphs) are two interesting classes of graphs from posets. Comparability graph of a poset $P = (V, \leq)$ is a graph with vertex set V and two vertices u and v are adjacent in V if u and v are ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICSE '89: Proceedings of the 11th international conference on Software engineering

May 1989

406 pages

ISBN:0818619414

DOI:10.1145/74587

Chairmen:
Larry Druffel
Software Engineering Institute
,
Dick Fairley
Software Engineering Institute
,
Dines Bjørner

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 May 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICSE89

Sponsor:

SIGSOFT

ICSE89: Int'l Conference on Software Engineering

Pennsylvania, Pittsburgh, USA

Acceptance Rates

Overall Acceptance Rate 276 of 1,856 submissions, 15%

Upcoming Conference

ICSE 2025

2025 IEEE/ACM 46th International Conference on Software Engineering

April 26 - May 3, 2025

Ottawa , ON , Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

55
Total Citations
View Citations
809
Total Downloads

Downloads (Last 12 months)118
Downloads (Last 6 weeks)14

Reflects downloads up to 17 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Soomro PSasongko MUnat D(2018)BindMe: A thread binding library with advanced mapping algorithmsConcurrency and Computation: Practice and Experience10.1002/cpe.469230:21Online publication date: 25-Jun-2018
https://doi.org/10.1002/cpe.4692
Diener MCruz EAlves MNavaux P(2016)Communication in Shared Memory: Concepts, Definitions, and Efficient Detection2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)10.1109/PDP.2016.16(151-158)Online publication date: Feb-2016
https://doi.org/10.1109/PDP.2016.16
Railing BHein EConte T(2015)ContechACM Transactions on Architecture and Code Optimization10.1145/277689312:2(1-24)Online publication date: 8-Jul-2015
https://dl.acm.org/doi/10.1145/2776893
Ding ZZhou MWang S(2014)Ordinary Differential Equation-Based Deadlock DetectionIEEE Transactions on Systems, Man, and Cybernetics: Systems10.1109/TSMC.2014.231175744:10(1435-1454)Online publication date: Oct-2014
https://doi.org/10.1109/TSMC.2014.2311757
Ma JHan WDing Z(2012)Behavior Analysis of Software Systems Based on Petri Net SlicingIntelligent Computing Technology10.1007/978-3-642-31588-6_61(475-482)Online publication date: 2012
https://doi.org/10.1007/978-3-642-31588-6_61
Couturier RLaiymani DMiquée S(2011)MAHEVE: An Efficient Reliable Mapping of Asynchronous Iterative Applications on Volatile and Heterogeneous EnvironmentsEuro-Par 2010 Parallel Processing Workshops10.1007/978-3-642-21878-1_5(31-39)Online publication date: 2011
https://doi.org/10.1007/978-3-642-21878-1_5
(2011)Issues Encountered in Building a Flexible Software Development EnvironmentEngineering of Software10.1007/978-3-642-19823-6_14(265-287)Online publication date: 2011
https://doi.org/10.1007/978-3-642-19823-6_14
Couturier RLaiymani DMiquée S(2010)MAHEVEProceedings of the 2010 conference on Parallel processing10.5555/2031978.2031984(31-39)Online publication date: 31-Aug-2010
https://dl.acm.org/doi/10.5555/2031978.2031984
Ganai MWang C(2010)Interval analysis for concurrent trace programs using transaction sequence graphsProceedings of the First international conference on Runtime verification10.5555/1939399.1939422(253-269)Online publication date: 1-Nov-2010
https://dl.acm.org/doi/10.5555/1939399.1939422
Couturier RLaiymani DMiquee S(2010)Mapping asynchronous iterative applications on heterogeneous distributed architectures2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)10.1109/IPDPSW.2010.5470762(1-8)Online publication date: Apr-2010
https://doi.org/10.1109/IPDPSW.2010.5470762
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Task Interaction Graphs for Concurrency Analysis

Task Interaction Graph: An Intermediate Representation for Concurrency

Comparability Graphs Among Cover-Incomparability Graphs