Lars Noschinski

According to our database, Lars Noschinski authored at least 13 papers between 2011 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Pattern-based Subterm Selection in Isabelle.

Lars Noschinski, Christoph Traut

CoRR, 2021

2016

Formalizing Graph Theory and Planarity Certificates (Formalisierung von Graphentheorie und Planaritätszertifikaten)

Lars Noschinski

PhD thesis, 2016

2015

A Graph Library for Isabelle.

Lars Noschinski

Math. Comput. Sci., 2015

Generating Cases from Labeled Subgoals.

Lars Noschinski

Arch. Formal Proofs, 2015

2014

Verification of Certifying Computations through AutoCorres and Simpl.

Lars Noschinski, Christine Rizkallah, Kurt Mehlhorn

Proceedings of the NASA Formal Methods - 6th International Symposium, NFM 2014, Houston, TX, USA, April 29, 2014

Experience report: the next 1100 Haskell programmers.

Jasmin Christian Blanchette, Lars Hupel, Tobias Nipkow, Lars Noschinski, Dmitriy Traytel

Proceedings of the 2014 ACM SIGPLAN symposium on Haskell, 2014

2013

Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs.

Lars Noschinski, Fabian Emmes, Jürgen Giesl

J. Autom. Reason., 2013

Lehmer's Theorem.

Simon Wimmer, Lars Noschinski

Arch. Formal Proofs, 2013

Pratt's Primality Certificates.

Simon Wimmer, Lars Noschinski

Arch. Formal Proofs, 2013

Graph Theory.

Lars Noschinski

Arch. Formal Proofs, 2013

2012

A Probabilistic Proof of the Girth-Chromatic Number Theorem.

Lars Noschinski

Arch. Formal Proofs, 2012

Proof Pearl: A Probabilistic Proof for the Girth-Chromatic Number Theorem.

Lars Noschinski

Proceedings of the Interactive Theorem Proving - Third International Conference, 2012

2011

A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems.

Lars Noschinski, Fabian Emmes, Jürgen Giesl

Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011