Improving the efficiency of dependency analysis in logical decision models

ASE2009 - 24th IEEE/ACM International Conference on Automated Software Engineering

Volumn , Issue , 2009, Pages 173-184

  Wong, Sunny ^a   Cai, Yuanfang ^a  

^a Drexel University   (United States)

Author keywords

Augmented constraint network; Dependency analysis

Indexed keywords

CONSTRAINT NETWORKS; CONSTRAINT SOLVING; DEPENDENCE RELATION; DEPENDENCY ANALYSIS; DEPENDENCY RELATION; DESIGN DECISIONS; DESIGN STRUCTURE MATRICES; EXTRACTION METHOD; LOGICAL DECISIONS; REAL SOFTWARES; RUNNING TIME; SOFTWARE ARTIFACTS; SOFTWARE SYSTEMS; SPECIAL FORMS;

COMPUTER SOFTWARE; DESIGN;

SOFTWARE DESIGN;

EID: 77952230314     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2009.55     Document Type: Conference Paper

References (45)

1. D. L. Parnas, "On the criteria to be used in decomposing systems into modules," Communications of the ACM, vol.15, no.12, pp. 1053-1058, Dec. 1972.
2. M. Cataldo, P. Wagstrom, J. D. Herbsleb, and K. M. Carley, "Identification of coordination requirements: Implications for the design of collaboration and awareness tools," in Proc. ACM Conference on Computer Supported Cooperative Work, Nov. 2006, pp. 353-362. (Pubitemid 47112424)
3. C. Y. Baldwin and K. B. Clark, Design Rules, Vol.1: The Power of Modularity. MIT Press, 2000.
4. H. Gall, K. Hajek, and M. Jazayeri, "Detection of logical coupling based on product release history," in Proc. 14th IEEE International Conference on Software Maintenance, Nov. 1998, pp. 190-197.
5. Y. Cai and K. J. Sullivan, "Simon: A tool for logical design space modeling and analysis," in Proc. 20th IEEE/ACM International Conference on Automated Software Engineering, Nov. 2005, pp. 329-332.
6. K. J. Sullivan, W. G. Griswold, Y. Cai, and B. Hallen, "The structure and value of modularity in software design," in Proc. 8th ACM SIGSOFT International Symposium on the Foundations of Software Engineering, Sep. 2001, pp. 99-108. (Pubitemid 35466915)
7. Y. Cai, "Modularity in design: Formal modeling and automated analysis," Ph.D. dissertation, University of Virginia, Aug. 2006.
8. Y. Cai, S. Huynh, and T. Xie, "A framework and tools support for testing modularity of software design," in Proc. 22nd IEEE/ACM International Conference on Automated Software Engineering, Nov. 2007, pp. 441-444
9. K. Sethi, Y. Cai, S. Wong, A. Garcia, and C. Sant'Anna, "From retrospect to prospect: Assessing modularity and stability from software architecture," in Proc. 8th Working IEEE/IFIP International Conference on Software Architecture, Sep. 2009.
10. S. Huynh, Y. Cai, Y. Song, and K. Sullivan, "Automatic modularity conformance checking," in Proc. 30th International Conference on Software Engineering, May 2008, pp. 411-420.
11. E. M. Clarke, O. Grumberg, and D. A. Peled, Model Checking. MIT Press, 1999.
12. D. Jackson, "Alloy: A lightweight object modeling notation," ACM Transactions on Software Engineering and Methodology, vol.11, no.2, pp. 256-290, 2002. (Pubitemid 44159313)
13. J. M. Spivey, The Z Notation: A Reference Manual, 2nd ed. Prentice Hall, 1992.
14. S. Wong and Y. Cai, "Predicting change impact from logical models," in Proc. 25th IEEE International Conference on Software Maintenance, Sep. 2009.
15. K. Sethi, "From retrospect to prospect: Assessing modularity and stability from software architecture," Master's thesis, Drexel University, Jun. 2009.
16. Y. Cai and K. J. Sullivan, "Modularity analysis of logical design models," in Proc. 21st IEEE/ACM International Conference on Automated Software Engineering, Sep. 2006, pp. 91-102.
17. A. Mackworth, "Consistency in networks of relations," Artificial Intelligence, vol.8, no.1, pp. 99-118, 1977.
18. F. Bacchus and P. van Beek, "On the conversion between non-binary and binary constraint satisfaction problems," in Proc. 15th AAAI Conference on Artificial Intelligence, Jul. 1998, pp. 310-318.
19. S. Even, A. Itai, and A. Shamir, "On the complexity of timetable and multicommodity flow problems," SIAM Journal of Computing, vol.5, no.4, pp. 691-703, 1976.
20. B. Aspvall, M. F. Plass, and R. E. Tarjan, "A linear-time algorithm for testing the truth of certain quantified boolean formulas," Information Processing Letters, vol.8, no.3, pp. 121-123, Mar. 1979.
21. T. Feder, "Network flow and 2-satisfiability," Algorithmica, vol.11, no.3, pp. 291-319, 1994.
22. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, "Progress on the state explosion problem in model checking," in Informatics, 2001, pp. 176-194.
23. R. Tarjan, "Depth-first search and linear graph algorithms," SIAM Journal of Computing, vol.1, no.2, pp. 146-160, Jun. 1972.
24. C. V. Lopes and S. K. Bajracharya, "An analaysis of modularity in aspect-oriented design," in Proc. 4th International Conference on Aspect-Oriented Software Development, Mar. 2005, pp. 15-26.
25. K. J. Sullivan, W. Griswold, Y. Song, Y. Cai, M. Shonle, N. Tewari, and H. Rajan, "Information hiding interfaces for aspect-oriented design," in Proc. 10th ACM SIGSOFT International Symposium on the Foundations of Software Engineering, Sep. 2005, pp. 166-175.
26. A. MacCormack, J. Rusnak, and C. Y. Baldwin, "Exploring the structure of complex software designs: An empirical study of open source and proprietary code," Management Science, vol.52, no.7, pp. 1015-1030, Jul. 2006.
27. N. Sangal, E. Jordan, V. Sinha, and D. Jackson, "Using dependency models to manage complex software architecture," in Proc. 20th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Oct. 2005, pp. 167-176.
28. J. Hannemann and G. Kiczales, "Design pattern implementation in Java and AspectJ," in Proc. 17th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Nov. 2002, pp. 161-173.
29. E. Gamma, R. Helm, R. Johnson, and J. M. Vlissides, Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Nov. 1994.
30. K. J. Sullivan, J. B. Dugan, and D. Coppit, "The Galileo fault tree analysis tool," in Proc. 29th International Symposium on Fault-Tolerant Computing, Jun. 1999, pp. 232-235
31. J. Liebeherr and T. K. Beam, "Hypercast: A protocol for maintaining multicast group members in a logical hypercube topology," in Networked Group Communication, 1999, pp. 72-89.
32. Y. Cai and S. Huynh, "A case study of integrating design rule theory and analytical decision models into a software development process," Drexel University, Tech. Rep. DU-CS-08-102, Apr. 2008, https://www.cs.drexel. edu/content/uploads/Research/DU-CS-08-02.pdf.
33. E. Figueiredo, N. Cacho, C. Sant'Anna, M. Monteiro, U. Kulesza, A. Garcia, S. Soares, F. Ferrari, S. Khan, F. C. Filho, and F. Dantas, "Evolving software product lines with aspects: An empirical study on design stability," in Proc. 30th International Conference on Software Engineering, May 2008, pp. 261-270.
34. E. Torlak, "A constraint solver for software engineering: Finding models and cores of large relational specifications," Ph.D. dissertation, Massachusetts Institute of Technology, Feb. 2009.
35. M. Dyer, A. Frieze, and M. Molloy, "A probabilistic analysis of randomly generated binary constraint," Theoretical Computer Science, vol.290, no.3, pp. 1815-1828, 2003.
36. A. Frieze and M. Molloy, "The satisfiability threshold for randomly generated binary constraint satisfaction problems," Random Structures and Algorithms, vol.28, no.3, pp. 323-339, 2006.
37. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2003.
38. S. Bawa and G. K. Sharma, "A parallel transitive closure computation algorithm for VLSI test generation," in Proc. 6th International Conference on Applied Parallel Computing Advanced Scientific Computing, Jun. 2002, pp. 243-252.
39. P. Alexander, R. Kamath, and D. Barton, "System specification in Rosetta," in Proc. 7th IEEE International Symposium on Engineering of Computer-Based Systems, Apr. 2000, pp. 299-307.
40. R. E. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Transactions on Computers, vol.35, no.8, pp. 677-691, 1986.
41. 20 states and beyond," in Proc. 5th Symposium on Logic in Computer Science, Jun. 1990, pp. 428-439.
42. E. M. Clarke, O. Grumberg, M. Minea, and D. Peled, "State space reduction using partial ordering techniques," International Journal on Software Tools for Technology Transfer, vol.2, no.3, pp. 279-287, 1998.
43. J. R. Burch, E. M. Clarke, and D. E. Long, "Symbolic model checking with partitioned transition relations," in Proc. International Conference on Very Large Scale Integration, Aug. 1991, pp. 49-58.
44. D. Marinov, S. Khurshid, S. Bugrara, L. Zhang, and M. Rinard, "Optimizations for compiling declarative models into boolean formulas," in Proc. 8th International Conference on Theory and Applications of Satisfiability Testing, Jun. 2005, pp. 187-202.
45. S. Khurshid, D. Marinov, I. Shlyakhter, and D. Jackson, "A case for efficient solution enumeration," in Proc. 6th International Conference on Theory and Applications of Satisfiability Testing, May 2003, pp. 272-286.