Author of the publication

A Refinement Based Algorithm for Learning Program Input Grammars.

, and . DataMod, volume 13268 of Lecture Notes in Computer Science, page 138-156. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Complete Logic for Non-Deterministic Database Transformations., , , and . CoRR, (2016)Performance Analysis of Algorithms to Reason about XML Keys, , , , and . 23rd International Conference on Database and Expert Systems Applications (DEXA 2012), Vienna, Austria, 3-6 September, volume 7446 of Lecture Notes in Computer Science, page 101-115. Springer, (3--6 September 2012)On Fragments of Higher Order Logics that on Finite Structures Collapse to Second Order., , and . WoLLIC, volume 10388 of Lecture Notes in Computer Science, page 125-139. Springer, (2017)An automated evaluation of broker compatibility for the Message Queuing Telemetry Transport protocol., , and . J. Softw. Evol. Process., (July 2023)SQL-Sampler: A Tool to Visualize and Consolidate Domain Semantics by Perfect SQL Sample Data., , and . APCCM, volume 154 of CRPIT, page 71-80. Australian Computer Society, (2014)Expressivity Within Second-Order Transitive-Closure Logic., , and . CSL, volume 119 of LIPIcs, page 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Towards an ASM Thesis for Reflective Sequential Algorithms., , and . ABZ, volume 9675 of Lecture Notes in Computer Science, page 244-249. Springer, (2016)Systematic Refinement of Abstract State Machines with Higher-Order Logic., , , and . ABZ, volume 10817 of Lecture Notes in Computer Science, page 204-218. Springer, (2018)BSP abstract state machines capture bulk synchronous parallel computations., , and . Sci. Comput. Program., (2019)Proper Hierarchies in Polylogarithmic Time and Absence of Complete Problems., , , and . FoIKS, volume 12012 of Lecture Notes in Computer Science, page 90-105. Springer, (2020)