Nonlocal flow of control and Kleene algebra with tests

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 105-117

  Kozen, Dexter ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BOOLEAN ALGEBRA; COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS; DIFFERENTIATION (CALCULUS); INFORMATION THEORY; MATRIX ALGEBRA;

KLEENE ALGEBRA WITH TESTS; MULTI-LEVEL; NON LOCAL;

STRUCTURED PROGRAMMING;

EID: 51549098851     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.32     Document Type: Conference Paper

References (27)

1. A. Angus and D. Kozen. Kleene algebra, with tests a,nd program schematology. Technical Report TR.2001-1844, Computer Science Department, Cornell University, July 2001.
2. E. Ashcroft and Z. Manna. The translation of goto programs into while programs. In C. Freiman. J. Griffith, and J. Rosenfeld, editors, Proceedings of IFIP Congress γ1, volume 1, pages 250-255. North-Holland, 1972.
3. A. Barth and D. Kozen. Equational verification of cache blocking in LU decomposition using Kleene algebra with tests. Technical Report TR.2002-1865, Computer Science Department, Cornell University, June 2002.
4. J. A. Brzozowski. Derivatives of regular expressions. J. Assoc. Comput. Much., 11:481-494, 1964.
5. H. Chen and R. Pucella. A coalgebraic approach to Kleene algebra with tests. Electronic Notes in Theoretical Computer Science, 82(1), 2003.
6. E. Cohen. Hypotheses in Kleene algebra,. Technical Report TM-AR.H-023814, Bellcore, 1993. http://citeseer.nj.nec.com/1688.html.
7. E. Cohen. Lazy caching in Kleene algebra, 1994. http://citeseer.nj.nec. com/22581.html.
8. E. Cohen, D. Kozen, and F. Smith. The complexity of Kleene algebra, with tests. Technical Report TR96-1598, Computer Science Department, Cornell University, July 1996.
9. J. H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.
10. N. G. de Bruijn. Lambda calculus notation with nameless dummies: A tool for automatic formula manipulation, with application to the Church-Rosser theorem, Indagationes Mathematicae, 34:381-392, 1972.
11. K. Iwano and K. Steiglitz. A semiring on convex polygons and zero-sum cycle problems. SI AM J. Comput., 19(5):883-901, 1990.
12. D. M. Kaplan. Regular expressions and the equivalence of programs. J. Comput. Syst. Sci., 3:361-386, 1969.
13. S. C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3-41. Princeton University Press, Princeton. N.J., 1956.
14. S. R. Kosaraju. Analysis of structured programs. In Proc. 5th ACM Symp. Theory of Computing (STOC'γ3), pages 240-252, New York, NY, USA, 1973. ACM.
15. L. Kot and D. Kozen. Second-order abstract interpretation via Kleene algebra,. Technical Report TR2004-1971, Computer Science Department, Cornell University, December 2004.
16. L. Kot and D. Kozen. Kleene algebra and bytecode verification. In F. Spoto, editor, Proc. 1st Workshop Bytecode Semantics, Verification, Analysis, and Transformation (Bytecode '05), pages 201-215. April 2005.
17. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput., 110(2):366-390, May 1994.
18. D. Kozen. Kleene algebra with tests. Transactions on Programming Languages and Systems, 19(3):427-443, May 1997.
19. D. Kozen. On Hoare logic and Kleene algebra with tests. Trans. Computational Logic, 1(1):60-76. July 2000.
20. D. Kozen. Automata on guarded strings and applications. Matematica Contempordnea, 24:117-139, 2003.
21. D. Kozen. Kleene algebras with tests and the static analysis of programs. Technical Report TR.2003-1915. Computer Science Department, Cornell University, November 2003.
22. D. Kozen. On the coalgebraic theory of Kleene algebra, with tests. Technical Report http://hdl. handle.net/1813/10173, Computing and Information Science, Cornell University, March 2008.
23. D. Kozen and M.-C. Patron. Certification of compiler optimizations using Kleene algebra, with tests. In J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, and P. J. Stuckey, editors, Proc. 1st Int. Conf. Computational Logic (CL2000), volume 1861 of Lecture Notes in Artificial Intelligence, pages 568-582, London, July 2000. Springer-Verlag.
24. D. Kozen and F. Smith. Kleene algebra with tests: Completeness and decidability. In D. van Dalen and M. Bezem, editors, Proc. 10th Int. Workshop Computer Science Logic (CSL'96), volume 1258 of Lecture Notes in Computer Science, pages 244-259, Utrecht, The Netherlands, September 1996. Springer-Verlag.
25. D. Kozen and W.-L. D. Tseng. The Bohm-Jacopini theorem is false, propositionally. Technical Report http://hdl.handle.net/1813/9478, Computing and Information Science, Cornell University, January 2008. Proc. 9th Int. Conf. Mathematics of Program Construction (MPC'08), July 2008, to appear.
26. W. Peterson, T. Kasarni, and N. Tokura. On the capabilities of while, repeat, and exit statements. Comm. Assoc. Comput. Mack., 16(8):503-512, 1973.
27. J. Worthington. Automatic proof generation in kleene algebra. In R. Berghammer, B. Möller, and G. Struth, editors, 10th Int. Conf. Relational Methods in Computer Science (RelMiCS10) and 5th Int. Conf. Applications of Kleene Algebra (AKA5), volume 4988 of Led. Notes in Computer Science, pages 382-396. Springer-Verlag, 2008.