4 citations · 4 across the 1 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2022★ 4 cited
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…
cs.PL2018
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…