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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Mahmudul Faisal Al Ameen

dblp:16/7640 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0002-2388-4908ORCID · corroborated

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

Software engineering, systems software and programming languages · 4 · 1 first-author · 2 since 2021Theory of computation · 2 · 1 first-author

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 verification · 100%

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

TopicWeightPapersLastEvidence papers
Program verification › program logic
separation logic		 0.412019
Completeness and expressiveness of pointer program verification by separation logic · Inf. Comput. 2019
Program verification
pointer program verification		 0.112019
Completeness and expressiveness of pointer program verification by separation logic · Inf. Comput. 2019

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

expressiveness proof · 0.4completeness proof · 0.4
YearPublicationVenuePosition
2024 Asynchronous unfold/fold transformation for fixpoint logic
Mahmudul Faisal Al Ameen, Naoki Kobayashi 0001, Ryosuke Sato 0001
 Sci. Comput. Program.1
2021 Function Pointer Eliminator for C Programs
Daisuke Kimura, Mahmudul Faisal Al Ameen, Makoto Tatsuta, Koji Nakazawa
 APLAS2
2019 Completeness and expressiveness of pointer program verification by separation logic
Makoto Tatsuta, Wei-Ngan Chin, Mahmudul Faisal Al Ameen
 Inf. Comput.3
2018 A Logical System for Modular Information Flow Verification
Adi Prabawa, Mahmudul Faisal Al Ameen, Benedict Lee, Wei-Ngan Chin
 VMCAI2
2016 Completeness for recursive procedures in separation logic
Mahmudul Faisal Al Ameen, Makoto Tatsuta
 Theor. Comput. Sci.1
2009 Completeness of Pointer Program Verification by Separation Logic
abstract
Reynolds' separation logical system for pointer program verification is investigated. This paper proves its completeness theorem as well as the expressiveness theorem that states the weakest precondition of every program and every assertion can be expressed by some assertion. This paper also introduces the predicate that represents the next new cell, and proves the completeness and the soundness of the extended system under deterministic semantics.
Makoto Tatsuta, Wei-Ngan Chin, Mahmudul Faisal Al Ameen
 SEFM3