Xinwei Fang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xinwei Fang has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Yuchen Hu
Southeast University, Nanjing, Jiangsu, China
5 shared publications - Zhe Jiang
Southeast University, Nanjing, Jiangsu, China
5 shared publications - Xi Wang
Southeast University, Nanjing, Jiangsu, China
4 shared publications - Jialin Sun
Southeast University, Nanjing, Jiangsu, China
3 shared publications - Ke Xu
Southeast University, Nanjing, Jiangsu, China
3 shared publications - Radu Calinescu
University of York
3 shared publications
Latest Publications
- Open Access
- 16 November 2026
- Published by Elsevier in Solar Energy
- Vol. 321
A probabilistic framework for performance and reliability assessment of photovoltaic systems
- 16 November 2026
- Published by Elsevier in Solar Energy
- Vol. 321
Open AccessA probabilistic framework for performance and reliability assessment of photovoltaic systems
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Prelude: Priming-Guided State Reconstruction for Efficient FPGA Processor Debugging
Debugging complex FPGA prototypes of modern processors in embedded systems is challenging due to limited signal visibility and significant tracing overhead. Existing approaches struggle to balance execution efficiency with debugging capability, often requiring either expensive continuous tracing or heavyweight snapshots. We propose Prelude, a lightweight snapshot-based debugging framework that records only essential architectural states and memory footprint of the processor on FPGA. During replay, a short visibility warm-up reconstructs internal micro-architectural states, enabling cycle-accurate analysis. Implemented on BOOM and Rocket, Prelude provides comparable visibility to prior work while significantly improving debugging efficiency: 32.88× / 2191.2× speedup over DESSERT / ENCORE on BOOM, and 18.09× / 896.4× on Rocket.
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessPrelude: Priming-Guided State Reconstruction for Efficient FPGA Processor Debugging
Debugging complex FPGA prototypes of modern processors in embedded systems is challenging due to limited signal visibility and significant tracing overhead. Existing approaches struggle to balance execution efficiency with debugging capability, often requiring either expensive continuous tracing or heavyweight snapshots. We propose Prelude, a lightweight snapshot-based debugging framework that records only essential architectural states and memory footprint of the processor on FPGA. During replay, a short visibility warm-up reconstructs internal micro-architectural states, enabling cycle-accurate analysis. Implemented on BOOM and Rocket, Prelude provides comparable visibility to prior work while significantly improving debugging efficiency: 32.88× / 2191.2× speedup over DESSERT / ENCORE on BOOM, and 18.09× / 896.4× on Rocket.
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Beyond Fuzzer Islands: CPU Fuzzing via Smart Coordination
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessBeyond Fuzzer Islands: CPU Fuzzing via Smart Coordination
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
UVMarvel: an Automated LLM-aided UVM Machine for Subsystem-level RTL Verification
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessUVMarvel: an Automated LLM-aided UVM Machine for Subsystem-level RTL Verification
- 3 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (4) , 1672-1687
CLEAR: Spatial-Temporal Traffic Data Representation Learning for Traffic Prediction
In the evolving field of urban development, precise traffic prediction is essential for optimizing traffic and mitigating congestion. While traditional graph learning-based models effectively exploit complex spatial-temporal correlations, their reliance on trivially generated graph structures or deeply intertwined adjacency learning without supervised loss significantly impedes their efficiency. This paper presents Contrastive Learning of spatial-tEmporal trAffic data Representations (CLEAR) framework, a comprehensive approach to spatial-temporal traffic data representation learning aimed at enhancing the accuracy of traffic predictions. Employing self-supervised contrastive learning, CLEAR strategically extracts discriminative embeddings from both traffic time-series and graph-structured data. The framework applies weak and strong data augmentations to facilitate subsequent exploitations of intrinsic spatial-temporal correlations that are critical for accurate prediction. Additionally, CLEAR incorporates advanced representation learning models that transmute these dynamics into compact, semantic-rich embeddings, thereby elevating downstream models’ prediction accuracy. By integrating with existing traffic predictors, CLEAR boosts predicting performance and accelerates the training process by effectively decoupling adjacency learning from correlation learning. Comprehensive experiments validate that CLEAR can robustly enhance the capabilities of existing graph learning-based traffic predictors and provide superior traffic predictions with a straightforward representation decoder. This investigation highlights the potential of contrastive representation learning in developing robust traffic data representations for traffic prediction.
- 3 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (4) , 1672-1687
CLEAR: Spatial-Temporal Traffic Data Representation Learning for Traffic Prediction
In the evolving field of urban development, precise traffic prediction is essential for optimizing traffic and mitigating congestion. While traditional graph learning-based models effectively exploit complex spatial-temporal correlations, their reliance on trivially generated graph structures or deeply intertwined adjacency learning without supervised loss significantly impedes their efficiency. This paper presents Contrastive Learning of spatial-tEmporal trAffic data Representations (CLEAR) framework, a comprehensive approach to spatial-temporal traffic data representation learning aimed at enhancing the accuracy of traffic predictions. Employing self-supervised contrastive learning, CLEAR strategically extracts discriminative embeddings from both traffic time-series and graph-structured data. The framework applies weak and strong data augmentations to facilitate subsequent exploitations of intrinsic spatial-temporal correlations that are critical for accurate prediction. Additionally, CLEAR incorporates advanced representation learning models that transmute these dynamics into compact, semantic-rich embeddings, thereby elevating downstream models’ prediction accuracy. By integrating with existing traffic predictors, CLEAR boosts predicting performance and accelerates the training process by effectively decoupling adjacency learning from correlation learning. Comprehensive experiments validate that CLEAR can robustly enhance the capabilities of existing graph learning-based traffic predictors and provide superior traffic predictions with a straightforward representation decoder. This investigation highlights the potential of contrastive representation learning in developing robust traffic data representations for traffic prediction.
- Open Access
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-9
MEIC: Re-thinking RTL Debug Automation using LLMs
- 27 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessMEIC: Re-thinking RTL Debug Automation using LLMs
- Open Access
- 5 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 236-238
Make Each Iteration Count
Large Language Models (LLMs) is widely used for code debugging (e.g., C and Python) but face limitations in debugging Register Transfer Level (RTL) code largely due to data scarcity. This paper presents Make Each Iteration Count (MEIC), a novel framework for RTL debugging. Unlike traditional approaches heavily relying on prompt engineering, model tuning, and model training, MEIC employs an iterative process with LLM to address syntax and function errors efficiently. We also introduce an open-source dataset with 178 RTL errors for evaluation. Results demonstrate a 93% fix rate for syntax errors and a 78% fix rate for function errors.
- 5 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 236-238
Open AccessMake Each Iteration Count
Large Language Models (LLMs) is widely used for code debugging (e.g., C and Python) but face limitations in debugging Register Transfer Level (RTL) code largely due to data scarcity. This paper presents Make Each Iteration Count (MEIC), a novel framework for RTL debugging. Unlike traditional approaches heavily relying on prompt engineering, model tuning, and model training, MEIC employs an iterative process with LLM to address syntax and function errors efficiently. We also introduce an open-source dataset with 178 RTL errors for evaluation. Results demonstrate a 93% fix rate for syntax errors and a 78% fix rate for function errors.
- Open Access
- 14 February 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Autonomous and Adaptive Systems
- Vol. 19 (1) , 1-25
Predicting Nonfunctional Requirement Violations in Autonomous Systems
Autonomous systems are often used in applications where environmental and internal changes may lead to requirement violations. Adapting to these changes proactively, i.e., before the violations occur, is preferable to recovering from the failures that may be caused by such violations. However, proactive adaptation needs methods for predicting requirement violations timely, accurately, and with acceptable overheads. To address this need, we present a method that allows autonomous systems to predict violations of performance, dependability and other nonfunctional requirements, and therefore take preventative measures to avoid or otherwise mitigate them. Our method for pre dicting these autonomou s sys t em disrupti o ns (PRESTO) comprises a design time stage and a run-time stage. At design-time, we use parametric model checking to obtain algebraic expressions that formalise the relationships between the nonfunctional properties of the requirements of interest (e.g., reliability, response time, and energy use) and the parameters of the system and its environment. At run-time, we predict future changes in these parameters by applying piece-wise linear regression to online data obtained through monitoring, and we use the algebraic expressions to predict the impact of these changes on the system requirements. We demonstrate the application of PRESTO through simulation in case studies from two different domains.
- 14 February 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Autonomous and Adaptive Systems
- Vol. 19 (1) , 1-25
Open AccessPredicting Nonfunctional Requirement Violations in Autonomous Systems
Autonomous systems are often used in applications where environmental and internal changes may lead to requirement violations. Adapting to these changes proactively, i.e., before the violations occur, is preferable to recovering from the failures that may be caused by such violations. However, proactive adaptation needs methods for predicting requirement violations timely, accurately, and with acceptable overheads. To address this need, we present a method that allows autonomous systems to predict violations of performance, dependability and other nonfunctional requirements, and therefore take preventative measures to avoid or otherwise mitigate them. Our method for pre dicting these autonomou s sys t em disrupti o ns (PRESTO) comprises a design time stage and a run-time stage. At design-time, we use parametric model checking to obtain algebraic expressions that formalise the relationships between the nonfunctional properties of the requirements of interest (e.g., reliability, response time, and energy use) and the parameters of the system and its environment. At run-time, we predict future changes in these parameters by applying piece-wise linear regression to online data obtained through monitoring, and we use the algebraic expressions to predict the impact of these changes on the system requirements. We demonstrate the application of PRESTO through simulation in case studies from two different domains.
- 14 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 49 (10) , 4707-4730
Fast Parametric Model Checking With Applications to Software Performability Analysis
We present an efficient parametric model checking technique for the analysis of software performability , i.e., of the performance and dependability properties of software systems. The new parametric model checking (pMC) technique works by using a heuristic to automatically decompose a parametric discrete-time Markov chain (pDTMC) model of the software system under verification into fragments that can be analysed independently, yielding results that are then combined to establish the required software performability properties. Our fast parametric model checking (fPMC) technique enables the formal analysis of software systems modelled by pDTMCs that are too complex to be handled by existing pMC methods. Furthermore, for many pDTMCs that state-of-the-art parametric model checkers can analyse, fPMC produces solutions (i.e., algebraic formulae) that are simpler and much faster to evaluate. We show experimentally that adding fPMC to the existing repertoire of pMC methods improves the efficiency of parametric model checking significantly, and extends its applicability to software systems with more complex behaviour than currently possible.
- 14 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 49 (10) , 4707-4730
Fast Parametric Model Checking With Applications to Software Performability Analysis
We present an efficient parametric model checking technique for the analysis of software performability , i.e., of the performance and dependability properties of software systems. The new parametric model checking (pMC) technique works by using a heuristic to automatically decompose a parametric discrete-time Markov chain (pDTMC) model of the software system under verification into fragments that can be analysed independently, yielding results that are then combined to establish the required software performability properties. Our fast parametric model checking (fPMC) technique enables the formal analysis of software systems modelled by pDTMCs that are too complex to be handled by existing pMC methods. Furthermore, for many pDTMCs that state-of-the-art parametric model checkers can analyse, fPMC produces solutions (i.e., algebraic formulae) that are simpler and much faster to evaluate. We show experimentally that adding fPMC to the existing repertoire of pMC methods improves the efficiency of parametric model checking significantly, and extends its applicability to software systems with more complex behaviour than currently possible.
- Open Access
PRESTO: Predicting System-level Disruptions through Parametric Model Checking
Self-adaptive systems are expected to mitigate disruptions by continually adjusting their configuration and behaviour. This mitigation is often reactive. Typically, environmental or internal changes trigger a system response only after a violation of the system requirements. Despite a broad agreement that prevention is better than cure in self-adaptation, proactive adaptation methods are underrepresented within the repertoire of solutions available to the developers of self-adaptive systems. To address this gap, we present a work-in-progress approach for the pre diction of system-level disruptions (PRESTO) through parametric model checking. Intended for use in the analysis step of the MAPE-K (Monitor-Analyse-Plan-Execute over a shared Knowledge) feedback control loop of self-adaptive systems, PRESTO comprises two stages. First, time-series analysis is applied to monitoring data in order to identify trends in the values of individual system and/or environment parameters. Next, future non-functional requirement violations are predicted by using parametric model checking, in order to establish the potential impact of these trends on the reliability and performance of the system. We illustrate the application of PRESTO in a case study from the autonomous farming domain.
Open AccessPRESTO: Predicting System-level Disruptions through Parametric Model Checking
Self-adaptive systems are expected to mitigate disruptions by continually adjusting their configuration and behaviour. This mitigation is often reactive. Typically, environmental or internal changes trigger a system response only after a violation of the system requirements. Despite a broad agreement that prevention is better than cure in self-adaptation, proactive adaptation methods are underrepresented within the repertoire of solutions available to the developers of self-adaptive systems. To address this gap, we present a work-in-progress approach for the pre diction of system-level disruptions (PRESTO) through parametric model checking. Intended for use in the analysis step of the MAPE-K (Monitor-Analyse-Plan-Execute over a shared Knowledge) feedback control loop of self-adaptive systems, PRESTO comprises two stages. First, time-series analysis is applied to monitoring data in order to identify trends in the values of individual system and/or environment parameters. Next, future non-functional requirement violations are predicted by using parametric model checking, in order to establish the potential impact of these trends on the reliability and performance of the system. We illustrate the application of PRESTO in a case study from the autonomous farming domain.