Student Research Poster Comments

Participants were asked to complete the sentence “I specially like …” The following is a selection of answers/continuations (removing duplicates and unreadables)

Equipping Control Flow Graphs Extracted from the Linux Code with a Formal Semantics

nice problem outline, practical application, it uses Maude!, the application to Linux, the structure, connection to real code, the control flow graph, the practical application, the information flow graphic,

Amortized Resource Analysis and Typed Term Rewriting

good structure, interesting and challenging subject, clear poster design, resource analysis by combining term rewriting with type checking, clean layout, the syntax, the example, colourful type annotations, the colours in the example, clear presentation of the limitations, how it formally present things on a poster (not easy at all!) while being readable, comprehensive information,

(shared) 2nd Place: Termination Analysis of LLVM Programs using Bitvector Arithmetic

good outline of problem, also mentioning challenges, manages to convey a lot of content without overloading, termination for actual programming languages, real life problems analyzed, the example, the colouring, looks like one of the most applied works from all of the posters, explanation and visualiation of bitvector arithmetics, the compact style, the balance between examples, goals and details, the detailed example, the very intersting and new (up to my knowledge) approach to tackle an old problem in program verification

Quantified Boolean Formulas for Loops in String Rewriting Systems

a lot of details provided, nice idea for the background, the loop visualiation in the background, the quantification idea, the background, the formulas, detailed description of the goals, the structuring in small sections,

Automation of Conditional Confluence

nice graphics, well written poster, very concise, clean, the example, clear and straightforward design, the clarity and importance of the goal, topic is a bit related to my research and I find that it is explained in a simple and clear way, the conditional rewriting example, the QR codes, the visual effort put in to explain and motivate the research,

Propositional Sieving of Small String Rewriting Systems

nice approach, a lot of details provided, clear explanations, the idea of challenging termination tools, the amount of content, one rule string rewriting, the clear structure, the use of BDDs, challenging task and good explanation, the structure and the explanation of the motivation,

(shared) 2nd Place: Rewrite-Rules in the Stochastic Simulation of Epigenome Dynamics

nice application of rewriting, very interesting, bringing together biology and rewriting, the given confluence problems, the graphics showing the biological process, that part of the paper is already included, the very cool subject, colourful examples, the graphics, the use of rewriting to model chemical reactions, exciting topic and nice introduction, the effort in detailing the context of the research, the topic and the graphics - it’s possible to get an idea without reading everything

Synchronous products of rewrite systems as a means to implement strategies

clear structure, nice graphics, not overloaded, good overview by just one look, almost no text but a big example, … that it is mine, the implementation of strategies via regular expressions, the clear example, the ice style, the synchronous product, the blue colour, the way it states clearly what is done and what is to be done, graphics and short notes instead of long paragraphs,

Formalizing Size-Change Principle And Dependency Pair for Termination

good structure, good high-level overview, sounds amazing, nice design, attractive and colourful, the visualization of size-change, the clear image showing the idea, the use of PVS, the nice structure, mentioning expected results as a basis for further discussion, the explanation for using PVS, the structure of the poster and the focus on the problem stated,

If you want something done, just hire a MaxSMT solver?

the title, results proven, nice colour choices, attractive title, the visualisation of Inst-Gen, the picture, the most interesting poster for those who work on SMT, the personal touch, the graph, the presence of the photograph, the details of the motivation of the research, the headline and motivation and the author’s photo,

Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground TRSs

good structure and helpful examples, understandable for basic course, the application of tree automata and GTTs, the clear structure, the compact and clear structure, the approach of using automata techniques (as opposed to SMT), the explanations on the limitations of automatization for arbitrary TRS, hence the restrictions

WINNER: Higher-Order Confluence: Automation and Certification

very clear poster, no technical overload, nice figures, HOR certification by Isabelle, intersting idea explained by concise diagrams, higher order rewriting, the many graphics and examples, coconuts, the compact and clear structure, the presentation of the various tasks/components,