Jasmin Christian Blanchette
ジャスミン・クリスチャン・ブランチェット
亚斯麦·克里斯蒂安·布兰切特
 

I am a postdoc at the Chair for Logic and Verification lead by Tobias Nipkow at the Technische Universität München, which I joined in 2008. My research focuses on the generation of counterexamples for higher-order logic (Nitpick) and the use of first-order automatic theorem provers in a higher-order theorem prover (Sledgehammer). I am financed by the project Hardening the Hammer (DFG Ni 491/14-1). From 2000 to 2008, I worked as software engineer and documentation manager for Trolltech (now Digia, Qt) in Oslo, Norway.

During the 2012–13 and 2013–14 winter terms, I was the proud Master of Competition for the course Einführung in die Informatik 2.


Contents:  StudentsDraftsJournal ArticlesConference PapersWorkshop PapersThesesBooksOther PublicationsSoftwareActivitiesVideoAddress


Students

Current:

  • Mathias Fleury (M.Sc. intern, formalisation of superposition; cosupervisor: Dmitriy Traytel)

Past:

  • Martin Desharnais (B.Eng. intern, properties of (co)datatypes; cosupervisor: Dmitriy Traytel)
  • Albert Steckermeier (B.Sc., enhanced integration of Waldmeister in Sledgehammer)
  • Maximilian Haslbeck (M.Sc. directed research, translation of Naproche to Isabelle; cosupervisor: Tobias Nipkow)
  • Lorenz Panny (B.Sc., (co)recursive function definitions; cosupervisor: Dmitriy Traytel)
  • Steffen Juilf Smolka (B.Sc., structured Isabelle proofs from refutation proofs)
  • Dmytro Traytel (M.Sc., (co)datatype definitions; cosupervisor: Andrei Popescu)

Drafts

  • A decision procedure for (co)datatypes in SMT solvers
    Andrew Reynolds and J. C. B.
    Rough draft (PDF)
  • Learning-based relevance filter for Isabelle/HOL
    Daniel Kühlwein, J. C. B., Cezary Kaliszyk, and Josef Urban.
    Rough draft (PDF)
  • Semi-intelligible Isar proofs from machine-generated proofs
    J. C. B., Sascha Böhme, Mathias Fleury, Steffen Juilf Smolka, and Albert Steckermeier.
    Draft article (PDF)
  • Foundational extensible corecursion
    J. C. B., Andrei Popescu, and Dmitriy Traytel.
    Draft paper (PDF)
  • Hammering towards QED
    J. C. B., Cezary Kaliszyk, Lawrence C. Paulson, and Josef Urban.
    Draft article (PDF)
  • Encoding monomorphic and polymorphic types
    J. C. B., Sascha Böhme, Andrei Popescu, and Nicholas Smallbone.
    Draft article (PDF)

Journal Articles

  • LEO-II and Satallax on the Sledgehammer test bench
    Nik Sultana, J. C. B., and Lawrence C. Paulson. Journal of Applied Logic 11(1), pp. 91–102, 2013.
    Web pagePreprint (PDF)
  • Relational analysis of (co)inductive predicates, (co)inductive datatypes, and (co)recursive functions
    J. C. B. Software Quality Journal 21(1), pp. 101–126, 2013.
    Web pagePreprint (PDF)
  • Monotonicity inference for higher-order formulas
    J. C. B. and Alexander Krauss. Journal of Automated Reasoning 47(4), pp. 369–398, 2011.
    Web pagePreprint (PDF)
  • Proof pearl: Mechanizing the textbook proof of Huffman's algorithm in Isabelle/HOL
    J. C. B. Journal of Automated Reasoning 43(1), pp. 1–18, 2009.
    Web pagePreprint (PDF)

