Accepted Papers
The list of accepted papers is also available with abstracts.
- Margus Veanes. Symbolic String Transformations with Regular Lookahead and Rollback (details)
- Sergei Grechanik. Inductive Prover based on Equality Saturation for a Lazy Functional Language (details)
- Martin Plümicke. More type inference in Java 8 (details)
- Alexei Iliasov and Jeremy W. Bryans. A proof-based method for modelling timed systems (details)
- Kirill Smirnov, Chernishev George, Pavel Fedotovsky, George Erokhin and Kirill Cherednik. The study of multidimensional R-Tree -based index scalability in multicore environment (details)
- Michael Dever and Geoff Hamilton. Automatically Partitioning Data to Facilitate the Parallelization of Functional Programs (details)
- Pavel Emelyanov and Denis Ponomaryov. On Tractability of Disjoint AND-Decomposition of Boolean Formulas (details)
- Ilya Klyuchnikov and Sergei A. Romanenko. Certifying supercompilation for Martin-Löf's type theory (details)
- Anton Podkopaev and Dmitri Boulytchev. Polynomial-Time Optimal Pretty-Printing Combinators with Choice (details)
- Natalya Gribovskaya. Timed History Preserving Bisimulation and Open Maps (details)
- Lidia Sánchez Gil, Mercedes Hidalgo-Herrero and Yolanda Ortega-Mallén. The role of indirections in lazy natural semantics (details)
- Ping Hou and Yifei Chen. Verification of Temporal Properties of Hybrid Systems Using dMTL (details)
- Victor Dubinin, Sandeep Patil, Cheng Pang and Valeriy Vyatkin. Neutralizing Semantic Ambiguities of Function Block Architecture by Modeling with ASM (details)
- Margarita Korovina and Oleg Kudinov. Index sets as a measure of continuous constraint complexity (details)
- Damas Gruska. Process Opacity (details)
- Peter Thiemann. Towards Specializing JavaScript Programs (details)
- Radu Mardare, Bingtian Xue and Kim Guldstrand Larsen. Decidability and Expressiveness of Recursive Weighted Logic (details)
- Ilja Zakharov, Evgeny Novikov, Vadim Mutilin and Alexey Khoroshilov. Modeling Environment for Static Verification of Linux Kernel Modules (details)
- Kiyoshi Akama and Ekawit Nantajeewarawat. Solving Query-Answering Problems with If-and-Only-If Formulas (details)
- Neil Jones and Geoff Hamilton. Asymptotic Speedups, Bisimulation and Distillation (work in progress) (details)
- Ioan Dragan and Laura Kovacs. Lingva: Generating and Proving Program Properties using Symbol Elimination (details)
- Stefan Vijzelaar, Kees Verstoep, Henri Bal and Wan Fokkink. Bonsai: Cutting Models Down to Size (details)
- German Vidal. Towards Symbolic Execution in Erlang (details)
- Torben Mogensen. Supercompilation for Datatypes (details)
- Natalia Garanina, Elena Sidorova and Evgeny Bodin. A Multi-agent Text Analysis Based on Ontology of Subject Domain (details)
- Evgenii Vityaev and Vitaly Martynovich. Probabilistic formal concepts for contexts with negation (details)
- Vinodh Kumar Sunkara and Aamod Sane. Skeblle: A Tool for Programmable Active Diagrams (details)
- Sergei Gorlatch. Towards High-Level Programming for Systems with Many Cores (details)
- Irina Virbitskaite and Dmitry Bushin. Comparing Semantics under Strong Timing of Petri Nets (details)
- Maurice H. Ter Beek, Stefania Gnesi and Franco Mazzanti. Model Checking Value-Passing Modal Specifications (details)