Powered by
ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM 2018), January 8–9, 2018,
Los Angeles, CA, USA
ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM 2018)
Title Page
Article: poplws18pepmforeword-fm000-p doi:
A Guess-and-Assume Approach to Loop Fusion for Program Verification
Akifumi Imanishi,
Kohei Suenaga, and
Atsushi Igarashi
(Kyoto University, Japan)
@InProceedings{PEPM18p16,
author = {Akifumi Imanishi and Kohei Suenaga and Atsushi Igarashi},
title = {A Guess-and-Assume Approach to Loop Fusion for Program Verification},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {16-15},
doi = {10.1145/3162070},
year = {2018},
}
Publisher's Version
Article: poplws18pepmmain-p13-p doi:10.1145/3162070
Gradually Typed Symbolic Expressions
David Broman and
Jeremy G. Siek
(KTH, Sweden; Indiana University, USA)
@InProceedings{PEPM18p31,
author = {David Broman and Jeremy G. Siek},
title = {Gradually Typed Symbolic Expressions},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {31-30},
doi = {10.1145/3162068},
year = {2018},
}
Publisher's Version
Article: poplws18pepmmain-p10-p doi:10.1145/3162068
On the Cost of Type-Tag Soundness
Ben Greenman and
Zeina Migeed
(Northeastern University, USA)
@InProceedings{PEPM18p46,
author = {Ben Greenman and Zeina Migeed},
title = {On the Cost of Type-Tag Soundness},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {46-45},
doi = {10.1145/3162066},
year = {2018},
}
Publisher's Version
Article: poplws18pepmmain-p2-p doi:10.1145/3162066
Selective CPS Transformation for Shift and Reset
Kenichi Asai and
Chihiro Uehara
(Ochanomizu University, Japan)
@InProceedings{PEPM18p61,
author = {Kenichi Asai and Chihiro Uehara},
title = {Selective CPS Transformation for Shift and Reset},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {61-60},
doi = {10.1145/3162069},
year = {2018},
}
Publisher's Version
Article: poplws18pepmmain-p11-p doi:10.1145/3162069
Checking Cryptographic API Usage with Composable Annotations (Short Paper)
Duncan Mitchell,
L. Thomas van Binsbergen,
Blake Loring, and
Johannes Kinder
(Royal Holloway University of London, UK)
@InProceedings{PEPM18p76,
author = {Duncan Mitchell and L. Thomas van Binsbergen and Blake Loring and Johannes Kinder},
title = {Checking Cryptographic API Usage with Composable Annotations (Short Paper)},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {76-75},
doi = {10.1145/3162071},
year = {2018},
}
Publisher's Version
Article: poplws18pepmmain-p16-p doi:10.1145/3162071
Program Generation for ML Modules (Short Paper)
Takahisa Watanabe and
Yukiyoshi Kameyama
(University of Tsukuba, Japan)
@InProceedings{PEPM18p85,
author = {Takahisa Watanabe and Yukiyoshi Kameyama},
title = {Program Generation for ML Modules (Short Paper)},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {85-84},
doi = {10.1145/3162072},
year = {2018},
}
Publisher's Version
Article: poplws18pepmmain-p17-p doi:10.1145/3162072
Recursive Programs in Normal Form (Short Paper)
Barry Jay
(University of Technology Sydney, Australia)
@InProceedings{PEPM18p94,
author = {Barry Jay},
title = {Recursive Programs in Normal Form (Short Paper)},
booktitle = {Proc.\ PEPM},
publisher = {ACM},
pages = {94-93},
doi = {10.1145/3162067},
year = {2018},
}
Publisher's Version
Article: poplws18pepmmain-p3-p doi:10.1145/3162067
proc time: 0.02