Conference Papers

  • Experience report: The next 1100 Haskell programmers
    J. C. B., Lars Hupel, Tobias Nipkow, Lars Noschinski, and Dmitriy Traytel. ACM SIGPLAN Haskell Symposium 2014 (Haskell 2014), ACM Press, 2014.
    Preprint (PDF)
  • Truly modular (co)datatypes for Isabelle/HOL
    J. C. B., Johannes Hölzl, Andreas Lochbihler, Lorenz Panny, Andrei Popescu, and Dmitriy Traytel. In Klein, G., Gamboa, R. (eds.) 5th Conference on Interactive Theorem Proving (ITP 2014), LNCS, Springer, 2014.
    Preprint (PDF)
  • Cardinals in Isabelle/HOL
    J. C. B., Andrei Popescu, and Dmitriy Traytel. In Klein, G., Gamboa, R. (eds.) 5th Conference on Interactive Theorem Proving (ITP 2014), LNCS, Springer, 2014.
    Preprint (PDF)
  • Unified classical logic completeness: A coinductive pearl
    J. C. B., Andrei Popescu, and Dmitriy Traytel. In Demri, S., Kapur, D., Weidenbach, C. (eds) 7th International Joint Conference on Automated Reasoning (IJCAR 2014), LNAI, Springer, 2014.
    Preprint (PDF)
  • Mechanizing the metatheory of Sledgehammer
    J. C. B. and Andrei Popescu. In Fontaine, P., Ringeissen, C., Schmidt, R. A. (eds.) 9th International Symposium on Frontiers of Combining Systems (FroCoS 2013), LNAI 8152, pp. 245–260, Springer, 2013.
    Web pagePreprint (PDF)
  • MaSh: Machine learning for Sledgehammer
    Daniel Kühlwein, J. C. B., Cezary Kaliszyk, and Josef Urban. In Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) 4th Conference on Interactive Theorem Proving (ITP 2013), LNCS 7998, pp. 35–50, Springer, 2013.
    Web pagePreprint (PDF)
  • TFF1: The TPTP typed first-order form with rank-1 polymorphism (system description)
    J. C. B. and Andrei Paskevich. In Bonacina, M. P. (ed.) 24th International Conference on Automated Deduction (CADE 2013), LNAI 7898, pp. 414–420, Springer, 2013.
    Preprint (PDF)Draft specification (PDF)
  • Encoding monomorphic and polymorphic types
    J. C. B., Sascha Böhme, Andrei Popescu, and Nicholas Smallbone. In Piterman, N., Smolka, S. (eds.) 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2013), LNCS 7795, pp. 493–507, Springer, 2013.
    Web pagePreprint (PDF)
  • Foundational, compositional (co)datatypes for higher-order logic—Category theory applied to theorem proving
    Dmitriy Traytel, Andrei Popescu, and J. C. B. In 27th Annual IEEE Symposium on Logic in Computer Science (LICS 2012), pp. 596–605, IEEE, 2012.
    Web pagePreprint (PDF)
  • More SPASS with Isabelle—Superposition with hard sorts and configurable simplification
    J. C. B., Andrei Popescu, Daniel Wand, and Christoph Weidenbach. In Beringer, L., Felty, A. P. (eds.) Third International Conference on Interactive Theorem Proving (ITP 2012), LNCS 7406, pp. 345–360, Springer, 2012.
    Web pagePreprint (PDF)
  • Automatic proof and disproof in Isabelle/HOL
    J. C. B., Lukas Bulwahn, and Tobias Nipkow. In Tinelli, C., Sofronie-Stokkermans, V. (eds.) 8th International Symposium Frontiers of Combining Systems (FroCoS 2011), LNAI 6989, pp. 12–27, Springer, 2011.
    Web pagePreprint (PDF)
  • Extending Sledgehammer with SMT solvers
    J. C. B., Sascha Böhme, and Lawrence C. Paulson. In Bjørner, N., Sofronie-Stokkermans, V. (eds.) 23rd International Conference on Automated Deduction (CADE 2011), LNAI 6803, pp. 116–130, Springer, 2011.
    Web pagePreprint (PDF)
  • Nitpicking C++ concurrency
    J. C. B., Tjark Weber, Mark Batty, Scott Owens, and Susmit Sarkar. 13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 2011), pp. 113–124, ACM Press, 2011.
    Web pagePreprint (PDF)
  • Generating counterexamples for structural inductions by exploiting nonstandard models
    J. C. B. and Koen Claessen. In Fermüller, C. G., Voronkov, A. (eds.) 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR Yogyakarta 2010), LNAI 6397, pp. 117–141, Springer, 2010.
    Web pagePreprint (PDF)
  • Nitpick: A counterexample generator for Isabelle/HOL based on the relational model finder Kodkod (system description)
    J. C. B. Presented at the 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR Yogyakarta 2010).
    Web pagePreprint (PDF)
  • Monotonicity inference for higher-order formulas
    J. C. B. and Alexander Krauss. In Giesl, J., Hähnle, R. (eds.) 5th International Joint Conference on Automated Reasoning (IJCAR 2010), LNAI 6173, pp. 91–106, Springer, 2010.
    Web pagePreprint (PDF)
  • Nitpick: A counterexample generator for higher-order logic based on a relational model finder
    J. C. B. and Tobias Nipkow. In Kaufmann, M., Paulson, L. C. (eds.) First International Conference on Interactive Theorem Proving (ITP 2010), LNCS 6172, pp. 131–146, Springer, 2010.
    Web pagePreprint (PDF)
  • Relational analysis of (co)inductive predicates, (co)inductive datatypes, and (co)recursive functions
    J. C. B. In Fraser, G., Gargantini, A. (eds.) Fourth International Conference on Tests and Proofs (TAP 2010), LNCS 6143, pp. 117–134, Springer, 2010.
    Web pagePreprint (PDF)
  • Nitpick: A counterexample generator for higher-order logic based on a relational model finder (extended abstract)
    J. C. B. and Tobias Nipkow. Third International Conference on Tests and Proofs (TAP 2009). In Dubois, C. (ed.) TAP 2009: Short Papers, ETH Technical Report 630, 2009.
    Full proceedings (PDF)Preprint (PDF)

