Zhang M, Mathur U and Viswanathan M. Checking LTL[F,G,X] on compressed traces in polynomial time. Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. (131-143).

Yang C, Wu S and Chan W. (2016). Hierarchical Program Paths. ACM Transactions on Software Engineering and Methodology. 25:3. (1-44). Online publication date: 22-Aug-2016.

Railing B, Hein E and Conte T. (2015). Contech. ACM Transactions on Architecture and Code Optimization. 12:2. (1-24). Online publication date: 8-Jul-2015.

https://doi.org/10.1145/2776893

Krishnamoorthy S and Agarwal K. Scalable Communication Trace Compression. Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing. (408-417).

https://doi.org/10.1109/CCGRID.2010.111

Wang T and Roychoudhury A. (2008). Dynamic slicing on Java bytecode traces. ACM Transactions on Programming Languages and Systems. 30:2. (1-49). Online publication date: 1-Mar-2008.

https://doi.org/10.1145/1330017.1330021

Wang T and Roychoudhury A. Using Compressed Bytecode Traces for Slicing Java Programs. Proceedings of the 26th International Conference on Software Engineering. (512-521).

/doi/10.5555/998675.999455

Roychoudhury A. Depiction and playout of multi-threaded program executions. Proceedings of the 18th IEEE International Conference on Automated Software Engineering. (331-336).

https://doi.org/10.1109/ASE.2003.1240332

Alur R, Chaudhuri S, Etessami K, Guha S and Yannakakis M. (2003). Compression of Partially Ordered Strings. CONCUR 2003 - Concurrency Theory. 10.1007/978-3-540-45187-7_3. (42-56).

http://link.springer.com/10.1007/978-3-540-45187-7_3

Mohapatra D, Kumar R, Mall R, Kumar D and Bhasin M. (2006). Distributed dynamic slicing of Java programs. Journal of Systems and Software. 79:12. (1661-1678). Online publication date: 1-Dec-2006.

https://doi.org/10.1016/j.jss.2006.01.009