![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/jlap/jlap114.bht:"
@article{DBLP:journals/jlap/AlshareefPSP20, author = {Hanaa Alshareef and Ra{\'{u}}l Pardo and Gerardo Schneider and Pablo Picazo{-}Sanchez}, title = {A collaborative access control framework for online social networks}, journal = {J. Log. Algebraic Methods Program.}, volume = {114}, pages = {100562}, year = {2020}, url = {https://doi.org/10.1016/j.jlamp.2020.100562}, doi = {10.1016/J.JLAMP.2020.100562}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jlap/AlshareefPSP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlap/BarkowskyG20, author = {Matthias Barkowsky and Holger Giese}, title = {Hybrid search plan generation for generalized graph pattern matching}, journal = {J. Log. Algebraic Methods Program.}, volume = {114}, pages = {100563}, year = {2020}, url = {https://doi.org/10.1016/j.jlamp.2020.100563}, doi = {10.1016/J.JLAMP.2020.100563}, timestamp = {Wed, 15 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jlap/BarkowskyG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlap/HarmerO20, author = {Russ Harmer and Eugenia Oshurko}, title = {Knowledge representation and update in hierarchies of graphs}, journal = {J. Log. Algebraic Methods Program.}, volume = {114}, pages = {100559}, year = {2020}, url = {https://doi.org/10.1016/j.jlamp.2020.100559}, doi = {10.1016/J.JLAMP.2020.100559}, timestamp = {Wed, 15 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jlap/HarmerO20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlap/Kapus-Kolar20, author = {Monika Kapus{-}Kolar}, title = {Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels}, journal = {J. Log. Algebraic Methods Program.}, volume = {114}, pages = {100560}, year = {2020}, url = {https://doi.org/10.1016/j.jlamp.2020.100560}, doi = {10.1016/J.JLAMP.2020.100560}, timestamp = {Wed, 01 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jlap/Kapus-Kolar20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlap/NassarKAT20, author = {Nebras Nassar and Jens Kosiol and Thorsten Arendt and Gabriele Taentzer}, title = {Constructing optimized constraint-preserving application conditions for model transformation rules}, journal = {J. Log. Algebraic Methods Program.}, volume = {114}, pages = {100564}, year = {2020}, url = {https://doi.org/10.1016/j.jlamp.2020.100564}, doi = {10.1016/J.JLAMP.2020.100564}, timestamp = {Wed, 15 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jlap/NassarKAT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jlap/ZhaoH20, author = {Xin Zhao and Philipp Haller}, title = {Replicated data types that unify eventual consistency and observable atomic consistency}, journal = {J. Log. Algebraic Methods Program.}, volume = {114}, pages = {100561}, year = {2020}, url = {https://doi.org/10.1016/j.jlamp.2020.100561}, doi = {10.1016/J.JLAMP.2020.100561}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jlap/ZhaoH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.