Traversals of heterogeneous object structures are the most common operations in schema-first applications where the three key issues are (1) separation of traversal specifications from type-specific actions, (2) expressiveness and reusability of traversal specifications, and (3) supporting structure-shy traversal specifications that require minimal adaptation in the face of schema evolution. Th...

Continuous, piecewise affine (CPA) functions can be algorithmically parameterized to deliver Lyapunov functions for compact invariant sets. We discuss flexible structures and algorithms to manipulate CPA functions for these purposes and discuss their implementation in C++11 using the Armadillo linear algebra library. Especially, we discuss some of the new language features in C++11 that lead to...

Metaparse is a C++ template metaprogramming library for generating parsers, which are template metaprograms themselves parsing strings at C++ compile-time. Parsers built with Metaparse take free-formed strings as input and parse them at compile-time, thus it is possible to build a parser and apply it in the same session of compilation. The C++11 standard provides constexpr, a construct for exec...

We present the C++ library CppSs (C++ superscalar), which provides efficient task-parallelism without the need for special compilers or other software. Any C++ compiler that supports C++11 is sufficient. CppSs features different directionality clauses for defining data dependencies. While the variable argument lists of the taskified functions are evaluated at compile time, the resulting task de...

The semantics of concurrent programs is now defined by a weak memory model, determined either by the programming language (e.g., in the case of C/C++11 or Java) or by the hardware architecture (e.g., for assembly and legacy C code). Since most work in concurrent software verification has been developed prior to weak memory consistency, it is natural to ask how these models affect formal reasoni...

I present a method for developing extensible and modular computational models without sacrificing serial or parallel performance or source code readability. By using a generic simulation cell method I show that it is possible to combine several distinct computational models to run in the same computational grid without requiring modification of existing code. This is an advantage for the develo...