Berkeley Churchill

Research Interests

• Software Reliability and Security
• Type Systems
• Programing Language Design
• Software Verification
• Static Analysis
• Applied Category Theory
• functional programing, dependent types, web applications, dependent types, logic, automated theorem proving, combinatorics, graph theory, etc.

Current Projects

• General Game Playing (or, "General Problem Solving")
  It's not hard to program a computer to play a game, but it's very hard to program a computer to learn to play new games. I am working with Professor Genesereth this quarter on this problem, with the hope of applying results to automated reasoning in programing languages.
• Information Security in Reactive Systems.
  I am working with Professor Ben Hardekopf and Vineeth Kashyap on developing program analysis to check for secure information flow in Firefox Addons written in javascript. The goal is to automatically determine if an addon does not leak sensitive information without the user's consent.

Publications

• Churchill, B. R., and Lamagna, E. A. "Summing symbols in mutual recurrences." In Computing and Combinatorics, B. Fu and D.-Z. Du, Eds., vol. 6842 of Lecture Notes in Computer Science. Springer Berlin / Heidel- berg, 2011, pp. 531-542. preprint (pdf).
  The original publication is available from www.springerlink.com.
• Churchill, B. R., and Lamagna, E. A. "An Efficient Algorithm for Deriving Summation Identities from Mutual Recurrences". Discrete Mathematics, Algorithms and Applications. 04(02), 2012. preprint (pdf).

Slides

• Summing Symbols in Mutual Recurrences. These are slides to accompany my talk that I gave at COCOON 2011. They are based on the paper of the same name, the preprint of which is available above.
• Discovering 5-Valent Semi-Symmetric Graphs. A talk on my work at Northern Arizona University's Research Experience for Undergraduates (REU) program. Describes attempts at enumerating 5-valent semi-symmetric graphs and some results.

Resources

• My mathematics senior thesis on 5-valent semi-symmetric graphs pdf.
• See the current mini-census of regular, connected edge-transitive graphs. This includes data compiled from two other censuses, along with some graphs I discovered on my own.
• A detailed CV is available upon request.