activity
20132026
most citedSilas: High Performance, Explainable and Verifiable Machine Learning

5 citations · 8 across the 11 of their papers we have counts for

collaborators
Showing cs.LOShow all

6 papers · 1 filter

cs.LO2021★ 1 cited

Extracting Optimal Explanations for Ensemble Trees via Logical Reasoning

Gelin Zhang, Zhe Hou, Yanhong Huang +4

Ensemble trees are a popular machine learning model which often yields high prediction performance when analysing structured data. Although individual small decision trees are deem…

cs.LO2019

A formalisation of the SPARC TSO memory model for multi-core machine code

Zhe Hou, David Sanan, Alwen Tiu +2

SPARC processors have many applications in mission-critical industries such as aviation and space engineering. Hence, it is important to provide formal frameworks that facilitate t…

cs.LO2017

Modular Labelled Sequent Calculi for Abstract Separation Logics

Zhé Hóu, Ranald Clouston, Rajeev Goré +1

Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs that manipulate resources such as memory locations. These logics are "abstract" be…

cs.LO2016★ 2 cited

Completeness for a First-order Abstract Separation Logic

Zhe Hou, Alwen Tiu

Existing work on theorem proving for the assertion language of separation logic (SL) either focuses on abstract semantics which are not readily available in most applications of pr…

cs.LO2013

Proof search for propositional abstract separation logics via labelled sequents

Zhe Hou, Ranald Clouston, Rajeev Gore +1

Separation logics are a family of extensions of Hoare logic for reasoning about programs that mutate memory. These logics are "abstract" because they are independent of any particu…

cs.LO2013

A Labelled Sequent Calculus for BBI: Proof Theory and Proof Search

Zhe Hou, Alwen Tiu, Rajeev Gore

We present a labelled sequent calculus for Boolean BI, a classical variant of O'Hearn and Pym's logic of Bunched Implication. The calculus is simple, sound, complete, and enjoys cu…