I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications by René Neumann

2015

Peter Lammich and Rene Neumann. A framework for verifying depth-first search algorithms. In CPP, January 2015.
Info

2014

Rene Neumann. Using Promela in a fully verified executable LTL model checker. In Dimitra Giannakopoulou and Daniel Kroening, editors, Verified Software: Theories, Tools and Experiments, Lecture Notes in Computer Science, pages 105–114, July 2014.
Info
Javier Esparza, Peter Lammich, Rene Neumann, Tobias Nipkow, Alexander Schimpf, and Jan-Georg Smaus. A fully verified executable LTL model checker. Archive of Formal Proofs, May 2014. Formal proof development.
Info
See afp.sf.net ...
Rene Neumann. Promela formalization. Archive of Formal Proofs, May 2014. Formal proof development.
Info
See afp.sf.net ...

2012

Rene Neumann. A framework for verified depth-first algorithms. In Annabelle McIver and Peter Höfner, editors, Proc. of the Workshop on Automated Theory Exploration (ATX 2012), pages 36–45. EasyChair, 2012.
PDF (490 kB)
Info
See cava.in.tum.de ...

2011

Rene Neumann. Development of a concurrent language featuring a type system based on boolean implications. Master's thesis, Technische Universität München, 2011.
PDF (709 kB)
Info

2010

Rene Neumann. Functional binomial queues. Archive of Formal Proofs, October 2010. Formal proof development.
Info
See afp.sf.net ...