Home › Entities › academia › Efficient refactoring scheduling based on partial order reduction

Efficient refactoring scheduling based on partial order reduction

Research article (Journal of Systems and Software, 2018) · cited 17× · AI/ML
CreativeWork academia

Facts

4 properties
Instance of
scholarly article[2]
Publication date
July 30, 2018as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Published in
Journal of Systems and Softwareas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Title
Efficient refactoring scheduling based on partial order reductionas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
🔖 Identifiers · 2
OpenAlex ID
W2887665274as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
DOI
10.1016/J.JSS.2018.07.076as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded

Report an error or request removal Lineage (PROV-JSON)

📜 Data licence
Source: OpenAlex (openalex.org), snapshot of 2026-09-23. CC0 1.0 Universal. CC0 1.0 Universal · OpenAlex
🔗 Connections
Authored by 2
Francisco Chicano, Giuliano Antoniol
← Author of 2
Francisco Chicano, Giuliano Antoniol
Press Enter · cited answer in seconds

Summary

Efficient refactoring scheduling based on partial order reduction is a scholarly article[1].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Efficient refactoring scheduling based on partial order reduction. Retrieved October 18, 2026, from https://4ort.xyz/entity/efficient-refactoring-scheduling-based-on-partial-order-reduction
MLA “Efficient refactoring scheduling based on partial order reduction.” 4ort.xyz Knowledge Graph, 4ort.xyz, 18 Oct. 2026, https://4ort.xyz/entity/efficient-refactoring-scheduling-based-on-partial-order-reduction.
BibTeX @misc{4ortxyz_efficient-refactoring-scheduling-based-on-partial-order-reduction_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Efficient refactoring scheduling based on partial order reduction}}, year = {2026}, url = {https://4ort.xyz/entity/efficient-refactoring-scheduling-based-on-partial-order-reduction}, note = {Accessed: 2026-10-18}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Efficient refactoring scheduling based on partial order reduction — https://4ort.xyz/entity/efficient-refactoring-scheduling-based-on-partial-order-reduction (retrieved 2026-10-18)

Canonical URL: https://4ort.xyz/entity/efficient-refactoring-scheduling-based-on-partial-order-reduction · Last refreshed: