A5101761507- Distributed systems and fault tolerance
- Security and Verification in Computing
- Logic, programming, and type systems
- Parallel Computing and Optimization Techniques
- Formal Methods in Verification
- Mobile Agent-Based Network Management
- Real-Time Systems Scheduling
- Privacy-Preserving Technologies in Data
- Cryptography and Data Security
- Complexity and Algorithms in Graphs
- Advanced Data Storage Technologies
- Mobile Ad Hoc Networks
- Advanced Algorithms and Applications
- Embedded Systems Design Techniques
- Advanced Software Engineering Methodologies
- Sentiment Analysis and Opinion Mining
- Advanced Text Analysis Techniques
- Cloud Data Security Solutions
- Cognitive Functions and Memory
- Advanced Malware Detection Techniques
- Opportunistic and Delay-Tolerant Networks
- Cryptography and Residue Arithmetic
- Advanced Sensor and Control Systems
- Viral Infections and Vectors
- Optimization and Search Problems
Software (Spain)
2024
Peking University
2016-2024
Zhejiang Gongshang University Hangzhou College of Commerce
2024
Beijing University of Posts and Telecommunications
2016-2024
Southwest University
2024
Rice Research Institute
2024
Tea Research Institute
2024
Zhejiang University
2024
Guilin University of Electronic Technology
2024
Zhejiang Gongshang University
2024
Rely-Guarantee reasoning is a well-known method for verification of shared-variable concurrent programs. However, it difficult users to define rely/guarantee conditions, which specify threads' behaviors over the whole program state. Recent efforts combine Separation Logic with have made possible hide thread-local resources, but shared resources still need be globally known and specified. This greatly limits reuse verified modules.
Locating linearization points (LPs) is an intuitive approach for proving linearizability, but it difficult to apply the idea in Hoare-style logic formal program verification, especially verifying algorithms whose LPs cannot be statically located code. In this paper, we propose a with lightweight instrumentation mechanism which can verify non-fixed LPs, including most challenging ones that use helping achieve lock-freedom (as HSY elimination-based stack), or have depending on unpredictable...
Abstract Multimodal Aspect-Based Sentiment Analysis (MABSA) is an essential task in sentiment analysis that has garnered considerable attention recent years. Typical approaches MABSA often utilize cross-modal Transformers to capture interactions between textual and visual modalities. However, bridging the semantic gap modalities spaces addressing interference from irrelevant objects at different scales remains challenging. To tackle these limitations, we present Multi-level Textual-Visual...
Hardware interrupts are widely used in the world's critical software systems to support preemptive threads, device drivers, operating system kernels, and hypervisors. Handling properly is an essential component of low-level programming. Unfortunately, also extremely hard reason about: they dramatically alter program control flow complicate invariants concurrent code (e.g., implementation synchronization primitives). Existing formal verification techniques---including Hoare logic, typed...
Existing work on verifying concurrent objects is mostly concerned with safety only, e.g., partial correctness or linearizability. Although there has been recent lock-freedom of non-blocking objects, much less efforts are focused deadlock-freedom and starvation-freedom, progress properties blocking objects. These more challenging to verify than because they allow the one thread depend another, assuming fair scheduling. We propose LiLi, a new rely-guarantee style program logic for...
In various situations, mobile agents at different hosts must cooperate with one another by sharing information and making decisions collectively. To ensure effective interagent communication, communication protocols track target agent locations deliver messages reliably. Researchers have proposed a wide range of schemes for tracking reliable message delivery. However, each scheme has its own assumptions, design goals, methodology. As result, no uniform or structured methods exist...
Verifying program transformations usually requires proving that the resulting (the target) refines or is equivalent to original one source). However, refinement relation between individual sequential threads cannot be preserved in general with presence of parallel compositions, due instruction reordering and different granularities atomic operations at source target. On other hand, defined based on fully abstract semantics concurrent programs assumes arbitrary environments, which too strong...
Although current large-scale generative language models (LMs) can show impressive insights about factual knowledge, they do not exhibit similar success with respect to human values judgements (e.g., whether or the generations of an LM are moral). Existing methods learn either by directly mimicking behavior data, rigidly constraining generation space human-chosen tokens. These inherently limited in that consider contextual and abstract nature as a result often fail when dealing out-of-domain...
Runtime stacks are critical components of any modern software--they used to implement powerful control structures such as function call/return, stack cutting and unwinding, coroutines, thread context switch. Stack operations, however, very hard reason about: there no known formal specifications for certifying C-style setjmp/longjmp, or weak continuations (in C--). In many proof-carrying code (PCC) systems, return pointers exception handlers treated general first-class functions (as in...
Today's software systems often use many different computation features and span abstraction levels (e.g., user code runtime-system code). To build foundational certified systems, it is hard to have a single verification system supporting all features. In this paper we present an open framework for proof-carrying (FPCC). It allows program modules be specified separately using type or logics. Certified (i.e., proof) can linked together fully systems. The supports modular proof reuse. also...
Verifying program transformations usually requires proving that the resulting (the target) refines or is equivalent to original one source). However, refinement relation between individual sequential threads cannot be preserved in general with presence of parallel compositions, due instruction reordering and different granularities atomic operations at source target. On other hand, defined based on fully abstract semantics concurrent programs assumes arbitrary environments, which too strong...
Runtime stacks are critical components of any modern software--they used to implement powerful control structures such as function call/return, stack cutting and unwinding, coroutines, thread context switch. Stack operations, however, very hard reason about: there no known formal specifications for certifying C-style setjmp/longjmp, or weak continuations (in C--). In many proof-carrying code (PCC) systems, return pointers exception handlers treated general first-class functions (as in...
Verifying program transformations usually requires proving that the resulting (the target) refines or is equivalent to original one source). However, refinement relation between individual sequential threads cannot be preserved in general with presence of parallel compositions, due instruction reordering and different granularities atomic operations at source target. On other hand, defined based on fully abstract semantics concurrent programs assumes arbitrary environments, which too strong...
Many verification problems can be reduced to refinement verification. However, existing work on verifying of concurrent programs either fails prove the preservation termination, allowing a diverging program trivially refine any programs, or is difficult apply in compositional thread-local reasoning. In this paper, we first propose new simulation technique, which establishes termination-preserving and congruence with respect parallel composition. We then give proof theory for simulation,...
SUMMARY Grain weight, grain number per panicle, and the of panicles are three factors that determine rice ( Oryza sativa L.) yield. Of these, which not only directly determines yield but also influences appearance quality, is often considered most important for production. Here, we describe OsNF‐YC1, a member NF‐Y transcription factor family regulates size. OsNF‐YC1 knockout plants osnf‐yc1 ), obtained using CRISPR‐Cas9 technology, showed reduced weight due to width thickness, with no change...