5 citations · 10 across the 4 of their papers we have counts for
5 papers
United Monoids: Finding Simplicial Sets and Labelled Algebraic Graphs in Trees
Andrey Mokhov
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely func…
Complexity of Linear Operators
Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov +1
Let be a matrix with zeroes and ones and be an -dimensional vector of formal variables over a semigroup . How many semigroup…
Formal Verification of Spacecraft Control Programs Using a Metalanguage for State Transformers
Andrey Mokhov, Georgy Lukyanov, Jakob Lechner
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…
On the complexity of hazard-free circuits
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen +3
The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows th…
On Formalisms for Dynamic Reconfiguration of Dependable Systems
Anirban Bhattacharyya, Andrey Mokhov, Ken Pierce +1
Three formalisms of different kinds - VDM, Maude, and basic CCSdp - are evaluated for their suitability for the modelling and verification of dynamic software reconfiguration using…