Useless-code elimination and program slicing for the pi-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2895, Issue , 2003, Pages 55-72

  Kobayashi, Naoki ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS);

FORMAL CORRECTNESS; PI CALCULUS; PROGRAM SLICING; PROGRAM TRANSFORMATIONS; TRANSFORMATION METHODS;

CALCULATIONS;

EID: 0345445955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40018-9_5     Document Type: Article

References (25)

1. M. Abadi. Secrecy by typing in security protocols. Journal of the Association for Computing Machinery (JACM), 46(5):749-786, 1999.
2. M. Abadi, A. Banerjee, N. Heintze, and J. G. Rieck. A core calculus of dependency. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 147-169, 1999.
3. S. Berardi, M. Coppo, F. Damiani, and P. Giannini. Type-based useless-code elimination for functional programs. In Proceedings of SAIG 2000, volume 1924 of Lecture Notes in Computer Science, pages 172-189. Springer-Verlag, 2000.
4. L. Cardelli, G. Ghelli, and A. D. Gordon. Secrecy and group creation. In Proceedings of CONCUR 2000, volume 1877 of Lecture Notes in Computer Science, pages 365-379. Springer-Verlag, 2000.
5. J. Cheng. Slicing concurrent programs - a graph-theoretical approach. In Automated and Algorithmic Debugging, volume 749 of Lecture Notes in Computer Science, pages 223-240. Springer-Verlag, 1993.
6. F. Damiani. Useless-code detection and elimination for pcf with algebraic data types. In Proceedings of TLCA'99, volume 1581 of Lecture Notes in Computer Science, pages 83-97. Springer-Verlag, 1999.
7. A. D. Gordon and A. Jeffrey. Authenticity by typing for security protocols. In Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW 2001), pages 145-159. IEEE Computer Society Press, 2001.
8. M. Harman and R. M. Hierons. An overview of program slicing. Software Focus, 2(3):85-92, 2001.
9. J. Hatcliff, J. Corbett, M. Dwyer, S. Sokolowski, and H. Zheng. A formal stufy of slicing for multi-threaded programs with jvm concurrency primitives. In Proceedings of SAS'99, volume 1694 of Lecture Notes in Computer Science, pages 1-18. Springer-Verlag, 1999.
10. K. Honda and N. Yoshida. A uniform type structure for secure information flow. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 81-92, 2002.
11. N. Kobayashi. Type-based useless variable elimination. Higher-Order and Symbolic Computation, 14(2-3):221-260, 2001.
12. N. Kobayashi. A type system for lock-free processes. Information and Computation, 177:122-159, 2002.
13. N. Kobayashi. Type-based information flow analysis for the pi-calculus, submitted, 2003.
14. J. Krinke. Static slicing of threaded programs. In Proc. ACM SIGPLAN/SIGFSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE'98), pages 35-42, Montreal, Canada, June 1998.
15. ACM SIGPLAN Notices 33(7).
16. R. Milner. Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, 1999.
17. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, 1997.
18. R. D. Nicola and M. C. B. Hennessy. Testing equivalence for processes. Theoretical Computer Science, 34:83-133, 1984.
19. F. Pottier. A simple view of type-secure information flow in the π-calculus. In Proceedings of the 15th IEEE Computer Security Foundations Workshop, pages 320-330, 2002.
20. T. Reps and T. Turnidge. Program specialization via program slicing. In Proceedings of the Dagstuhl Seminar on Partial Evaluation, volume 1110 of Lecture Notes in Computer Science, pages 409-429, 1996.
21. D. Sangiorgi. The name discipline of uniform receptiveness. Theoretical Computer Science, 221(1-2):457-493, 1999.
22. D. Sangiorgi and D. Walker. The Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
23. F. Tip. A survey of program slicing techniques. Journal of Programming Languages, 3:121-181, 1995.
24. M. Wand and I. Siveroni. Constraint systems for useless variable elimination. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 291-302, 1999.
25. J. Zhao. Slicing concurrent Java programs. In Proceedings of the 7th IEEE International Workshop on Program Comprehension, pages 126-133, May 1999.