— This paper describes a modeling framework for evaluating the impact of faults on the output of streaming ions. Our model is based on three abstractions: stream operators, strea...
Gabriela Jacques-Silva, Zbigniew Kalbarczyk, Bugra...
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while ...
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
Eric Allender, David A. Mix Barrington, Tanmoy Cha...
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...