default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHsi-Ming Ho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c12]Hsi-Ming Ho, Khushraj Madnani:
More Than 0s and 1s: Metric Quantifiers and Counting over Timed Words. TIME 2023: 7:1-7:15- [c11]Hsi-Ming Ho, Khushraj Madnani:
When Do You Start Counting? Revisiting Counting and Pnueli Modalities in Timed Logics. DCM 2023: 73-89 - 2021
- [j3]Hsi-Ming Ho, Ruoyu Zhou, Timothy M. Jones:
Timed hyperproperties. Inf. Comput. 280: 104639 (2021) - [c10]Mahwish Arif, Ruoyu Zhou, Hsi-Ming Ho, Timothy M. Jones:
Cinnamon: A Domain-Specific Language for Binary Profiling and Monitoring. CGO 2021: 103-114
2010 – 2019
- 2019
- [j2]Nir Drucker
, Hsi-Ming Ho, Joël Ouaknine, Michal Penn, Ofer Strichman:
Cyclic-routing of Unmanned Aerial Vehicles. J. Comput. Syst. Sci. 103: 18-45 (2019) - [j1]Hsi-Ming Ho, Joël Ouaknine, James Worrell:
On the Expressiveness and Monitoring of Metric Temporal Logic. Log. Methods Comput. Sci. 15(2) (2019) - [c9]Hsi-Ming Ho:
Revisiting timed logics with automata modalities. HSCC 2019: 67-76 - [c8]Hsi-Ming Ho, Ruoyu Zhou, Timothy M. Jones:
On Verifying Timed Hyperproperties. TIME 2019: 20:1-20:18 - 2018
- [c7]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege:
Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. ICECCS 2018: 180-184 - [i5]Hsi-Ming Ho, Joël Ouaknine, James Worrell:
On the Expressiveness and Monitoring of Metric Temporal Logic. CoRR abs/1803.02653 (2018) - [i4]Hsi-Ming Ho, Ruoyu Zhou, Timothy M. Jones:
On Verifying Timed Hyperproperties. CoRR abs/1812.10005 (2018) - [i3]Hsi-Ming Ho:
Revisiting Timed Logics with Automata Modalities. CoRR abs/1812.10146 (2018) - 2017
- [c6]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege:
MightyL: A Compositional Translation from MITL to Timed Automata. CAV (1) 2017: 421-440 - [c5]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege:
Timed-Automata-Based Verification of MITL over Signals. TIME 2017: 7:1-7:19 - 2016
- [c4]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! FORMATS 2016: 105-120 - [i2]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! CoRR abs/1606.07124 (2016) - 2015
- [b1]Hsi-Ming Ho:
Topics in monitoring and planning for embedded real-time systems. University of Oxford, UK, 2015 - [c3]Hsi-Ming Ho, Joël Ouaknine:
The Cyclic-Routing UAV Problem is PSPACE-Complete. FoSSaCS 2015: 328-342 - 2014
- [c2]Hsi-Ming Ho:
On the Expressiveness of Metric Temporal Logic over Bounded Timed Words. RP 2014: 138-150 - [c1]Hsi-Ming Ho, Joël Ouaknine, James Worrell:
Online Monitoring of Metric Temporal Logic. RV 2014: 178-192 - [i1]Hsi-Ming Ho, Joël Ouaknine:
The CR-UAV Problem is PSPACE-Complete. CoRR abs/1411.2874 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
