BibTeX records: Solomon Passy

• > Home > Persons > Solomon Passy

@article{DBLP:journals/logcom/GorankoP92,
  author       = {Valentin Goranko and
                  Solomon Passy},
  title        = {Using the Universal Modality: Gains and Questions},
  journal      = {J. Log. Comput.},
  volume       = {2},
  number       = {1},
  pages        = {5--30},
  year         = {1992},
  url          = {https://doi.org/10.1093/logcom/2.1.5},
  doi          = {10.1093/LOGCOM/2.1.5},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/logcom/GorankoP92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GargovP88,
  author       = {George Gargov and
                  Solomon Passy},
  title        = {Determinism and Looping in Combinatory {PDL}},
  journal      = {Theor. Comput. Sci.},
  volume       = {61},
  pages        = {259--277},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90126-0},
  doi          = {10.1016/0304-3975(88)90126-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GargovP88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/PassyT85,
  author       = {Solomon Passy and
                  Tinko Tinchev},
  title        = {{PDL} with Data Constants},
  journal      = {Inf. Process. Lett.},
  volume       = {20},
  number       = {1},
  pages        = {35--41},
  year         = {1985},
  url          = {https://doi.org/10.1016/0020-0190(85)90127-9},
  doi          = {10.1016/0020-0190(85)90127-9},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/PassyT85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fct/PassyT85,
  author       = {Solomon Passy and
                  Tinko Tinchev},
  editor       = {Lothar Budach},
  title        = {Quantifiers in combinatory {PDL:} completeness, definability, incompleteness},
  booktitle    = {Fundamentals of Computation Theory, {FCT} '85, Cottbus, GDR, September
                  9-13, 1985},
  series       = {Lecture Notes in Computer Science},
  volume       = {199},
  pages        = {512--519},
  publisher    = {Springer},
  year         = {1985},
  url          = {https://doi.org/10.1007/BFb0028835},
  doi          = {10.1007/BFB0028835},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/PassyT85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Passy80,
  author       = {Solomon Passy},
  title        = {Structured Programs for Turing Machines},
  journal      = {Inf. Process. Lett.},
  volume       = {10},
  number       = {2},
  pages        = {63--67},
  year         = {1980},
  url          = {https://doi.org/10.1016/S0020-0190(80)90075-7},
  doi          = {10.1016/S0020-0190(80)90075-7},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Passy80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}