research-article

Verification of Architectural Constraints on Sequences of Method Invocations

Authors:

Stuart Siroky,

Rodion Podorozhny,

Guowei YangAuthors Info & Claims

ACM SIGSOFT Software Engineering Notes, Volume 40, Issue 1

Pages 1 - 4

https://doi.org/10.1145/2693208.2693246

Published: 06 February 2015 Publication History

Get Access

Abstract

The importance of correspondence between the architectural prescription and implementation has been long recognized. This paper presents an approach to verification of constraints on method invocation chains prescribed by an architectural style. It consists of two key steps. One, static backward and forward search is applied on the call graph of the system, to find all potential paths between the initial method and the final method prescribed in the architecture. Two, symbolic execution is applied to check the feasibility of those potential paths and generate tests for all feasible ones to check the correspondence. We implement our approach in a prototype based on Soot and Symbolic PathFinder (SPF), and demonstrate the usefulness of our approach using a case study.

References

[1]

J. Aldrich, C. Chambers, and D. Notkin. Archjava: Connecting software architecture to implementation. In Proceedings of the 24th International Conference on Software Engineering, ICSE '02, pages 187--197, New York, NY, USA, 2002. ACM.

Digital Library

Google Scholar

[2]

R. Allen. A Formal Approach to Software Architecture. PhD thesis, Carnegie Mellon, School of Computer Science, January 1997. Issued as CMU Technical Report CMU-CS-97-144.

Digital Library

Google Scholar

[3]

L. A. Clarke. A program testing system. In Proc. of the 1976 annual conference, ACM '76, pages 488--491, 1976.

Digital Library

Google Scholar

[4]

J. Hunt. You've got the model-view-controller. Planet Java.

Google Scholar

[5]

J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385--394, 1976.

Digital Library

Google Scholar

[6]

G. E. Krasner and S. T. Pope. A cookbook for using the model-view controller user interface paradigm in smalltalk-80. J. Object Oriented Program., 1(3):26--49, Aug. 1988.

Digital Library

Google Scholar

[7]

K.-K. Ma, K. Y. Phang, J. S. Foster, and M. Hicks. Directed symbolic execution. In Proceedings of the 18th International Conference on Static Analysis, SAS'11, pages 95--111, Berlin, Heidelberg, 2011. Springer-Verlag.

Digital Library

Google Scholar

[8]

D. E. Perry and A. L. Wolf. Foundations for the study of software architecture. SIGSOFT Softw. Eng. Notes, 17(4):40--52, Oct. 1992.

Digital Library

Google Scholar

[9]

C. S. Păsăreanu and N. Rungta. Symbolic PathFinder: symbolic execution of Java bytecode. In ASE, pages 179--180, 2010.

Digital Library

Google Scholar

[10]

R. Vallée-Rai, P. Co, E. Gagnon, L. J. Hendren, P. Lam, and V. Sundaresan. Soot - a java bytecode optimization framework. In CASCON, page 13, 1999.

Digital Library

Google Scholar

Recommendations

Verification of MPI programs using CIVL
EuroMPI '17: Proceedings of the 24th European MPI Users' Group Meeting

CIVL is a framework for verifying concurrent programs. The framework is built around a language, CIVL-C, that extends sequential C with general-purpose primitives that can be used to model a variety of concurrency dialects, including OpenMP, Pthreads, ...
Leading-edge Ada verification technologies: highly automated Ada contract checking using bakar kiasan
HILT '12: Proceedings of the 2012 ACM conference on High integrity language technology

This tutorial presents a new approach to Spark/Ada contract checking using Bakar Kiasan--a highly automated, evidence-based symbolic execution tool. Bakar Kiasan aims to lower the barrier of entry and reduce the burden of engineers as they specify and ...
Using symbolic execution for verifying safety-critical systems

Safety critical systems require to be highly reliable and thus special care is taken when verifying them in order to increase the confidence in their behavior. This paper addresses the problem of formal verification of safety critical systems by ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes

ACM SIGSOFT Software Engineering Notes Volume 40, Issue 1

January 2015

237 pages

ISSN:0163-5948

DOI:10.1145/2693208

Editor:
Michael Wing

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 February 2015

Published in SIGSOFT Volume 40, Issue 1

Check for updates

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
74
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

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

Recommendations

Verification of MPI programs using CIVL

Leading-edge Ada verification technologies: highly automated Ada contract checking using bakar kiasan

Using symbolic execution for verifying safety-critical systems

Comments

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Login options

Full Access

PDF

eReader

Abstract

References

Recommendations

Verification of MPI programs using CIVL

Leading-edge Ada verification technologies: highly automated Ada contract checking using bakar kiasan

Using symbolic execution for verifying safety-critical systems

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations