Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission....

Review of the gizaurus “Metalanguage Linguistics” (St. Petersburg, 2021), developed by S.V. Lesnikov. The work marks a new stage conceptualization in modern Russian linguistics, offering innovative approaches to systematization terminological systems language sciences.

Writing efficient, correct programs to process complex XML documents can be time-consuming and difficult. While data binding frameworks automate translating untyped, structured XML data into strongly typed data structures, their overhead, in terms of configuration during development and maintenance, and CPU at runtime, may be prohibitive. We present an open source XML-Java data binding framewor...

Verification of functional correctness of control programs is an essential task for the development of space electronics; it is difficult and time-consuming and typically outweighs design and programming tasks in terms of development hours. We present a verification approach designed to help spacecraft engineers reduce the effort required for formal verification of low-level control programs ex...

The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of prog...

Using contextual equivalence (a.k.a. observational equivalence) to specify security properties is an important idea in the field of formal verification of cryptographic protocols. While contextual equivalence is difficult to prove directly, one is usually able to deduce it using so-called logical relations in typed λ-calculi. We apply this technique to the cryptographic metalanguage — an extens...

We build the reasoning tool of metalanguage support (MS) with the embedded mechanism of the invention of predicates and metapredicates for the comprehension and synthesis tasks. This tool, based on metalanguage representation with weakened soundness, gains the inference flexibility to represent the formal scenarios (for example, a limited class of "logical" anecdotes, derived from NL). We intro...