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 (CS)
Full contact details
Dr Harsh Beohar
School of Computer Science
Regent Court (CS)
School of Computer Science
Regent Court (CS)
211 Portobello
Sheffield
S1 4DP
- Publications
-
Journal articles
- Conditional transition systems with upgrades. Science of Computer Programming, 186. View this article in WRRO
- Basic behavioral models for software product lines: Revisited. Science of Computer Programming, 168, 171-185.
- A coalgebraic treatment of conditional transition systems with upgrades. Logical Methods in Computer Science, 14(1). View this article in WRRO
- Input–output conformance testing for software product lines. Journal of Logical and Algebraic Methods in Programming, 85(6), 1131-1153.
- Basic behavioral models for software product lines: Expressiveness and testing pre-orders. Science of Computer Programming, 123, 42-60.
- Avoiding diamonds in desynchronisation. Science of Computer Programming, 91, Part A, 45-69. View this article in WRRO
- Desynchronizability of (Partial) synchronous closed loop systems. Scientific Annals of Computer Science, 21, 5-38.
- On Kleisli liftings and decorated trace semantics. Electronic Notes in Theoretical Informatics and Computer Science, Volume 4 - Proceedings of....
Book chapters
- Relating Apartness and Branching Bisimulation Games, Lecture Notes in Computer Science (pp. 203-213). Springer Nature Switzerland
Conference proceedings
- Expressivity of Bisimulation Pseudometrics over Analytic State Spaces. Leibniz International Proceedings in Informatics Lipics, Vol. 342
- Quantitative Graded Semantics and Spectra of Behavioural Metrics. Leibniz International Proceedings in Informatics Lipics, Vol. 326
- Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras (pp 114-134)
- Proving behavioural apartness. Coalgebraic Methods in Computer Science, Vol. 14617 (pp 156-173). Luxembourg City, Luxembourg, 6 April 2024 - 6 April 2024. View this article in WRRO
- Expressive quantale-valued logics for coalgebras: an adjunction-based approach. 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Vol. 289 (pp 10:1-10:19). Clermont-Ferrand, France, 12 March 2024 - 12 March 2024. View this article in WRRO
- Forward and backward steps in a fibration. 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023), Vol. 270 (pp 6:1-6:18). Padova, Italy, 19 June 2023 - 19 June 2023. View this article in WRRO
- Hennessy-Milner theorems via Galois connections. Leibniz International Proceedings in Informatics, LIPIcs, Vol. 252 (pp 12:1-12:18). Warsaw, Poland, 13 February 2023 - 13 February 2023. View this article in WRRO
- Graded monads and behavioural equivalence games. LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. Haifa, Israel, 2 August 2022 - 2 August 2022. View this article in WRRO
- Predicate and relation liftings for coalgebras with side effects : an application in coalgebraic modal logic. Coalgebraic Methods in Computer Science : 16th IFIP WG 1.3 International Workshop, CMCS 2022, Colocated with ETAPS 2022, Munich, Germany, April 2-3, 2022, Proceedings(13225) (pp 1-22). Munich, Germany, 2 April 2022 - 2 April 2022. View this article in WRRO
- Bisimulation maps in presheaf categories. Electronic Notes in Theoretical Computer Science, Vol. 347 (pp 5-24). London, UK, 4 June 2019 - 4 June 2019. View this article in WRRO
- Conditional transition systems with upgrades. 2017 International Symposium on Theoretical Aspects of Software Engineering (TASE) (pp 1-8), 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 - 14 June 2017. View this article in WRRO
- Open Maps in Concrete Categories and Branching Bisimulation for Prefix Orders. Electronic Notes in Theoretical Computer Science, Vol. 319 (pp 51-66)
- Delta-Oriented FSM-Based Testing (pp 366-381)
- A Pre-congruence Format for XY-simulation (pp 215-229)
- Input-output conformance testing based on featured transition systems. Proceedings of the 29th Annual ACM Symposium on Applied Computing (pp 1272-1278)
- Avoiding Diamonds in Desynchronization (pp 36-54)
- The Hierarchical Compositional Interchange Format (pp 316-335)
- Constructing witnesses for lower bounds on behavioural distances. Leibniz International Proceedings in Informatics. Paris, France, 24 March 2026 - 24 March 2026.
- Spinal Test Suites for Software Product Lines. Electronic Proceedings in Theoretical Computer Science, Vol. 141 (pp 44-55)
- A theory of desynchronisable closed loop system. Electronic Proceedings in Theoretical Computer Science, Vol. 38 (pp 99-114)
- Hierarchical states in the Compositional Interchange Format. Electronic Proceedings in Theoretical Computer Science, Vol. 32 (pp 42-56)
Theses
Other
- Coalgebraic Games in Kleisli Categories.
- Two Logical Characterizations for Input-Output Conformance. Electronic Proceedings in Theoretical Computer Science, 160, 47-47.
Preprints
- A coalgebraic higher-order modal fixed-point logic, arXiv.
- Tree Automata Acceptance up to Measurable Defect, arXiv.
- Constructing Witnesses for Lower Bounds on Behavioural Distances, arXiv.
- Expressivity of bisimulation pseudometrics over analytic state spaces, arXiv.
- On Kleisli liftings and decorated trace semantics, arXiv.
- Relating Apartness and Branching Bisimulation Games, arXiv.
- 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
-
- Quantitative verification of software families based on coalgebraic modal logic and games, EPSRC, 05/2023 - 08/2025, as PI
- Synthesising characteristic formulae and apartness proofs for coalgebras, Royal Society, 03/2023 - 03/2026, £11,875, as PI