Verifying Correctness of Shared Channels in a Cooperatively Scheduled Process-Oriented Language

📅 2025-10-11
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
This paper addresses the verification of concurrency correctness for shared communication channels in process-oriented languages with cooperative scheduling (e.g., ProcessJ). It proposes explicitly modeling the runtime environment—particularly resource supply capacity—within formal verification frameworks. Methodologically, it employs CSP to abstractly specify and concretely implement shared channels, and conducts refinement verification using the FDR tool. The key contribution is the identification and formal demonstration that channel behavioral correctness depends not only on program logic but critically on the sufficiency of runtime resources; thus, conventional verification models that omit environmental constraints are fundamentally inadequate. Experimental evaluation confirms that this environment-aware modeling strategy effectively bridges the gap between formal specifications and actual execution behavior, establishing a new paradigm for concurrent system verification that reconciles theoretical rigor with engineering realism.

Technology Category

Constraint Satisfaction and Optimization: Distributed CSP/OptimizationPlanning, Routing, and Scheduling: Scheduling under UncertaintyMultiagent Systems: Agent Communication

Application Category

Systems and Infrastructure for Web, Mobile and WoT: Virtualization and resource management in Web systems and infrastructuresSecurity and Privacy: Large-scale security measurementsUser Modeling, Personalization and Recommendation: User modeling and simulation for interactive and conversational systems
📝 Abstract
Correct concurrent behaviour is important in understanding how components will act within certain conditions. In this work. we analyse the behaviour of shared communicating channels within a coorporatively scheduled runtime. We use the refinement checking and modelling tool FDR to develop both specifications of how such shared channels should behave and models of the implementations of these channels in the cooperatively scheduled language ProcessJ. Our results demonstrate that although we can certainly implement the correct behaviour of such channels, the outcome is dependant on having adequate resources available to execute all processes involved. We conclude that modelling the runtime environment of concurrent components is necessary to ensure components behave as specified in the real world.
Problem

Research questions and friction points this paper is trying to address.

Verifying correctness of shared channels in cooperative scheduling
Modeling concurrent behavior using refinement checking tools
Ensuring runtime resource adequacy for correct process execution
Innovation

Methods, ideas, or system contributions that make the work stand out.

Used FDR tool for refinement checking
Modeled shared channel behavior specifications
Verified correctness in cooperative scheduling runtime
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
J
Jan Pedersen
Department of Computer Science, University of Nevada Las Vegas, 4505 South Maryland Parkway, 89154, Las Vegas, NV, USA
Kevin Chalmers
Kevin Chalmers
Ravensbourne University London
ConcurrencySoftware EngineeringModel CheckingComputer Science