On the public citation graph
Complexity of analyzing the synchronization structure of concurrent programs
0 signed · 182 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.4380060405openalex-snapshot
Dave—a validation error detection and documentation system for fortran programs
inferredcites →https://doi.org/10.1002/spe.4380130805openalex-snapshot
An integrated verification and testing environment
inferredcites →https://doi.org/10.1007/978-3-642-46430-0_6openalex-snapshot
A Software Lifecycle Methodology and Tool Support
inferredcites →https://doi.org/10.1007/bfb0029355openalex-snapshot
The specification of process synchronization by path expressions
inferredcites →https://doi.org/10.1016/0022-0000(80)90033-1openalex-snapshot
The complexity of problems in systems of communicating sequential processes
inferredcites →https://doi.org/10.1109/cmpsac.1978.810304openalex-snapshot
A facility for verification, testing and documentation of concurrent process software
inferredcites →https://doi.org/10.1109/sfcs.1979.5openalex-snapshot
Approximate algorithms for optimization of busy waiting in parallel programs
inferredcites →https://doi.org/10.1109/tc.1982.1675974openalex-snapshot
Deadlock-Free Systems for a Bounded Number of Processes
inferredcites →https://doi.org/10.1109/tse.1977.231144openalex-snapshot
Symbolic Testing and the DISSECT Symbolic Evaluation System
inferredcites →https://doi.org/10.1109/tse.1980.234488openalex-snapshot
Anomaly Detection in Concurrent Software by Static Data Flow Analysis
inferredcites →https://doi.org/10.1137/0207027openalex-snapshot
Deadlock Prediction: Easy and Difficult Cases
inferredcites →https://doi.org/10.1145/356603.356607openalex-snapshot
Some Deadlock Properties of Computer Systems
inferredcites →https://doi.org/10.1145/357103.357107openalex-snapshot
Applicability of Software Validation Techniques to Scientific Programs
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359588.359596openalex-snapshot
A practical interprocedural data flow analysis algorithm
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1145/567752.567757openalex-snapshot
Principles of proving concurrent programs in Gypsy
inferredcites →https://doi.org/10.1145/567752.567777openalex-snapshot
Data flow analysis of communicating processes
inferredcites →https://doi.org/10.21236/ada090709openalex-snapshot
Reference Manual for the Ada Programming Language. Proposed Standard Document
inferredcites →https://doi.org/10.5555/800091.802948openalex-snapshot
Anomaly detection in concurrent programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471028959.sof094openalex-snapshot
Distributed Software Engineering
inferred← citeshttps://doi.org/10.1002/spe.4380130805openalex-snapshot
An integrated verification and testing environment
inferred← citeshttps://doi.org/10.1002/stvr.252openalex-snapshot
Syntactic reductions for efficient deadlock analysis
inferred← citeshttps://doi.org/10.1002/stvr.4370040404openalex-snapshot
Re‐designing tasking structures of Ada programs for analysis: A case study
inferred← citeshttps://doi.org/10.1007/11535294_6openalex-snapshot
Allowing Atomic Objects to Coexist with Sequentially Consistent Objects
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_44openalex-snapshot
Polynomial-time analysis for a class of communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-36087-5_100openalex-snapshot
Sequential Consistency as Lazy Linearizability
inferred← citeshttps://doi.org/10.1007/3-540-36103-0_29openalex-snapshot
Detecting Deadlock in Ada Rendezvous Flow Structure Based on Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_43openalex-snapshot
The Complexity of Copy Constant Detection in Parallel Programs
inferred← citeshttps://doi.org/10.1007/3-540-48166-4_21openalex-snapshot
An Efficient Algorithm for Computing MHP Information for Concurrent Java Programs
inferred← citeshttps://doi.org/10.1007/3-540-57209-0_20openalex-snapshot
Tractable flow analysis for anomaly detection in distributed programs
inferred← citeshttps://doi.org/10.1007/3-540-60042-6_16openalex-snapshot
Sequential consistency in distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-60406-5_24openalex-snapshot
An exploratory study of program metrics as predictors of reachability analysis performance
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_17openalex-snapshot
A non-standard semantics for generating reduced transition systems
inferred← citeshttps://doi.org/10.1007/978-3-322-94670-6_6openalex-snapshot
Literaturverzeichnis zur parallelen Programmierung
inferred← citeshttps://doi.org/10.1007/978-3-540-68555-5_4openalex-snapshot
Static Nonconcurrency Analysis of OpenMP Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-69330-7_11openalex-snapshot
Efficient Computation of May-Happen-in-Parallel Information for Concurrent Java Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-85261-2_7openalex-snapshot
Concurrency Analysis for Shared Memory Programs with Textually Unaligned Barriers
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_4openalex-snapshot
Efficient May Happen in Parallel Analysis for Async-Finish Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-662-60421-2_2openalex-snapshot
Methodische und technische Grundlagen
inferred← citeshttps://doi.org/10.1007/bf00283332openalex-snapshot
The complexity of reachability in distributed communicating processes
inferred← citeshttps://doi.org/10.1007/bf00873407openalex-snapshot
Contextual local analysis in the design of distributed systems
inferred← citeshttps://doi.org/10.1007/bf01189855openalex-snapshot
Complexity analysis of propositional concurrent programs using domino tiling
inferred← citeshttps://doi.org/10.1007/bf01762125openalex-snapshot
On the analysis of cooperation and antagonism in networks of communicating processes
inferred← citeshttps://doi.org/10.1007/bf02737107openalex-snapshot
The complexity of reachability in distributed communicating processes
inferred← citeshttps://doi.org/10.1007/s00778-013-0330-1openalex-snapshot
Quantifying eventual consistency with PBS
inferred← citeshttps://doi.org/10.1016/0164-1212(88)90027-1openalex-snapshot
A petri net framework for automated static analysis of Ada tasking behavior
inferred← citeshttps://doi.org/10.1016/0164-1212(89)90046-0openalex-snapshot
Finding reachable states of finite-state concurrent systems
inferred← citeshttps://doi.org/10.1016/0164-1212(90)90105-uopenalex-snapshot
Algorithms for analyzing concurrent software systems using derivatives
inferred← citeshttps://doi.org/10.1016/0164-1212(92)90090-7openalex-snapshot
Software complexity and ada rendezvous: Metrics based on nondeterminism
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00011-5openalex-snapshot
Petri-net-based deadlock analysis of Process Algebra programs
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90010-5openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0950-5849(90)90113-6openalex-snapshot
Modular verification of correctness properties in environment for concurrent systems specifications: deadlock case
inferred← citeshttps://doi.org/10.1016/j.ic.2005.07.004openalex-snapshot
Using heuristic search for finding deadlocks in concurrent systems
inferred← citeshttps://doi.org/10.1016/j.ins.2008.06.020openalex-snapshot
A rigorous approach towards test case generation
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.01.006openalex-snapshot
Scaling model checking of dataraces using dynamic information
inferred← citeshttps://doi.org/10.1016/j.scico.2016.01.007openalex-snapshot
Parallelism analysis: Precise WCET values for complex multi-core systems
inferred← citeshttps://doi.org/10.1016/s0167-6423(97)00017-8openalex-snapshot
State space reduction by non-standard semantics for deadlock analysis
inferred← citeshttps://doi.org/10.1016/s0950-5849(02)00106-4openalex-snapshot
Concurrent Ada dead statements detection
inferred← citeshttps://doi.org/10.1080/02286203.1992.11760159openalex-snapshot
A Processor Scheduling Model For Deadlock Prevention In A Consumable Resource Environment
inferred← citeshttps://doi.org/10.1109/32.106975openalex-snapshot
Automated analysis of concurrent systems with the constrained expression toolset
inferred← citeshttps://doi.org/10.1109/32.214836openalex-snapshot
Comments on "Temporal logic-based deadlock analysis for Ada" by G.M. Karam and R.J.A. Burh
inferred← citeshttps://doi.org/10.1109/32.214837openalex-snapshot
Correction to 'A practical view of software measurement and implementation experiences within Motorola'
inferred← citeshttps://doi.org/10.1109/32.310668openalex-snapshot
Tractable dataflow analysis for distributed systems
inferred← citeshttps://doi.org/10.1109/32.317429openalex-snapshot
Automated derivation of time bounds in uniprocessor concurrent systems
inferred← citeshttps://doi.org/10.1109/32.553699openalex-snapshot
A compact Petri net representation and its implications for analysis
inferred← citeshttps://doi.org/10.1109/32.6195openalex-snapshot
Combining static concurrency analysis with symbolic execution
inferred← citeshttps://doi.org/10.1109/32.9044openalex-snapshot
Description for a tool specifying and prototyping concurrent programs
inferred← citeshttps://doi.org/10.1109/32.988494openalex-snapshot
Improving the precision of INCA by eliminating solutions with spurious cycles
inferred← citeshttps://doi.org/10.1109/71.553301openalex-snapshot
An application of Petri net reduction for Ada tasking deadlock analysis
inferred← citeshttps://doi.org/10.1109/access.2018.2885705openalex-snapshot
Automatic Inference of Task Parallelism in Task-Graph-Based Actor Models
inferred← citeshttps://doi.org/10.1109/aina.2003.1192915openalex-snapshot
Token-based sequential consistency in asynchronous distributed systems
inferred← citeshttps://doi.org/10.1109/aina.2005.64openalex-snapshot
A Simple Protocol Offering Both Atomic Consistent Read Operations and Sequentially Consistent Read Operations
inferred← citeshttps://doi.org/10.1109/apsec.1995.496958openalex-snapshot
An efficient debugging method for message-based parallel programs using static analysis information
inferred← citeshttps://doi.org/10.1109/hicss.1993.284103openalex-snapshot
Complexity analysis of propositional concurrent programs using domino tiling
inferred← citeshttps://doi.org/10.1109/hpca.2018.00029openalex-snapshot
High-Performance GPU Transactional Memory via Eager Conflict Detection
inferred← citeshttps://doi.org/10.1109/icdcs.1998.679835openalex-snapshot
Consistency conditions for multi-object distributed operations
inferred← citeshttps://doi.org/10.1109/icdcs.2004.1281621openalex-snapshot
A distributed implementation of sequential consistency with multi-object operations
inferred← citeshttps://doi.org/10.1109/icdcs.2004.1281622openalex-snapshot
Epidemic algorithms for reliable content-based publish-subscribe: an evaluation
inferred← citeshttps://doi.org/10.1109/icdcs.2013.45openalex-snapshot
On the k-Atomicity-Verification Problem
inferred← citeshttps://doi.org/10.1109/icpp.2015.98openalex-snapshot
Region-Based May-Happen-in-Parallel Analysis for C Programs
inferred← citeshttps://doi.org/10.1109/icse.1989.714392openalex-snapshot
Task Interaction Graphs For Concurrency Analysis
inferred← citeshttps://doi.org/10.1109/icse.1994.296793openalex-snapshot
An integrated method for effective behaviour analysis of distributed systems
inferred← citeshttps://doi.org/10.1109/icsm.1994.336786openalex-snapshot
Combining static and dynamic analysis of concurrent programs
inferred← citeshttps://doi.org/10.1109/issre.2002.1173279openalex-snapshot
Blocking-based simultaneous reachability analysis of asynchronous message-passing programs
inferred← citeshttps://doi.org/10.1109/issre.2010.40openalex-snapshot
A 2-Phase Method for Validation of Matching Pair Property with Case Studies of Operating Systems
inferred← citeshttps://doi.org/10.1109/ms.1985.230351openalex-snapshot
Debugging Ada Tasking Programs
inferred← citeshttps://doi.org/10.1109/pccc.1991.113823openalex-snapshot
A software complexity perspective on nondeterminism used to support intertask communication
inferred← citeshttps://doi.org/10.1109/pccc.1995.472472openalex-snapshot
Query-driven petri net reduction for analysis in Ada tasking
inferred← citeshttps://doi.org/10.1109/pdcat.2012.59openalex-snapshot
Can We Make It Faster? Efficient May-Happen-in-Parallel Analysis Revisited
inferred← citeshttps://doi.org/10.1109/scam.2001.972667openalex-snapshot
Detecting dead statements for concurrent programs
inferred← citeshttps://doi.org/10.1109/tase.2013.2285574openalex-snapshot
A Polynomial Algorithm to Performance Analysis of Concurrent Systems Via Petri Nets and Ordinary Differential Equations
inferred← citeshttps://doi.org/10.1109/tfuzz.2010.2089633openalex-snapshot
Performance Analysis of Service Composition Based on Fuzzy Differential Equations
inferred← citeshttps://doi.org/10.1109/tpds.2005.86openalex-snapshot
The complexity of verifying memory coherence and consistency
inferred← citeshttps://doi.org/10.1109/tse.1984.5010305openalex-snapshot
Monitoring for Deadlock and Blocking in Ada Tasking
inferred← citeshttps://doi.org/10.1109/tse.1985.232213openalex-snapshot
Steps to an Advanced Ada1Programming Environment
inferred← citeshttps://doi.org/10.1109/tsmc.2014.2311757openalex-snapshot
Ordinary Differential Equation-Based Deadlock Detection
inferred← citeshttps://doi.org/10.1109/uemcon67449.2025.11267551openalex-snapshot
Calculating the Increased Speed of Polymorphic Encryption
inferred← citeshttps://doi.org/10.1109/wst.1988.5366openalex-snapshot
Task interaction graphs for concurrency analysis
inferred← citeshttps://doi.org/10.1145/1040291.1040292openalex-snapshot
Flow analysis for verifying properties of concurrent software systems
inferred← citeshttps://doi.org/10.1145/1065944.1065958openalex-snapshot
Scaling model checking of dataraces using dynamic information
inferred← citeshttps://doi.org/10.1145/113379.113408openalex-snapshot
Detecting violations of sequential consistency
inferred← citeshttps://doi.org/10.1145/115952.115976openalex-snapshot
Detecting data races on weak memory systems
inferred← citeshttps://doi.org/10.1145/115953.115976openalex-snapshot
Detecting data races on weak memory systems
inferred← citeshttps://doi.org/10.1145/120807.120810openalex-snapshot
Data flow analysis of concurrent systems that use the rendezvous model of synchronization
inferred← citeshttps://doi.org/10.1145/120807.120811openalex-snapshot
Concurrency analysis in the presence of procedures using a data-flow framework
inferred← citeshttps://doi.org/10.1145/120807.120812openalex-snapshot
Compositional reachability analysis using process algebra
inferred← citeshttps://doi.org/10.1145/122037.122040openalex-snapshot
A survey of tasking deadlock detection methods
inferred← citeshttps://doi.org/10.1145/122203.122205openalex-snapshot
A bibliography of parallel debuggers, 1990 edition
inferred← citeshttps://doi.org/10.1145/122759.122768openalex-snapshot
A model of Ada programs for static deadlock detection in polynomial times
inferred← citeshttps://doi.org/10.1145/1229428.1229471openalex-snapshot
May-happen-in-parallel analysis of X10 programs
inferred← citeshttps://doi.org/10.1145/127695.122768openalex-snapshot
A model of Ada programs for static deadlock detection in polynomial times
inferred← citeshttps://doi.org/10.1145/1321631.1321678openalex-snapshot
Testing concurrent programs using value schedules
inferred← citeshttps://doi.org/10.1145/1390841.1390849openalex-snapshot
Towards a better collaboration of static and dynamic analyses for testing concurrent programs
inferred← citeshttps://doi.org/10.1145/167049.167071openalex-snapshot
Enhancing compositional reachability analysis with context constraints
inferred← citeshttps://doi.org/10.1145/186258.187206openalex-snapshot
An empirical evaluation of three methods for deadlock analysis of Ada tasking programs
inferred← citeshttps://doi.org/10.1145/193173.195295openalex-snapshot
Data flow analysis for verifying properties of concurrent programs
inferred← citeshttps://doi.org/10.1145/195274.195295openalex-snapshot
Data flow analysis for verifying properties of concurrent programs
inferred← citeshttps://doi.org/10.1145/1993806.1993834openalex-snapshot
Analyzing consistency properties for fun and profit
inferred← citeshttps://doi.org/10.1145/201024.201038openalex-snapshot
Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada
inferred← citeshttps://doi.org/10.1145/201055.201080openalex-snapshot
A concurrency analysis tool suite for Ada programs
inferred← citeshttps://doi.org/10.1145/226295.226299openalex-snapshot
Improving the accuracy of Petri net-based analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/229000.226299openalex-snapshot
Improving the accuracy of Petri net-based analysis of concurrent programs
inferred← citeshttps://doi.org/10.1145/235321.235323openalex-snapshot
Context constraints for compositional reachability analysis
inferred← citeshttps://doi.org/10.1145/2370816.2370900openalex-snapshot
Making it practical and effective
inferred← citeshttps://doi.org/10.1145/239098.239114openalex-snapshot
Verification of communication protocols using data flow analysis
inferred← citeshttps://doi.org/10.1145/250707.239114openalex-snapshot
Verification of communication protocols using data flow analysis
inferred← citeshttps://doi.org/10.1145/2518188openalex-snapshot
Analysis of Recursively Parallel Programs
inferred← citeshttps://doi.org/10.1145/256428.167071openalex-snapshot
Enhancing compositional reachability analysis with context constraints
inferred← citeshttps://doi.org/10.1145/2632792openalex-snapshot
Quantifying eventual consistency with PBS
inferred← citeshttps://doi.org/10.1145/2668119openalex-snapshot
Compiler Optimization for Reducing Leakage Power in Multithread BSP Programs
inferred← citeshttps://doi.org/10.1145/2824255openalex-snapshot
May-Happen-in-Parallel Analysis for Actor-Based Concurrency
inferred← citeshttps://doi.org/10.1145/288195.288213openalex-snapshot
A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel
inferred← citeshttps://doi.org/10.1145/291252.288213openalex-snapshot
A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel
inferred← citeshttps://doi.org/10.1145/301308.301350openalex-snapshot
Timed consistency for shared distributed objects
inferred← citeshttps://doi.org/10.1145/3126496openalex-snapshot
Tightening Contention Delays While Scheduling Parallel Applications on Multi-core Architectures
inferred← citeshttps://doi.org/10.1145/318774.319252openalex-snapshot
An efficient algorithm for computing MHP information for concurrent Java programs
inferred← citeshttps://doi.org/10.1145/318789.318809openalex-snapshot
Compile-time detection of race conditions in a parallel program
inferred← citeshttps://doi.org/10.1145/323596.323599openalex-snapshot
On the analysis of cooperation and antagonism in networks of communicating processes
inferred← citeshttps://doi.org/10.1145/326490.326505openalex-snapshot
A graphical trace analysis tool for Ada real-time embedded systems
inferred← citeshttps://doi.org/10.1145/326490.326509openalex-snapshot
Ada language considerations for concurrency analysis
inferred← citeshttps://doi.org/10.1145/327011.327076openalex-snapshot
Analysis tools for Ada concurrency designs
inferred← citeshttps://doi.org/10.1145/3304133.3304136openalex-snapshot
Monitoring for deadlocks in Ada tasking
inferred← citeshttps://doi.org/10.1145/349214.349241openalex-snapshot
Context-sensitive synchronization-sensitive analysis is undecidable
inferred← citeshttps://doi.org/10.1145/3771775.3786279openalex-snapshot
Practical MHP Analysis for Java
inferred← citeshttps://doi.org/10.1145/380752.380864openalex-snapshot
On optimal slicing of parallel programs
inferred← citeshttps://doi.org/10.1145/507546.507601openalex-snapshot
Detecting concurrently executed pairs of statements using an adapted MHP algorithm
inferred← citeshttps://doi.org/10.1145/507574.507601openalex-snapshot
Detecting concurrently executed pairs of statements using an adapted MHP algorithm
inferred← citeshttps://doi.org/10.1145/564870.564896openalex-snapshot
Sequential consistency as lazy linearizability
inferred← citeshttps://doi.org/10.1145/74587.74592openalex-snapshot
Task interaction graphs for concurrency analysis
inferred← citeshttps://doi.org/10.1145/75308.75331openalex-snapshot
Integrated concurrency analysis in a software development enviornment
inferred← citeshttps://doi.org/10.1145/75309.75331openalex-snapshot
Integrated concurrency analysis in a software development enviornment
inferred← citeshttps://doi.org/10.1145/777412.777457openalex-snapshot
The complexity of verifying memory coherence
inferred← citeshttps://doi.org/10.1145/91354.91367openalex-snapshot
Ramifications of re-introducing asynchronous exceptions to the Ada language
inferred← citeshttps://doi.org/10.1145/940071.940073openalex-snapshot
Understanding process and the quest for deeper questions in software engineering research
inferred← citeshttps://doi.org/10.1145/949952.940073openalex-snapshot
Understanding process and the quest for deeper questions in software engineering research
inferred← citeshttps://doi.org/10.1145/998421.998427openalex-snapshot
Runtime detection and description of deadness errors in Ada tasking
inferred← citeshttps://doi.org/10.1147/sj.411.0140openalex-snapshot
FLAVERS: A finite state verification technique for software systems
inferred← citeshttps://doi.org/10.11606/d.55.2008.tde-21052008-111500openalex-snapshot
Teste de composição de web services: uma estratégia baseada em um modelo de teste de programas paralelos
inferred← citeshttps://doi.org/10.17877/de290r-7209openalex-snapshot
WCET analysis and optimization for multi-core real-time systems
inferred← citeshttps://doi.org/10.31274/etd-180810-167openalex-snapshot
Proving safety properties of software
inferred← citeshttps://doi.org/10.3929/ethz-a-004756402openalex-snapshot
Detecting synchronization defects in multi-threaded object-oriented programs
inferred← citeshttps://doi.org/10.5381/jot.2010.9.2.a2openalex-snapshot
Automatic Test Data Synthesis using UML Sequence Diagrams.
inferred← citeshttps://doi.org/10.5555/257734.257792openalex-snapshot
An integrated method for effective behaviour analysis of distributed systems
inferred← citeshttps://doi.org/10.5555/2616606.2617025openalex-snapshot
May-happen-in-parallel analysis based on segment graphs for safe ESL models
inferred← citeshttps://doi.org/10.5555/319568.319591openalex-snapshot
A collection of software tools for analyzing designs of concurrent software systems
inferred← citeshttps://doi.org/10.5555/800054.801959openalex-snapshot
Steps to an advanced ada programming environment
inferred← citeshttps://doi.org/10.70675/714cfccfz5715z4059zacfbzdf7c8d93a2d1openalex-snapshot
Minimising shared resource contention when scheduling real-time applications on multi-core architectures
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.