Dr Harsh Beohar
School of Computer Science
Lecturer in Verification
PGR Tutor
Member of the Foundations of Computation research group
h.beohar@sheffield.ac.uk
Regent Court (DCS)
Full contact details
Dr Harsh Beohar
School of Computer Science
Regent Court (DCS)
211 Portobello
Sheffield
S1 4DP
School of Computer Science
Regent Court (DCS)
211 Portobello
Sheffield
S1 4DP
- Publications
-
Journal articles
- Conditional transition systems with upgrades. Science of Computer Programming, 186. View this article in WRRO
- A coalgebraic treatment of conditional transition systems with upgrades. Logical Methods in Computer Science (LMCS), 14(1). View this article in WRRO
- Avoiding diamonds in desynchronisation. Science of Computer Programming, 91, 45-69. View this article in WRRO
- On Kleisli liftings and decorated trace semantics. Electronic Notes in Theoretical Informatics and Computer Science, Volume 4 - Proceedings of....
Chapters
- Relating Apartness and Branching Bisimulation Games, Lecture Notes in Computer Science (pp. 203-213). Springer Nature Switzerland
Conference proceedings papers
- Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras (pp 114-134)
- Proving Behavioural Apartness (pp 156-173)
- Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach. Leibniz International Proceedings in Informatics, LIPIcs, Vol. 289
- Forward and Backward Steps in a Fibration. Leibniz International Proceedings in Informatics, LIPIcs, Vol. 270
- Hennessy-Milner Theorems via Galois Connections. Leibniz International Proceedings in Informatics, LIPIcs, Vol. 252
- Graded Monads and Behavioural Equivalence Games. Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
- Predicate and Relation Liftings for Coalgebras with Side Effects: An Application in Coalgebraic Modal Logic (pp 1-22)
- Bisimulation maps in presheaf categories. Electronic Notes in Theoretical Computer Science, Vol. 347 (pp 5-24). London, UK, 4 June 2019 - 7 June 2019. View this article in WRRO
- Conditional transition systems with upgrades. 2017 International Symposium on Theoretical Aspects of Software Engineering (TASE), 13 September 2017 - 15 September 2017.
- On path-based coalgebras and weak notions of bisimulation. 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), Vol. 72 (pp 6:1-6:17). Ljubljana, Slovenia, 14 June 2017 - 16 June 2017. View this article in WRRO
Theses / Dissertations
Other
Preprints
- Expressive Quantale-valued Logics for Coalgebras: an Adjunction-based Approach, arXiv.
- Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras, arXiv.
- Quantitative Graded Semantics and Spectra of Behavioural Metrics, arXiv.
- Hennessy-Milner Theorems via Galois Connections, arXiv.
- Graded Monads and Behavioural Equivalence Games, arXiv.
- Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic, arXiv.
- Bisimulation maps in presheaf categories, arXiv.
- Conditional Transition Systems with Upgrades, arXiv.
- On path-based coalgebras and weak notions of bisimulation, arXiv.
- A coalgebraic treatment of conditional transition systems with upgrades, arXiv.
- Spinal Test Suites for Software Product Lines, arXiv.
- A theory of desynchronisable closed loop system, arXiv.
- Hierarchical states in the Compositional Interchange Format, arXiv.
- Design of asynchronous supervisors, arXiv.
- Conditional transition systems with upgrades. Science of Computer Programming, 186. View this article in WRRO
- Grants
-
Current Grants
-
Quantitative verification of software families based on coalgebraic modal logic and games, EPSRC, 04/2023 - 04/2025, £235,841, as PI
-
Synthesising characteristic formulae and apartness proofs for coalgebras, Royal Society, 03/2023 - 03/2025, £11,875, as PI
-