Towards Critical Pair Analysis for the Graph Programming Language GP 2

Ivaylo Hristakiev, Detlef Plump

Open source

DOI: 10.1007/978-3-319-72044-9_11
Published: 2017
Container: Not recorded
Publisher: Springer International Publishing
Open access: yes

Credibility signals

uncertain Score 51/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

cautionDOI registered: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
cautionDOI resolves: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
supportingOpen access status: Normalized open-access status: open. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
supportingMetadata completeness: All 6 scored descriptive metadata groups are present. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1007/978-3-319-72044-9_11,
  title = {Towards Critical Pair Analysis for the Graph Programming Language GP 2},
  author = {Ivaylo Hristakiev and Detlef Plump},
  year = {2017},
  doi = {10.1007/978-3-319-72044-9_11},
  url = {https://doi.org/10.1007/978-3-319-72044-9_11}
}

RIS

TY  - JOUR
TI  - Towards Critical Pair Analysis for the Graph Programming Language GP 2
AU  - Ivaylo Hristakiev
AU  - Detlef Plump
PY  - 2017
DO  - 10.1007/978-3-319-72044-9_11
UR  - https://doi.org/10.1007/978-3-319-72044-9_11
ER  -

APA

Hristakiev, I., & Plump, D. (2017). Towards Critical Pair Analysis for the Graph Programming Language GP 2. https://doi.org/10.1007/978-3-319-72044-9_11

Source records

hal · retrieved 2026-11-10T10:10:43.596Z