APLAS 2021 Contributors

Filter

Role Type

Contributing to

Number of Roles

Country

Results (94)

A Carmine AbateAbate, Carmine Max Planck Institute for Security and Privacy, Bochum, Germany Fully Abstract and Robust Compilation and How to Reconcile the Two, Abstractly
Parosh Aziz AbdullaAbdulla, Parosh Aziz Uppsala University, Sweden Solving Not-Substring with Flat Abstraction
Andreas AbelAbel, Andreas Gothenburg UniversitySweden Committee Member in Program Committee within the APLAS Research Papers-track
Mahmudul Faisal Al AmeenAmeen, Mahmudul Faisal Al University of Tokyo Function Pointer Eliminator for C Programs
Mohamed Faouzi AtigAtig, Mohamed Faouzi Uppsala University, Sweden Solving Not-Substring with Flat Abstraction
B Casper Bach PoulsenBach Poulsen, Casper Delft University of Technology Latent Effects for Reusable Language Components
Kyungmin BaeBae, Kyungmin Pohang University of Science and Technology (POSTECH)South Korea Committee Member in Program Committee within the APLAS Research Papers-track
Divya BajajBajaj, Divya Oregon State UniversityUnited States Adaptable Traces for Program Explanations
Agustín BorgnaBorgna, Agustín Université de Lorraine, CNRS, Inria, LORIA F 54000 Nancy, France and Université Paris-Saclay, CNRS, Laboratoire Méthodes Formelles, 91405, Orsay, FranceArgentina Hybrid quantum-classical circuit simplification with the ZX-calculus
Edwin BradyBrady, Edwin University of St Andrews, UKUnited Kingdom Committee Member in Program Committee within the APLAS Research Papers-track
Matteo BusiBusi, Matteo Università di Pisa - Dipartimento di InformaticaItaly Fully Abstract and Robust Compilation and How to Reconcile the Two, Abstractly
C Yu-Fang ChenChen, Yu-Fang Academia Sinica, Taiwan Solving Not-Substring with Flat Abstraction PyCT: A Python Concolic Tester Committee Member in Program Committee within the APLAS Research Papers-track
Wei-Ngan ChinChin, Wei-Ngan National University of Singapore General Chair in Organising Committee within the APLAS Research Papers-track
Wonhyuk ChoiChoi, Wonhyuk Columbia UniversityUnited States Program Synthesis for Musicians: A Usability Testbed for Temporal Logic Specifications
Andreea CosteaCostea, Andreea School of Computing, National University Of SingaporeSingapore Session Chair of Language Design (mirror) (part of APLAS Research Papers) Committee Member in Program Committee within the APLAS Research Papers-track
D Bui Phi DiepDiep, Bui Phi Uppsala University, Sweden Solving Not-Substring with Flat Abstraction
Daniel DietschDietsch, Daniel University of FreiburgGermany Proving LTL Properties of Bitvector Programs and Decompiled Binaries
Rayna DimitrovaDimitrova, Rayna CISPA Helmholtz Center for Information Security Committee Member in Program Committee within the APLAS Research Papers-track
Thi Thu Ha DoanDoan, Thi Thu Ha University of Freiburg A Typed Programmatic Interface to Contracts on the Blockchain
E Martin ErwigErwig, Martin Oregon State UniversityUnited States Adaptable Traces for Program Explanations
F Danila FedorinFedorin, Danila Oregon State University Adaptable Traces for Program Explanations
Yu FengFeng, Yu University of California at Santa BarbaraUnited States Committee Member in Program Committee within the APLAS Research Papers-track
G Kai GayGay, Kai Oregon State UniversityUnited States Adaptable Traces for Program Explanations
Giulio GuerrieriGuerrieri, Giulio University of BathUnited Kingdom Committee Member in Program Committee within the APLAS Research Papers-track
H Kihong HeoHeo, Kihong KAISTSouth Korea Session Chair of Analysis / Synthesis (mirror) (part of APLAS Research Papers) Committee Member in Program Committee within the APLAS Research Papers-track
Lukáš HolíkHolík, Lukáš Brno University of Technology Preprocessing of Alternating Automata for Language Emptiness Testing Solving Not-Substring with Flat Abstraction
Justin HsuHsu, Justin University of Wisconsin-Madison, USAUnited States A Separation Logic for Probabilistic Independence
Denghang HuHu, Denghang State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences Solving Not-Substring with Flat Abstraction
Xiaowen HuHu, Xiaowen The University of Sydney The Choice Construct in the Soufflé Language
I Atsushi IgarashiIgarashi, Atsushi Kyoto University, JapanJapan Session Chair of Invited talk 2 (part of APLAS Keynote Talks)
Takuma IshikawaIshikawa, Takuma The University of Tokyo Termination Analysis for the $\pi$-Calculus by Reduction to Sequential Program Termination
K Joshua KarpKarp, Joshua The University of Sydney The Choice Construct in the Soufflé Language
Nobuhiro KasaiKasai, Nobuhiro Shibaura Institute of Technology Server-Side Computation of Package Dependencies in Package-Management Systems
Siau-Cheng KhooKhoo, Siau-Cheng National University of Singapore Scalable and Modular Robustness Analysis of Deep Neural Networks
Daisuke KimuraKimura, Daisuke Toho University Japan Function Pointer Eliminator for C Programs
Naoki KobayashiKobayashi, Naoki University of Tokyo, JapanJapan Termination Analysis for the $\pi$-Calculus by Reduction to Sequential Program Termination
Eric KoskinenKoskinen, Eric Stevens Institute of Technology Proving LTL Properties of Bitvector Programs and Decompiled Binaries
L Ton Chanh LeLe, Ton Chanh Stevens Institute of Technology Proving LTL Properties of Bitvector Programs and Decompiled Binaries
Yue LiLi, Yue Nanjing UniversityChina Session Chair of Verification / Theory (mirror) (part of APLAS Research Papers) Committee Member in Program Committee within the APLAS Research Papers-track
Sam LindleyLindley, Sam The University of Edinburgh, UKUnited Kingdom Session Chair of Compilation / Transformation (part of APLAS Research Papers) Committee Member in Program Committee within the APLAS Research Papers-track
Cyrus LiuLiu, Cyrus Stevens Institute of TechnologyUnited States Proving LTL Properties of Bitvector Programs and Decompiled Binaries
Tianzuo LuoLuo, Tianzuo School of Computing, National University of Singapore Scalable and Modular Robustness Analysis of Deep Neural Networks
M Sergio MoverMover, Sergio Ecole Polytechnique Session Chair of Language Design (part of APLAS Research Papers) Committee Member in Program Committee within the APLAS Research Papers-track
N Koji NakazawaNakazawa, Koji Nagoya University Function Pointer Eliminator for C Programs
O Hakjoo OhOh, Hakjoo Korea UniversitySouth Korea Session Chair of Invited talk 1 (part of APLAS Keynote Talks) Program Chair in Organising Committee within the APLAS Research Papers-track Program Chair in Program Committee within the APLAS Research Papers-track
Atsushi OhoriOhori, Atsushi Tohoku University, Japan A compilation method for dynamic typing in ML
P Uday P. KhedkerP. Khedker, Uday Indian Institute of Technology (IIT) BombayIndia Committee Member in Program Committee within the APLAS Research Papers-track
Chengbin PangPang, Chengbin Stevens Institute of Technology Proving LTL Properties of Bitvector Programs and Decompiled Binaries
Simon PerdrixPerdrix, Simon Université de Lorraine, CNRS, Inria, LORIA F 54000 Nancy, France Hybrid quantum-classical circuit simplification with the ZX-calculus
Georgios PortokalidisPortokalidis, Georgios Stevens Institute of Technology Proving LTL Properties of Bitvector Programs and Decompiled Binaries
Alex PotaninPotanin, Alex Victoria University of WellingtonNew Zealand Committee Member in Program Committee within the APLAS Research Papers-track
Q Xiaokang QiuQiu, Xiaokang Purdue University, USA Session Chair of Verification / Theory (part of APLAS Research Papers) Committee Member in Program Committee within the APLAS Research Papers-track
S Ken SakayoriSakayori, Ken The University of Tokyo Termination Analysis for the $\pi$-Calculus by Reduction to Sequential Program Termination
Mark SantolucitoSantolucito, Mark Barnard College, Columbia University, USAUnited States Program Synthesis for Musicians: A Usability Testbed for Temporal Logic Specifications
Isao SasanoSasano, Isao Shibaura Institute of TechnologyJapan Server-Side Computation of Package Dependencies in Package-Management Systems
Ryosuke SatoSato, Ryosuke University of Tokyo, JapanJapan Termination Analysis for the $\pi$-Calculus by Reduction to Sequential Program Termination
Bernhard ScholzScholz, Bernhard University of SydneyAustralia The Choice Construct in the Soufflé Language
Tom SchrijversSchrijvers, Tom KU LeuvenBelgium Latent Effects for Reusable Language Components
Jiasi ShenShen, Jiasi Massachusetts Institute of Technology Session Chair of Analysis / Synthesis (part of APLAS Research Papers) Committee Member in Program Committee within the APLAS Research Papers-track
Tsubasa ShoshiShoshi, Tsubasa The University of Tokyo Termination Analysis for the $\pi$-Calculus by Reduction to Sequential Program Termination
Xujie SiSi, Xujie McGill University, Canada Session Chair of Invited talk 2 (part of APLAS Keynote Talks) Committee Member in Program Committee within the APLAS Research Papers-track
Gagandeep SinghSingh, Gagandeep University of Illinois at Urbana-ChampaignUnited States Committee Member in Program Committee within the APLAS Research Papers-track
Youngju SongSong, Youngju Seoul National UniversitySouth Korea Committee Member in Program Committee within the APLAS Research Papers-track
Zhendong SuSu, Zhendong ETH ZurichSwitzerland Solidifying and Advancing the Software Foundations
Kohei SuenagaSuenaga, Kohei Graduate School of Informatics, Kyoto UniversityJapan Committee Member in Program Committee within the APLAS Research Papers-track
Yulei SuiSui, Yulei University of New South Wales, SydneyAustralia Committee Member in Program Committee within the APLAS Research Papers-track
Martin SulzmannSulzmann, Martin Karlsruhe University of Applied Sciences, Germany A Dictionary-Passing Translation of Featherweight Go
T Quang-Trung TaTa, Quang-Trung National University of Singapore Scalable and Modular Robustness Analysis of Deep Neural Networks
Makoto TatsutaTatsuta, Makoto National Institute of Informatics Function Pointer Eliminator for C Programs
Tachio TerauchiTerauchi, Tachio Waseda UniversityJapan Committee Member in Program Committee within the APLAS Research Papers-track
Peter ThiemannThiemann, Peter University of Freiburg, Germany A Typed Programmatic Interface to Contracts on the Blockchain
Wei-Lun TsaiTsai, Wei-Lun Academia Sinica Solving Not-Substring with Flat Abstraction PyCT: A Python Concolic Tester
Stelios TsampasTsampas, Stelios FAU Erlangen-Nuremberg, INF 8Greece Fully Abstract and Robust Compilation and How to Reconcile the Two, Abstractly
Takeshi TsukadaTsukada, Takeshi Chiba University, JapanJapan Termination Analysis for the $\pi$-Calculus by Reduction to Sequential Program Termination
U Katsuhiro UenoUeno, Katsuhiro Tohoku UniversityJapan A compilation method for dynamic typing in ML
V Benoit ValironValiron, Benoit LRI, CentraleSupelec, Univ. Paris SaclayFrance Hybrid quantum-classical circuit simplification with the ZX-calculus
Birthe van den Bergvan den Berg, Birthe KU LeuvenBelgium Latent Effects for Reusable Language Components
Pavol VargovčíkVargovčík, Pavol Brno University of Technology, Czech Republic Preprocessing of Alternating Automata for Language Emptiness Testing
Michel VaziraniVazirani, Michel Columbia University Program Synthesis for Musicians: A Usability Testbed for Temporal Logic Specifications
W Xinyu WangWang, Xinyu University of MichiganUnited States Session Chair of Invited talk 1 (part of APLAS Keynote Talks) Committee Member in Program Committee within the APLAS Research Papers-track
Stefan WehrWehr, Stefan Offenburg University of Applied Sciences A Dictionary-Passing Translation of Featherweight Go
Nicolas WuWu, Nicolas Imperial College London, UKUnited Kingdom Latent Effects for Reusable Language Components
Wei-Cheng WuWu, Wei-Cheng University of Southern California, USA PyCT: A Python Concolic Tester
Xi WuWu, Xi The University of SydneyAustralia The Choice Construct in the Soufflé Language
Zhilin WuWu, Zhilin State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences Solving Not-Substring with Flat Abstraction
X Jun XuXu, Jun Stevens Institute of Technology Proving LTL Properties of Bitvector Programs and Decompiled Binaries
Y Di-De YenYen, Di-De Academia Sinica Solving Not-Substring with Flat Abstraction PyCT: A Python Concolic Tester
Fang YuYu, Fang National Chengchi University PyCT: A Python Concolic Tester
Z Fanlong ZHANGZHANG, Fanlong School of Computer, Guangdong University of Technology Scalable and Modular Robustness Analysis of Deep Neural Networks
Qirun ZhangZhang, Qirun Georgia Institute of Technology, USA Committee Member in Program Committee within the APLAS Research Papers-track
Xin ZhangZhang, Xin Peking UniversityChina Session Chair of Compilation / Transformation (mirror) (part of APLAS Research Papers) Committee Member in Program Committee within the APLAS Research Papers-track
David ZhaoZhao, David The University of Sydney The Choice Construct in the Soufflé Language
Yuyi ZhongZhong, Yuyi School of Computing, National University of Singapore Scalable and Modular Robustness Analysis of Deep Neural Networks
Abdul ZreikaZreika, Abdul The University of Sydney The Choice Construct in the Soufflé Language