![](bga.png)
Object-Oriented Real-Time Dependable Systems, San
Diego, CA , USA, pp. 0071-0071.
Gustafsson, J., Ermedahl, A., Sandberg, C. and Lisper, B.,
2006. Automatic derivation of loop bounds and
infeasible paths for WCET analysis using abstract
execution. Presented at the Proceedings of the 27th
IEEE International Real-Time Systems Symposium.
Gustafsson, J., 2000. Analyzing execution-time of Object-
Oriented programs using abstract interpretation. PhD
thesis, Department of Computer Systems, Information
Technology, Uppsala University.
Gustafsson, J., Ermedahl, A. and Lisper, B., 2006.
Algorithms for Infeasible Path Calculation. Sixth
International Workshop on Worst-Case Execution
Time Analysis, Dresden, Germany.
Hampapuram, H., Yang, Y. and Das, M., 2005. Symbolic
path simulation in path-sensitive dataflow analysis.
SIGSOFT Softw. Eng. Notes, vol. 31, pp. 52-58.
Hedley, D. and Hennell, M. A., 1985. The cause and
effects of infeasible paths in computer programs.
Presented at the Proceedings of the 8
th
International
Conference on Software Engineering, London,
England.
Khedker, U., Sanyal, A., Karkare, B., 2009. Data flow
analysis: theory and practice. Taylor and Francis.
Korel, B., 1996. Automated test data generation for
programs with procedures, SIGSOFT Softw. Eng.
Notes, vol. 21, pp. 209-215.
Liu, H. and Tan, H. B. K., 2009. Covering code behavior
on input validation in functional testing. In
Information and Software Technology, vol. 51(2), pp
546-553, 2009.
Liu, H. and Tan, H. B. K., 2008. Testing input validation
in web applications through automated model
recovery. In Journal of Systems and Software, vol.
81(2), pp. 222-233.
Malevris, N., Yates, D. F. and Veevers, A., 1990.
Predictive metric for likely feasibility of program
paths. Information and Software Technology, vol. 32,
pp. 115-118.
McMinn, P., 2004. Search-based software test data
generation: a survey: Research Articles. Softw. Test.
Verif. Reliab., vol. 14, pp. 105-156.
Moura, L. D. and Bjorner, N., 2008. Z3: an efficient SMT
solver. Presented at the Proceedings of the Theory and
practice of software, 14th international conference on
Tools and algorithms for the construction and analysis
of systems, Budapest, Hungary.
Ngo, M. N. and Tan, H. B. K., 2008. Applying static
analysis for automated extraction of database
interactions in web applications. In Information and
Software Technology, vol. 50(3), pp 160-175.
Ngo, M. N. and Tan, H. B. K., 2008. Heuristics-based
infeasible path detection for dynamic test data
generation. Inf. Softw. Technol., vol. 50, pp. 641-655.
Ngo, M. N. and Tan, H. B. K., 2007. Detecting Large
Number of Infeasible Paths through Recognizing their
Patterns. In Proceedings ESEC-FSE'07, Joint
European Software Engineering Conference and ACM
SIGSOFT Symposium on the Foundations of Software
Engineering, ACM Press, pp. 215-224.
Padmanabhuni, B. and Tan, H. B. K., 2011. Defending
against Buffer-Overflow Vulnerabilities. In IEEE
Computer, vol. 44 (11), pp 53-60.
Prather, R. E. and Myers, J. P., 1987. The Path Prefix
Software Engineering. IEEE Trans on Software
Engineering.
Robinson, A. J. A. and Voronkov, A., 2001. Handbook of
Automated Reasoning vol. II: North Holland.
Sen, K., Marinov, D. and Agha, G., 2005. CUTE: a
concolic unit testing engine for C. SIGSOFT Softw.
Eng. Notes, vol. 30, pp. 263-272.
Tahbildar, H. and Kalita, B., 2011. Automated Software
Test Data Generation: Direction of Research.
International Journal of Computer Science and
Engineering Survey, vol. 2, pp. 99-120.
Vergilio, S., Maldonado, J. and Jino, M., 1996. Infeasible
paths within the context of data flow based criteria. In
the VI International Conference on Software Quality,
Ottawa, Canada, pp.310–321.
Williams, N., 2010. Abstract path testing with
PathCrawler. Presented at the Proceedings of the 5th
Workshop on Automation of Software Test, Cape
Town, South Africa.
Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N.,
Thesing, S., Whalley, D., Bernat, G., Ferdinand, C.,
Heckmann, R., Mitra, T., Mueller, F., Puaut, I.,
Puschner, P., Staschulat, J. and Stenstrom, P., 2008.
The worst-case execution-time problem--overview of
methods and survey of tools. ACM Trans. Embed.
Comput. Syst., vol. 7, pp. 1-53.
Xie, T., Tillmann, N., Halleux, P. D. and Schulte, W.,
2009. Fitness-Guided Path Exploration in Dynamic
Symbolic Execution. Presented at the IEEE/IFIP
International Conference on Dependable Systems &
Networks, Lisbon.
Zhang, J. and Wang, X., 2001. A constraint solver and its
application to path feasibility analysis. International
Journal of Software Engineering and Knowledge
Engineering, vol. 11, pp. 139-156.
ENASE2012-7thInternationalConferenceonEvaluationofNovelSoftwareApproachestoSoftwareEngineering
52