Workshop Papers

  • My life with an automatic theorem prover
    J. C. B. Vampire 2014.
    Preprint (PDF)
  • Axiom selection as a machine learning problem
    J. C. B. and Daniel Kühlwein. In Geschke, S., Loewe, B., and Schlicht, P., Infinity, Computability, and Metamathematics: Festschrift Celebrating the 60th Birthdays of Peter Koepke and Philip Welch, Tributes, College Publications, 2014.
    Preprint (PDF)
  • Robust, semi-intelligible Isabelle proofs from ATP proofs
    Steffen Juilf Smolka and J. C. B. Third International Workshop on Proof Exchange for Theorem Proving (PxTP 2013).
    Preprint (PDF)
  • Redirecting proofs by contradiction
    J. C. B. Third International Workshop on Proof Exchange for Theorem Proving (PxTP 2013).
    Preprint (PDF)
  • Three years of experience with Sledgehammer, a practical link between automated and interactive theorem provers
    Lawrence C. Paulson and J. C. B. Invited talk at the 8th International Workshop on the Implementation of Logics (IWIL-2010).
    Full proceedings (PDF)Preprint (PDF)
  • Intra-object versus inter-object: Concurrency and reasoning in Creol
    Einar Broch Johnsen, J. C. B., Marcel Kyas, and Olaf Owe. Electronic Notes in Theoretical Computer Science 243 (2nd International Workshop on Harnessing Theories for Tool Support in Software, TTSS 2008), pp. 89–103, 2009.
    Web pagePreprint (PDF)
  • An open system operational semantics for an object-oriented and component-based language
    J. C. B. and Olaf Owe. Electronic Notes in Theoretical Computer Science 215 (4th International Workshop on Formal Aspects of Component Software, FACS 2007), pp. 151–169, 2008.
    Web pagePreprint (PDF)

Theses

  • Verification of Assertions in Creol Programs
    J. C. B. M.Sc. thesis, Institutt for informatikk, Universitetet i Oslo, May 2008.
    PDF

Books

  • C++ GUI Programming with Qt 4
    J. B. and Mark Summerfield. Prentice Hall, July 2006.
    Chinese (Simplified), French, German, Japanese, and Russian translations are available.
    Web pagePDF
  • C++ GUI Programming with Qt 3
    J. B. and Mark Summerfield. Bruce Perens' Open Source Series, Prentice Hall, January 2004.
    Chinese (Simplified), German, Japanese, and Russian translations are available.
    Web pagePDF

Other Publications

  • Monotonicity or how to encode polymorphic types safely and efficiently
    J. C. B., Sascha Böhme, and Nicholas Smallbone. Subsumed by “Encoding monomorphic and polymorphic types.”
    Technical report (PDF)
  • An Isabelle/HOL formalization of the textbook proof of Huffman's algorithm
    J. C. B. In Gerwin Klein, Tobias Nipkow, and Larry Paulson, editors, Archive of Formal Proofs, October 2008.
    Web pagePDF
  • The Little Manual of API Design
    J. B. Trolltech, a Nokia company, June 2008.
    PDF
  • Overview of the Creol language
    J. C. B. Essay, Department of Informatics, Univerity of Oslo, May 2007.
    PDF
  • Throwing MFC out of Windows—Qt application development with Visual Studio .NET
    J. B. Linux Magazine 73, pp. 40–43, December 2006.
    Web page
  • Windows-to-Linux migration with Qt
    J. B. TUX 4, July 2005.
    Web pagePDF

Software

  • DiffPDF—A utility to compare PDFs. Developed by Mark Summerfield.
    Web page

Activities


Video


Address

Dr. Jasmin C. Blanchette
Institut für Informatik
Technische Universität München
Boltzmannstr. 3
85748 Garching
Germany

Phone: +49 (0)89 289 17336
Fax: +49 (0)89 289 17301
Email: blanchette the at sign in.tum.de

Office:
00.09.062



“A proof is a proof.
What kind of a proof?
It's a proof.
A proof is a proof,
and when you have a good proof,
it's because it's proven.”

— Jean Chrétien