4 citations · 11 across the 7 of their papers we have counts for
9 papers · 1 filter
A Logical Programming Language as an Instrument for Specifying and Verifying Dynamic Memory
René Haberland
This work proposes a Prolog-dialect for the found and prioritised problems on expressibility and automation. Given some given C-like program, if dynamic memory is allocated, altere…
Narrowing Down XML Template Expansion and Schema Validation
René Haberland
This work examines how much template instantiation can narrow down schema validation for XML-documents. First, instantiation and validation are formalised. Properties towards their…
Review of Recent Heap Specification and Verification Techniques
René Haberland
The article provides an overview of the existing methods of dynamic memory verification; a comparative analysis is carried out; the applicability for solving problems of control, m…
A Stricter Heap Separating Points-To Logic
René Haberland, Kirill Krinkin
Dynamic memory issues are hard to locate and may cost much of a development project's efforts and was repeatedly reported similarly afterwards independently by different persons. V…
Unification of Template-Expansion and XML-Validation
René Haberland
The processing of XML documents often includes creation and validation. These two operations are typically performed in two different nodes within a computer network that do not co…
Transformation of XML Documents with Prolog
René Haberland, Igor L. Bratchikov
Transforming XML documents with conventional XML languages, like XSL-T, is disadvantageous because there is too lax abstraction on the target language and it is rather difficult to…