Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams

Dynamic slicing algorithms can greatly reduce the debuggingeffort by focusing the attention of the user on a relevantsubset of program statements. Recently algorithms forforward computation of dynamic slices have beenproposed which maintain dynamic slices of all variables asthe program executes. An...

Full description

Saved in:

Bibliographic Details
Published in:	International Conference on Software Engineering: Proceedings of the 26th International Conference on Software Engineering; 23-28 May 2004 pp. 502 - 511
Main Authors:	Zhang, Xiangyu, Gupta, Rajiv, Zhang, Youtao
Format:	Conference Proceeding
Language:	English
Published:	Washington, DC, USA IEEE Computer Society 23.05.2004
Series:	ACM Conferences
Subjects:	Applied computing > Physical sciences and engineering > Mathematics and statistics Applied sciences Computer science; control theory; systems Exact sciences and technology Mathematics of computing > Discrete mathematics Software Software and its engineering > Software creation and management > Software verification and validation > Process validation > Traceability Software and its engineering > Software creation and management > Software verification and validation > Software defect analysis > Software testing and debugging Software engineering Theory of computation > Models of computation > Abstract machines Binary decision diagram Dynamic characteristic Software development Program execution Debugging Dynamic properties Slicing Reduced order systems
ISBN:	9780769521633, 0769521630
ISSN:	0270-5257
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!