Name
Affiliation
Papers
XINYU FENG
Yale University, New Haven, CT
48
Collaborators
Citations 
PageRank 
71
443
30.52
Referers 
Referees 
References 
588
485
493
Search Limit
100588
Title
Citations
PageRank
Year
Verifying Optimizations of Concurrent Programs in the Promising Semantics00.342022
Hierarchical and non-monotonic key-policy attribute-based encryption and its application00.342022
Abstraction for conflict-free replicated data types00.342021
Large Universe CCA2 CP-ABE With Equality and Validity Test in the Standard Model10.352021
AutoGR: Automated Geo-Replication with Fast System Performance and Preserved Application Semantics.00.342021
AUTOGR: automated geo-replication with fast system performance and preserved application semantics00.342021
Progress of Concurrent Objects.00.342020
Formalizing SPARCv8 instruction set architecture in Coq00.342020
A Lightweight Dynamic Enforcement of Privacy Protection for Android.00.342019
Towards certified separate compilation for concurrent programs00.342019
POMP: Protocol Oblivious SDN Programming with Automatic Multi-Table Pipelining.00.342018
Modular Verification Of Sparcv8 Code00.342018
Progress of concurrent objects with partial methods00.342018
Mechanized verification of preemptive OS kernels (invited talk).00.342017
AndroidLeaker: A Hybrid Checker for Collusive Leak in Android Applications.00.342017
The Achievable Capacity Scaling Laws Of 3d Cognitive Radio Networks10.382016
An operational happens-before memory model20.392016
A program logic for concurrent objects under fair scheduling90.502016
A Practical Verification Framework For Preemptive Os Kernels70.722016
Disjunctive Information Flow for Communicating Processes.30.392015
Practical Tactics for Verifying C Programs in Coq20.412015
Compositional verification of termination-preserving refinement of concurrent programs130.642014
Rely-Guarantee-Based Simulation for Compositional Verification of Concurrent Program Transformations80.432014
A temporal programming model with atomic blocks based on projection temporal logic10.352014
Characterizing progress properties of concurrent objects via contextual refinements100.532013
An Operational Approach to Happens-Before Memory Model30.422013
Modular verification of linearizability with non-fixed linearization points180.702013
Modular Verification of Concurrent Thread Management.50.422012
A concurrent temporal programming model with atomic blocks20.372012
A rely-guarantee-based simulation for verifying concurrent program transformations291.052012
A structural approach to prophecy variables30.382012
Weak Updates and Separation Logic20.402011
Reasoning about optimistic concurrency using a program logic for history240.862010
Parameterized memory models and concurrent separation logic150.722010
Local rely-guarantee reasoning70.612009
Local rely-guarantee reasoning361.442009
Certifying low-level programs with hardware interrupts and preemptive threads522.262008
Combining Domain-Specific and Foundational Logics to Verify Complete Software Systems140.802008
On the relationship between concurrent separation logic and assume-guarantee reasoning582.532007
An open framework for foundational proof-carrying code171.092007
Modular verification of assembly code with stack-based control abstractions401.712006
Path Pruning in Mailbox-based Mobile Agent Communications70.472004
Path compression in forwarding-based reliable mobile agent communications20.412003
Adaptive and reliable message delivery for mobile objects00.342003
Design of adaptive and reliable mobile agent communication protocols100.832002
Mailbox-Based Scheme for Designing Mobile Agent Communication Protocols140.822002
Reliable message delivery for mobile agents: push or pull?120.852002
An Efficient Mailbox-Based Algorithm for Message Delivery in Mobile Agent Systems161.212001