René Haberland

According to our database, René Haberland authored at least 10 papers between 2016 and 2021.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2021

A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic Memory.

René Haberland

CoRR, 2021

2019

Using Prolog for Transforming XML-Documents.

René Haberland

CoRR, 2019

Narrowing Down XML Template Expansion and Schema Validation.

René Haberland

CoRR, 2019

Review of Recent Techniques on Heap Specification and Verification.

René Haberland

CoRR, 2019

A Stricter Heap Separating Points-To Logic.

René Haberland, Kirill Krinkin

CoRR, 2019

Unification of Template-Expansion and XML-Validation.

René Haberland

CoRR, 2019

Transformation of XML Documents with Prolog.

René Haberland, Igor L. Bratchikov

CoRR, 2019

Dynamically Allocated Memory Verification in Object-Oriented Programs using Prolog.

René Haberland, Sergey Ivanovskiy

CoRR, 2019

A Non-repetitive Logic for Verification of Dynamic Memory with Explicit Heap Conjunction and Disjunction.

René Haberland, Kirill Krinkin

CoRR, 2019

2016

Abstract predicate entailment over points-to heaplets is syntax recognition.

René Haberland, Kirill Krinkin, Sergey Ivanovskiy

Proceedings of the 18th Conference of Open Innovations Association and Seminar on Information Security and Protection of Information Technology, 2016