Name
Affiliation
Papers
ZHONG SHAO
Yale University, New Haven, CT
77
Collaborators
Citations 
PageRank 
99
897
68.80
Referers 
Referees 
References 
1138
1132
1144
Search Limit
1001000
Title
Citations
PageRank
Year
Layered and Object-Based Game Semantics00.342022
Adore: Atomic Distributed Objects with Certified Reconfiguration00.342022
TimeDice: Schedulability-Preserving Priority Inversion for Mitigating Covert Timing Channels Between Real-time Partitions00.342022
CompCertO: compiling certified open C components00.342021
Blinder: Partition-Oblivious Hierarchical Scheduling00.342021
Paired Training Framework for Time-Constrained Learning.00.342021
Much ADO about failures: a fault-aware model for compositional verification of strongly consistent distributed systems00.342021
Adaptive Generative Modeling in Resource-Constrained Environments00.342021
Refinement-Based Game Semantics for Certified Abstraction Layers00.342020
Task-Aware Novelty Detection for Visual-based Deep Learning in Autonomous Systems.00.342020
Novelty Detection via Network Saliency in Visual-Based Deep Learning00.342019
Integrating Formal Schedulability Analysis Into A Verified Os Kernel10.362019
An abstract stack based approach to verified compositional compilation to machine code.00.342019
Building certified concurrent OS kernels10.362019
A new hierarchical software architecture towards safety-critical aspects of a drone system10.362019
Toward compositional verification of interruptible OS kernels and device drivers.50.442018
End-to-end verification of information-flow security for C and assembly programs.80.462016
Compositional certified resource bounds290.792015
Automatic Static Cost Analysis for Parallel Programs140.612015
Clean-Slate Development of Certified OS Kernels10.362015
A Compositional Semantics for Verified Separate Compilation and Linking40.442015
Deep Specifications and Certified Abstraction Layers120.572015
Compositional verification of termination-preserving refinement of concurrent programs130.642014
Type-Based Amortized Resource Analysis with Integers and Arrays.80.462014
End-to-end verification of stack-space bounds for C programs50.452014
A Separation Logic for Enforcing Declarative Information Flow Control Policies.30.392014
Trace-Based Temporal Verification for Message-Passing Programs00.342014
Characterizing progress properties of concurrent objects via contextual refinements100.532013
Quantitative Reasoning for Proving Lock-Freedom130.582013
Proving the correctness of concurrent robot software10.442012
Compositional verification of a baby virtual memory manager70.502012
A Case for Behavior-Preserving Actions in Separation Logic.20.392012
Modular Verification of Concurrent Thread Management.50.422012
Static and user-extensible proof checking70.532012
A structural approach to prophecy variables30.382012
A Simple Model for Certifying Assembly Programs with First-Class Function Pointers20.382011
Weak Updates and Separation Logic20.402011
Certified Programs and Proofs - First International Conference, CPP 2011, Kenting, Taiwan, December 7-9, 2011. Proceedings281.782011
CertiKOS: a certified kernel for secure cloud computing210.822011
VeriML: typed computation of logical terms inside a language with effects110.632010
Reasoning about optimistic concurrency using a program logic for history240.862010
Certified software60.462010
Parameterized memory models and concurrent separation logic150.722010
Modular Development of Certified System Software00.342009
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 200960.722009
Certifying low-level programs with hardware interrupts and preemptive threads522.262008
Combining Domain-Specific and Foundational Logics to Verify Complete Software Systems140.802008
Using XCAP to certify realistic systems code: machine context management323.522007
A general framework for certifying garbage collectors and their mutators381.642007
On the relationship between concurrent separation logic and assume-guarantee reasoning582.532007
  • 1
  • 2