Descriptive Types for Linked Data Resources -- 25 Years of Model Checking -- The Laws of Concurrent Programming -- Big Data, Big Systems, Big Challenges: A Personal Experience -- An Automatic Technique for Static Deadlock Prevention -- Automatically Partitioning Data to Facilitate the Parallelization of Functional Programs -- Lingva: Generating and Proving Program Properties Using Symbol -- Neutralizing Semantic Ambiguities of Function Block Architecture by Modeling with ASM -- On Tractability of Disjoint AND-Decomposition of Boolean Formulas -- A Multi-agent Text Analysis Based on Ontology of Subject Domain -- Towards High-Level Programming for Systems with Many Cores -- Inductive Prover Based on Equality Saturation for a Lazy Functional Language Timed History Preserving Bisimulation and Open Maps -- Process Opacity for Timed Process Algebra -- A Proof-based Method for Modeling Timed Systems -- Asymptotic Speedups, Bisimulation and Distillation -- Certifying Supercompilation for Martin-Löf's Type Theory -- Index Sets as a Measure of Continuous Constraint Complexity -- Decidability and Expressiveness of Recursive Weighted Logic -- Supercompilation for Datatypes -- More type Inference in Java 8 -- Polynomial-Time Optimal Pretty-Printing Combinators with Choice -- The Study of Multidimensional R-Tree-based Index Scalability in Multicore Environment -- Skeblle: A new Kind of Diagramming Tool with Programmable Active Diagrams -- The Role of Indirections in Lazy Natural Semantics -- Model Checking Value-Passing Modal Specifications -- Towards Specializing JavaScript Programs -- Symbolic String Transformations with Regular Lookahead and Rollback -- Towards Symbolic Execution in Erlang -- Bonsai: Cutting Models Down to Size -- Comparing Semantics Under Strong Timing of Petri Nets -- Probabilistic Formal Concepts for Contexts with Negation -- Modeling Environment for Static Verification of Linux Kernel Modules.