A Tree Pattern Matching Algorithm with Reasonable Space Requirements. - Jochen Burghardt (CAAP, 1988)

Eine feinkörnige Sortendisziplin und ihre Anwendung in der Programmkonstruktion. - Jochen Burghardt (Oldenbourg, 1993)

A Fine-Grain Sort Discipline and Its Application to Formal Program Construction. - Jochen Burghardt (KORSO Book, 1995)

Deductive Synthesis. - Jochen Burghardt (Formal Development of Reactive Systems, 1995)

Regular Substitution Sets: A Means of Controlling E-Unification. - Jochen Burghardt (RTA, 1995)

On the antisymmetry of Galois embeddings. - Jochen Burghardt; Florian Kammüller; Jeff W. Sanders (Inf. Process. Lett., 2001)

Maintaining Partial Sums in Logarithmic Time. - Jochen Burghardt (Nord. J. Comput., 2001)

Axiomatization of Finite Algebras. - Jochen Burghardt (KI, 2002)

E-generalization using grammars. - Jochen Burghardt (Artif. Intell., 2005)

Formal specification and automated verification of railway software with Frama-C. - Virgile Prevosto; Jochen Burghardt; Jens Gerlach; Kerstin Hartig; Hans Werner Pohl; Kim Völlinger (INDIN, 2013)

Experiences in Developing Time-Critical Systems - The Case Study "Production Cell". - Jochen Burghardt (CoRR, 2014)

Formale Entwicklung einer Steuerung für eine Fertigungszelle mit SYSYFOS. - Jochen Burghardt (CoRR, 2014)

Eine entscheidbare Klasse n-stelliger Horn-Prädikate. - Jochen Burghardt (CoRR, 2014)

Implementing Anti-Unification Modulo Equational Theory. - Jochen Burghardt; Birgit Heinz (CoRR, 2014)

Repetition-Free Derivability from a Regular Grammar is NP-Hard. - Jochen Burghardt (CoRR, 2016)

Weight Computation of Regular Tree Languages. - Jochen Burghardt (CoRR, 2016)

An Improved Algorithm for E-Generalization. - Jochen Burghardt (CoRR, 2017)

A Scheme-Driven Approach to Learning Programs from Input/Output Equations. - Jochen Burghardt (CoRR, 2018)

An Algebra of Properties of Binary Relations. - Jochen Burghardt (CoRR, 2021)