default search action
Natsuki Urabe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Koko Muroya
, Takahiro Sanada
Preorder-Constrained Simulations for Program Refinement with Effects. CMCS 2024: 44-64 - 2022
- [j6]Ami Sakakibara
Finite-Memory Supervisory Control of Discrete Event Systems for LTL[$\mathcal {F}$] Specifications. IEEE Trans. Autom. Control. 67(12): 6896-6903 (2022) - [c10]Mayuko Kori
The Lattice-Theoretic Essence of Property Directed Reachability Analysis. CAV (1) 2022: 235-256 - [c9]Étienne André
Exemplifying Parametric Timed Specifications over Signals with Bounded Behavior. NFM 2022: 470-488 - [i10]Étienne André, Masaki Waga
Exemplifying parametric timed specifications over signals with bounded behavior. CoRR abs/2203.13247 (2022) - [i9]Mayuko Kori, Natsuki Urabe, Shin-ya Katsumata, Kohei Suenaga, Ichiro Hasuo:
The Lattice-Theoretic Essence of PropertyDirected Reachability Analysis. CoRR abs/2203.14261 (2022) - 2021
- [j5]Natsuki Urabe
Verifying Asymptotic Temporal Properties of Continuous-State Probabilistic Systems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 40(9): 1934-1946 (2021) - [j4]Toru Takisaka
Ranking and Repulsing Supermartingales for Reachability in Randomized Programs. ACM Trans. Program. Lang. Syst. 43(2): 5:1-5:46 (2021) - [c8]Koko Muroya, Takahiro Sanada, Natsuki Urabe:
Preorder-Constrained Simulation for Nondeterministic Automata (Early Ideas). CALCO 2021: 21:1-21:5
2010 – 2019
- 2019
- [c7]Satoshi Kura
Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments. TACAS (2) 2019: 135-153 - 2018
- [j3]Natsuki Urabe, Ichiro Hasuo
Coalgebraic Infinite Traces and Kleisli Simulations. Log. Methods Comput. Sci. 14(3) (2018) - [c6]Toru Takisaka
Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs. ATVA 2018: 476-493 - [c5]Natsuki Urabe, Ichiro Hasuo:
Categorical Büchi and Parity Conditions via Alternating Fixed Points of Functors. CMCS 2018: 214-234 - [i8]Natsuki Urabe, Ichiro Hasuo:
Categorical Buechi and Parity Conditions via Alternating Fixed Points of Functors. CoRR abs/1803.06811 (2018) - [i7]Toru Takisaka, Yuichiro Oyabu, Natsuki Urabe, Ichiro Hasuo:
Ranking and Repulsing Supermartingales for Approximating Reachability. CoRR abs/1805.10749 (2018) - [i6]Natsuki Urabe, Ichiro Hasuo:
Quantitative Matrix Simulation. CoRR abs/1810.09146 (2018) - [i5]Satoshi Kura
Tail Probabilities for Randomized Program Runtimes via Martingales for Higher Moments. CoRR abs/1811.06779 (2018) - 2017
- [j2]Natsuki Urabe, Ichiro Hasuo
Quantitative simulations by matrices. Inf. Comput. 252: 110-137 (2017) - [j1]Natsuki Urabe, Ichiro Hasuo
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective. Log. Methods Comput. Sci. 13(3) (2017) - [c4]Natsuki Urabe, Masaki Hara, Ichiro Hasuo
Categorical liveness checking by corecursive algebras. LICS 2017: 1-12 - [i4]Natsuki Urabe, Masaki Hara, Ichiro Hasuo:
Categorical Liveness Checking by Corecursive Algebras. CoRR abs/1704.04872 (2017) - 2016
- [c3]Natsuki Urabe, Shunsuke Shimizu, Ichiro Hasuo
Coalgebraic Trace Semantics for Buechi and Parity Automata. CONCUR 2016: 24:1-24:15 - [i3]Natsuki Urabe, Shunsuke Shimizu, Ichiro Hasuo:
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective. CoRR abs/1606.04680 (2016) - [i2]Natsuki Urabe, Shunsuke Shimizu, Ichiro Hasuo:
Coalgebraic Trace Semantics for Buechi and Parity Automata. CoRR abs/1606.09399 (2016) - 2015
- [c2]Natsuki Urabe, Ichiro Hasuo
Coalgebraic Infinite Traces and Kleisli Simulations. CALCO 2015: 320-335 - [i1]Natsuki Urabe, Ichiro Hasuo:
Coalgebraic Infinite Traces and Kleisli Simulations. CoRR abs/1505.06819 (2015) - 2014
- [c1]Natsuki Urabe, Ichiro Hasuo:
Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices. CONCUR 2014: 451-466
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-08-23 18:32 CEST 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: