Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michal Kurek

dblp:152/5591 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0006-0633-2307ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 since 2021Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 67% Compilers and program optimization · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program synthesis and code generation
code translation
0.812024
Guess & Sketch: Language Model Guided Transpilation · ICLR 2024
Program synthesis and code generation › neural program synthesis
neurosymbolic program synthesis
0.812024
Guess & Sketch: Language Model Guided Transpilation · ICLR 2024
Compilers and program optimization › program transformation
source-to-source transformation
0.812024
Guess & Sketch: Language Model Guided Transpilation · ICLR 2024

Methods — techniques the papers use, named apart from their topics

symbolic solver · 0.8neurosymbolic approach · 0.8language model · 0.8
YearPublicationVenuePosition
2024 Guess & Sketch: Language Model Guided Transpilation
abstract
Maintaining legacy software requires many software and systems engineering hours. Assembly code programs, which demand low-level control over the computer machine state and have no variable names, are particularly difficult for humans to analyze. Existing conventional program translators guarantee correctness, but are hand-engineered for the source and target programming languages in question. Learned transpilation, i.e. automatic translation of code, offers an alternative to manual re-writing and engineering efforts. Automated symbolic program translation approaches guarantee correctness but struggle to scale to longer programs due to the exponentially large search space. Their rigid rule-based systems also limit their expressivity, so they can only reason about a reduced space of programs. Probabilistic neural language models (LMs) produce plausible outputs for every input, but do so at the cost of guaranteed correctness. In this work, we leverage the strengths of LMs and symbolic solvers in a neurosymbolic approach to learned transpilation for assembly code. Assembly code is an appropriate setting for a neurosymbolic approach, since assembly code can be divided into shorter non-branching basic blocks amenable to the use of symbolic methods. Guess & Sketch extracts alignment and confidence information from features of the LM then passes it to a symbolic solver to resolve semantic equivalence of the transpilation input and output. We test Guess & Sketch on three different test sets of assembly transpilation tasks, varying in difficulty, and show that it successfully transpiles 57.6% more examples than GPT-4 and 39.6% more examples than an engineered transpiler. We also share a training and evaluation dataset for this task.
Celine Lee, Abdulrahman Mahmoud, Michal Kurek, Simone Campanoni, David Brooks 0001, Stephen Chong, Gu-Yeon Wei, Alexander M. Rush
ICLR3
2014 Tool for Automatic Testing of Web Services
abstract
The Web Services technology has received a significant amount of attention in recent years because it allows to easily utilize and integrate existing software applications to create new business services.With the increase of interest and popularity of Web Services, web applications are developed.This way of software development causes new issues for Web Service testing to ensure the quality of service that are published.This paper describes the tool (named WSDLTest) for automatic testing of web services.The tool can be used for testing of web services for which WSDL 1.1 or WSDL 2.0 document are available.WSDLTest parses the WSDL document, and based on, it tests the web service by sending automatically generated messages.Some examples of the usage of our tool are given.
Ilona Bluemke, Michal Kurek, Malgorzata Purwin
FedCSIS2