- 1.Andrews, D.J. and Ince, D.C. (1995). Transformational Data Refinement and VDM. Information and Software Technology, 37 (11), pp. 637-651.]]Google ScholarCross Ref
- 2.Arunachalam, V. and Sasso, W. (1996). Cognitive Processes in Program Comprehension: An Empirical Analysis in the Context of Software Engineering. Journal of Systems and Software, 34, pp. 177-189.]] Google ScholarDigital Library
- 3.Badre, A. (1982). Designing Chunks for Sequentially Displayed Information, in Badre, A. and Shneiderman, B. (eds.), Directions in Human Computer Interaction, Ablex Publishing, pp. 179-193.]]Google Scholar
- 4.Baecker, R. M., Digiano, C., and Marcus, A. (1997). Software Visualization for Debugging. Communications Of The A CM, 40, 4, pp. 44-54.]] Google ScholarDigital Library
- 5.Barnes, J. G. P. (1984) Programming in Ada, Second Edition, Menlo Park, CA: Addison-Wesley.]] Google ScholarDigital Library
- 6.Basili, V., and Selby, R. (1987). Comparing the Effectiveness of Software Testing Strategies. IEEE Transactions on Software Engineering, SE-13, 12, pp.1278-1296.]] Google ScholarDigital Library
- 7.Cant, S.N., Jeffery, D.R., and Henderson-Sellers, B. (1995). A Conceptual Model of Cognitive Complexity of Elements of the Programming Process. Information and Software Technology, 37 (7), pp. 351-362.]]Google ScholarCross Ref
- 8.Cross, J. H. (1993). Improving Comprehensibility of Ada With Control Structure Diagrams. Proceedings of Software Technology Conference, April 11-14, 1994, Salt Lake City, UT (distributed on CD-ROM) 25 pages.]]Google Scholar
- 9.Cross, J.H., Maghsoodloo, S., and Hendrix, T.D. (1998). The Control Structure Diagram: An Initial Evaluation. Empirical Software Engineering. (to appear).]] Google ScholarDigital Library
- 10.Davis, J.S. (1984). Chunks: A Basis for Complexity Measurement. Information Processing and Management, 20 (1), pp. 119-127.]]Google ScholarCross Ref
- 11.Ehrlich, K. and Soloway, E. (1984). An Empirical Investigation of the Tacit Plan Knowledge in Programming. in Thomas, J.C. and Schneider, M.L. (eds.), Human Factors in Computer Systems, Ablex Publishing, pp. 113-133.]] Google ScholarDigital Library
- 12.Feldman, M.B. (1997). Software Construction and Data Structures with Ada 95. Addison-Wesley.]] Google ScholarDigital Library
- 13.Gilmore, D.J. and Green, T.R.G. (1985). The Comprehensibility of Programming Notations. in Shackel, B. (ed.), Human-Computer Interaction- Interact '84 IFIP, pp. 461-464.]]Google Scholar
- 14.Green, T.R.G, Sime, M.E., and Fitter, M.J. (1981). The Art of Notation. in Coombs, M.J. and Alty, J.L. (eds.), Computing Skills and the User Interface, Academic Press, pp. 221-251.]] Google ScholarDigital Library
- 15.Kintsch, W. (1977). Memory and Cognition, John Wiley.]]Google Scholar
- 16.Miller, G.A. (1956). The Magic Seven Plus or Minus Two. Some Limits on Our Capacity for Processing Information. Psychological Review, 63, pp. 81-97.]]Google ScholarCross Ref
- 17.Mills, H.D. (1988). Stepwise Refinement and Verification in Box-Structured Systems. IEEE Computer, June, pp. 23-36.]] Google ScholarDigital Library
- 18.Pennington, N. (1987). Stimulus Structures and Mental Representations in Expert Comprehension of Computer Programs. Cognitive Psychology, 19, pp. 295-341.]]Google ScholarCross Ref
- 19.Petre, Marian (1995). Why looking isn't always seeing: readership skills and graphical programming. Communications of the A CM, 38, 6, pp. 33-44.]] Google ScholarDigital Library
- 20.Raymond, D. (1991). Characterizing Visual Languages. Proceedings of the 1991 IEEE Workshop on Visual Languages, pp. 176-182.]]Google ScholarCross Ref
- 21.Shneiderman, B. and Mayer, R. (1979). Syntactic/Semantic Interactions in Programmer Behavior: A Model and Experimental Results. Int. Journal of Computer and Information Sciences, 8 (3), pp. 219-238.]]Google ScholarCross Ref
- 22.von Mayrhauser, A., and Vans, A.M. (1996). Identification of Dynamic Comprehension Processes During Large Scale Maintenance. IEEE Transactions on Software Engineering, 22, 6, pp. 424-437.]] Google ScholarDigital Library
Index Terms
- Visual support for incremental abstraction and refinement in Ada 95
Recommendations
Abstraction refinement for termination
SAS'05: Proceedings of the 12th international conference on Static AnalysisAbstraction can often lead to spurious counterexamples. Counterexample-guided abstraction refinement is a method of strengthening abstractions based on the analysis of these spurious counterexamples. For invariance properties, a counterexample is a ...
Compositional Abstraction Refinement for Timed Systems
TASE '10: Proceedings of the 2010 4th IEEE International Symposium on Theoretical Aspects of Software EngineeringModel checking suffers from the state explosion problem. Compositional abstraction and abstraction refinement have been investigated in many areas to address this problem. This paper considers the compositional model checking for timed systems. We ...
Comments