Jari Stenman

I am a Ph.D. student in Computer Science at Uppsala University, Sweden. I started in September 2011, under the supervision of Parosh Abdulla and Mohamed Faouzi Atig. I am a member of the Algorithmic Program Verification group.

Research Interests

My main interest is in the theory of computation. I have mostly been working with quantitiative extensions of Pushdown Automata. I am also interested in automated methods for improving software quality, particularly model checking.

Publications

Conference Papers

• • Pushdown Systems with Budgets
  • Parosh Abdulla, Mohamed Faouzi Atig, Othmane Rezine, and Jari Stenman
  • 12th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2012), Cambridge, UK
  • (PDF)
• • Dense-timed Pushdown Automata
  • Parosh Abdulla, Mohamed Faouzi Atig, and Jari Stenman
  • 27th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2012), Dubrovnik, Croatia
  • (PDF)
• • The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
  • Parosh Abdulla, Mohamed Faouzi Atig, and Jari Stenman
  • 6th International Conference on Language and Automata Theory and Applications (LATA 2012), A Coruña, Spain
  • (PDF)

Tutorial Papers

• • Adding Time to Pushdown Automata
  • Parosh Abdulla, Mohamed Faouzi Atig, and Jari Stenman
  • 1st workshop on Quantities in Formal Methods (QFM 2012), Paris, France
  • (PDF)

Teaching

I have been a teaching assistant in the following courses:

• Algorithms and Data Structures I, Fall 2012
• Distributed Systems, Spring 2012
• Algorithms and Data Structures I, Fall 2011
• Algebra I, Fall 2011
• Introduction to Mathematics, Fall 2011