The Authors of each accepted Poster must send a Poster file to Poster Session Chair (hungnt@soict.hust.edu.vn) before November 10th, 2016.
The Poster size for APLAS 2016 Poster session is standard A1 Portrait (594 mm in width and 841 mm in height). Each poster must include the title of the paper, the name(s) of the author(s) and their affiliation(s). It is recommended that the poster be prepared on one sheet of cardboard.
List of accepted posters:
- Taichi Tomioka and Kazunori Ueda
Generating Memory-safe C Programs from Hierarchical Graph Rewriting Language LMNtal - Izumi Asakura, Hidehiko Masuhara and Tomoyuki Aotani
Towards a Formally Verified Skeleton-based Data Parallel DSL for GPGPU - Kai Stadtmüller
Gopherlyzer: Deadlock Detection for Go Programs - Sooyoung Cha, Sehun Jeong and Hakjoo Oh
Learning a Strategy for Choosing Widening Thresholds from a Large Codebase - Duc-Anh Nguyen, Hung Nguyen-Manh and Hung Pham Ngoc
A Method for Automatic Test Data Generation for Control Flow Testing of C/C++ Projects - Thi Dao Vu, Pham Ngoc Hung and Viet Ha Nguyen
Automated Testing for Java Programs with Test Cases Generation from Sequence Diagrams and Object Constraint Language - Le Cuong, Pham Ngoc Hung, Duc Anh Nguyen, Nguyen Van-Son and Hieu Vo
JCIA: A Tool for Change Impact Analysis of Java EE Applications - Man D. Nguyen, Tu N.M. Nguyen, Thang Huynh Quyet and Hung T. Nguyen
Using Code Optimization and White-Box Testing Techniques to Improve the Performance of Mobile Applications - Shinya Yamaguchi and Kimio Kuramitsu
Cello: A Simple Programming Language for Parser Generator Benchmarking - Nariyoshi Chida and Kimio Kuramitsu
A Partial Conversion of Parsing Expression Grammars to Deterministic Finite Automata - Shun Honda and Kimio Kuramitsu
Grammar Inference for Text Data by Typed Lexical Rule - Andreea Costea
A Logic for Multiparty Session Protocols - Nguyen Thien Binh, Tho Quan and Minh Hai Nguyen
Applying Abstract Language for Debfuscating Polymorphic Virus - Xuan Bach Le, Aquinas Hobor, Anthony W. Lin.
Decidability and Complexity of Tree Share Formulas