Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jlp/jlp94.bht:"
@article{DBLP:journals/jlp/Bernardo18, author = {Marco Bernardo}, title = {ULTraS at work: Compositionality metaresults for bisimulation and trace semantics}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {150--182}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2017.10.002}, doi = {10.1016/J.JLAMP.2017.10.002}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/Bernardo18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/Bhaskar18, author = {Siddharth Bhaskar}, title = {Recursion versus tail recursion over {\unicode{8254}}{\(\mathbb{F}\)}\({}_{\mbox{p}}\)}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {68--90}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2017.08.003}, doi = {10.1016/J.JLAMP.2017.08.003}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/Bhaskar18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/Bjorner18, author = {Dines Bj{\o}rner}, title = {To every manifest domain a {CSP} expression - a r{\^{o}}le for mereology in computer science}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {91--108}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2017.09.005}, doi = {10.1016/J.JLAMP.2017.09.005}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/Bjorner18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/Hasuo18, author = {Ichiro Hasuo}, title = {Preface}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {183}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2017.11.001}, doi = {10.1016/J.JLAMP.2017.11.001}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jlp/Hasuo18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/Jacobs18, author = {Bart Jacobs}, title = {From probability monads to commutative effectuses}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {200--237}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2016.11.006}, doi = {10.1016/J.JLAMP.2016.11.006}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/Jacobs18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/JohnsenSS18, author = {Einar Broch Johnsen and Martin Steffen and Johanna Beate Stumpf}, title = {Virtually timed ambients: {A} calculus of nested virtualization}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {109--127}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2017.10.001}, doi = {10.1016/J.JLAMP.2017.10.001}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/JohnsenSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/LemosDFN18, author = {Marcilio O. O. Lemos and Yuri Gil Dantas and Iguatemi E. Fonseca and Vivek Nigam}, title = {On the accuracy of formal verification of selective defenses for TDoS attacks}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {45--67}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2017.09.001}, doi = {10.1016/J.JLAMP.2017.09.001}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/LemosDFN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/NishidaPV18, author = {Naoki Nishida and Adri{\'{a}}n Palacios and Germ{\'{a}}n Vidal}, title = {Reversible computation in term rewriting}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {128--149}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2017.10.003}, doi = {10.1016/J.JLAMP.2017.10.003}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/NishidaPV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/Oliveira18, author = {Jos{\'{e}} Nuno Oliveira}, title = {Programming from metaphorisms}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {15--44}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2017.09.003}, doi = {10.1016/J.JLAMP.2017.09.003}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/Oliveira18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/PaviottiB18, author = {Marco Paviotti and Jesper Bengtson}, title = {Formally verifying exceptions for low-level code with separation logic}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {1--14}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2017.09.004}, doi = {10.1016/J.JLAMP.2017.09.004}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/PaviottiB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlp/Sprunger18, author = {David Sprunger}, title = {A complete logic for behavioural equivalence in coalgebras of finitary set functors}, journal = {J. Log. Algebraic Methods Program.}, volume = {94}, pages = {184--199}, year = {2018}, url = {https://doi.org/10.1016/j.jlamp.2017.05.001}, doi = {10.1016/J.JLAMP.2017.05.001}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jlp/Sprunger18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.