university

I presented a talk on a yet unsubmitted paper from me and my advisor for which our extended abstract was accepted.

We prove that if a ∈ M ⊆ [a, b] is an upwards-closed and open set (wrt. the subspace topology [a, b]), then M = [a, b].

We recap the usual OTP with encryption in $\{0,1{\}}^n$ being $m\oplus K$ and note how its slogan “every ciphertext can come from any plaintext” justifying its security is just a consequence of the group structure in $\{0,1{\}}^n$. We then formulate the more general OTP over groups.

Informal talk highlighting some problems of naive composition of programming languages (e.g. SQL, HTML, and regex injections) and then introducing JetBrains MPS – a language workbench tool allowing to compose languages very easily.

Based on the foundation-independent module system MMT, I propose a general definition of behavior-preserving refactorings, and as the primary example give a method to generalize inversely along MMT morphisms (refinements).