Christian H. Stork

Ph.D. Student Department of Information and Computer Science University of California, Irvine Irvine, CA 92697-3425 Research Area: Computer Systems and Networks (CSN) Research Group: transPROse Advisor: Michael Franz Email: cstork@ics.uci.edu GPG Office: ICS-2 Building, Room 243 Phone: (949) 725-9451 From a former life: Diplom-Mathematiker, Heinrich-Heine-Universität Düsseldorf, 1998

Welcome to my homepage!

I'm grad student at UCI. Currently, my primary research interest lies in mobile code formats. This combines research in compiler construction and optimization, programming languages, data compression, and security.

Further interests of mine include parallel computer architecures, peer-to-peer technology, revision control systems, and semantically-aware editors.

Publications

• Efficiently Verifiable Escape Analysis by M. Beers, Ch. Stork, and M. Franz; in M. Odersky (Ed.), Proceedings of the 18th European Conference on Object-Oriented Programming (ECOOP 2004), Oslo, Norway, Springer Lecture Notes in Computer Science, Vol. 3086, ISBN 3-540-22159-X, pp. 75-95; June 2004. (A precursor to this paper was published as UCI ICS Technical Report No. 03-29.) (PDF)
• Making Mobile Code Both Safe And Efficient by M. Franz, W. Amme, M. Beers, N. Dalton, P. H. Fröhlich, V. Haldar, A. Hartmann, P. S. Housel, F. Reig, J. von Ronne, Ch. H. Stork, and S. Zhenochin; in J. Lala (Ed.), Foundations of Intrusion Tolerant Systems; IEEE Computer Society Press, ISBN 0-7695-2057-X, pp. 337-356; December 2003. (PDF)
• Online Verification of Offline Escape Analysis by Michael Franz, Vivek Haldar, Chandra Krintz, Christian H. Stork; Technical Report No. 02-21, Department of Information and Computer Science, University of California, Irvine; September 2002. (PDF)
• The Source is the Proof by Vivek Haldar, Christian H. Stork and Michael Franz; New Security Paradigms Workshop, September 2002. (PDF)
• Tamper-Proof Annotations, By Design by M. Franz, Ch. Krintz, V. Haldar, and Ch. H. Stork; Technical Report No. 02-10, Department of Information and Computer Science, University of California, Irvine; March 2002. (PDF)
• Towards Language-Agnostic Mobile Code by Christian H. Stork, Peter S. Housel, Vivek Haldar, Niall Dalton, and Michael Franz; in N. Benton and A. Kennedy (Eds.), Proceedings of the First Workshop on Multi-Language Infrastructure and Interoperability (BABEL'01), Florence, Italy; published as Electronic Notes in Theoretical Computer Science, 59:1, pp. 139-154; September 2001. (PDF)
• Compressed Abstract Syntax Trees for Mobile Code by Christian H. Stork and Vivek Haldar; Intermediate Representation Engineering Workshop (IRE 2001), Orlando, Florida; July 2001. (PDF)
• Project transPROse: Reconciling Mobile-Code Security With Execution Efficiency by Wolfram Amme, Niall Dalton, Peter H. Frohlich, Vivek Haldar, Peter S. Housel, Jeffrey von Ronne, Christian H. Stork, Sergiy Zhenochin, and Michael Franz; in Proceedings of the Second DARPA Information Survivability Conference and Exhibition (DISCEX II), Anaheim, California; IEEE Computer Society Press, ISBN 0-7695-1212-7, pp. II.196-II.210; June 2001. (PDF, Gzipped PS) A precursor to this paper was published as UCI ICS Technical Report No. 01-01.
• Generic Adaptive Syntax-Directed Compression for Mobile Code by Christian H. Stork, Vivek Haldar, and Michael Franz; Technical Report No. 00-42, Department of Information and Computer Science, University of California, Irvine; November 2000, revised April 2001. (PDF)
• Algorithmisches Lernen boolscher Formeln (in German, 69 pages) by Christian H. Stork; Diplomarbeit (diploma thesis) , Heinrich-Heine-Universität Düsseldorf, July 1998. (Gzipped PDF [526KB], Gzipped PS [163KB])

Talks

There were many, but only this one seems worth putting up here. ;-)

• Compressing Abstract Trees: Basic and Advanced Concepts given on 23 September 2003 for my workgroup. Note: This is a rather big 2.7MByte PDF file with many animations (produced via some involved Python and LaTeX hacking)!

Teaching

I taught ICS141 Programming Languages during summer session 2004.

I was teaching assistant for the following classes.

• Parallel Algorithms I (University of Cologne, Ewald Speckenmeyer)
• Parallel Algorithms II (University of Cologne, Ewald Speckenmeyer)
• Formal Languages (University of Cologne, Ewald Speckenmeyer)
• Advanced Compiler Construction (ICS211 at UCI, Michael Franz)
• Programming Languages (ICS141 at UCI, Susan Craw)

Community

• Programm Commitee Member: Workshop on Intermediate Representation Engineering for the Java Virtual Machine (IRE-2002), Trinity College, Dublin, Ireland June 13-14, 2002.

People

• Peter Fröhlich
• Silvia Likavec

Miscellanea

• Here's a little introduction to CVS which I wrote for my research group. Hopefully, we'll soon replace CVS by Subversion!
• An older term paper (now augmented with Strassen's algorithm):
  Exploring the Tera MTA by Example (as Gzipped PS) and the online version of the talk I gave in ICS245.

I welcome signed and encrypted email. Check out the GNU Privacy Guard for more information. Get my public key here or download it from any public keyserver, e.g. www.keyserver.net.

Oh, I forgot. Here are Thomas' French Laundry pics.

Chris Stork, 2005-04-02 (Don't use this email address. I use it to detect spam.)