default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs594.bht:"
@article{DBLP:journals/tcs/0001V15, author = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and Heiko Vogler}, title = {Characterizing weighted {MSO} for trees by branching transitive closure logics}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {82--105}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.04.024}, doi = {10.1016/J.TCS.2015.04.024}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/0001V15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AkshayGMK15, author = {S. Akshay and Paul Gastin and Madhavan Mukund and K. Narayan Kumar}, title = {Checking conformance for time-constrained scenario-based specifications}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {24--43}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.03.030}, doi = {10.1016/J.TCS.2015.03.030}, timestamp = {Tue, 30 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AkshayGMK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FrenchMR15, author = {Tim French and John Christopher McCabe{-}Dansted and Mark Reynolds}, title = {Synthesis for continuous time}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {201--222}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.06.032}, doi = {10.1016/J.TCS.2015.06.032}, timestamp = {Fri, 02 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/FrenchMR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ItoISIHY15, author = {Sohei Ito and Takuma Ichinose and Masaya Shimakawa and Naoko Izumi and Shigeki Hagihara and Naoki Yonezaki}, title = {Qualitative analysis of gene regulatory networks by temporal logic}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {151--179}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.06.017}, doi = {10.1016/J.TCS.2015.06.017}, timestamp = {Tue, 04 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ItoISIHY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JiaJKLZ15, author = {Xiaodong Jia and Achim Jung and Hui Kou and Qingguo Li and Haoran Zhao}, title = {All cartesian closed categories of quasicontinuous domains consist of domains}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {143--150}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.05.014}, doi = {10.1016/J.TCS.2015.05.014}, timestamp = {Fri, 28 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/JiaJKLZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MachadoRH15, author = {Rodrigo Machado and Leila Ribeiro and Reiko Heckel}, title = {Rule-based transformation of graph rewriting rules: Towards higher-order graph grammars}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {1--23}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.01.034}, doi = {10.1016/J.TCS.2015.01.034}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MachadoRH15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Matos15, author = {Armando B. Matos}, title = {The efficiency of primitive recursive functions: {A} programmer's view}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {65--81}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.04.022}, doi = {10.1016/J.TCS.2015.04.022}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Matos15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/NasabH15, author = {A. R. Shir Ali Nasab and S. N. Hosseini}, title = {Partial pullback complement rewriting}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {44--64}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.04.006}, doi = {10.1016/J.TCS.2015.04.006}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/NasabH15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/RebihaMM15, author = {Rachid Rebiha and Arnaldo Vieira Moura and Nadir Matringe}, title = {Generating invariants for non-linear hybrid systems}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {180--200}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.06.018}, doi = {10.1016/J.TCS.2015.06.018}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/RebihaMM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/TeichmannO15, author = {Markus Teichmann and Johannes Osterholzer}, title = {A link between multioperator and tree valuation automata and logics}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {106--119}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.04.033}, doi = {10.1016/J.TCS.2015.04.033}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/TeichmannO15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/YatapanageW15, author = {Nisansala Yatapanage and Kirsten Winter}, title = {Next-preserving branching bisimulation}, journal = {Theor. Comput. Sci.}, volume = {594}, pages = {120--142}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2015.05.013}, doi = {10.1016/J.TCS.2015.05.013}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/YatapanageW15.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.