Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
Piotr Berman, Arnab Bhattacharyya, Elena Grigoresc...
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
We present a new language feature, specified as an extension to Java. The feature is a form of dispatch which includes and subsumes multimethods (see for example [3]), but which ...
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
It has been widely advocated that software architecture an effective set of abstractions for engineering (families of) complex software systems. However, architectural concepts ar...
Sam Malek, Chiyoung Seo, Sharmila Ravula, Brad Pet...