default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClovis Eberhart
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Sasinee Pruekprasert, Jérémy Dubut, Toru Takisaka, Clovis Eberhart, Ahmet Cetinkaya:
Moment propagation of polynomial systems through Carleman linearization for probabilistic safety analysis. Autom. 160: 111441 (2024)- [j4]Ichiro Hasuo
, Yuichiro Oyabu, Clovis Eberhart, Kohei Suenaga, Kenta Cho, Shin-ya Katsumata:
Control-data separation and logical condition propagation for efficient inference on probabilistic programs. J. Log. Algebraic Methods Program. 136: 100922 (2024) - [c16]Serge Lechenne, Clovis Eberhart, Ichiro Hasuo:
A Compositional Framework for Petri Nets. CMCS 2024: 174-193 - [c15]Ichiro Hasuo, Clovis Eberhart, James Haydon, Jérémy Dubut, Rose Bohrer, Tsutomu Kobayashi, Sasinee Pruekprasert, Xiao-Yi Zhang, Erik André Pallas, Akihisa Yamada, Kohei Suenaga, Fuyuki Ishikawa, Kenji Kamijo, Yoshiyuki Shinya, Takamasa Suetomi:
Goal-Aware RSS for Complex Scenarios via Program Logic. IV 2024: 3154 - 2023
- [j3]Ichiro Hasuo, Clovis Eberhart, James Haydon, Jérémy Dubut, Rose Bohrer, Tsutomu Kobayashi, Sasinee Pruekprasert, Xiao-Yi Zhang, Erik André Pallas, Akihisa Yamada, Kohei Suenaga, Fuyuki Ishikawa, Kenji Kamijo, Yoshiyuki Shinya, Takamasa Suetomi:
Goal-Aware RSS for Complex Scenarios via Program Logic. IEEE Trans. Intell. Veh. 8(4): 3040-3072 (2023) - [c14]Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo:
Compositional Probabilistic Model Checking with String Diagrams of MDPs. CAV (3) 2023: 40-61 - [c13]James Haydon, Martin Bondu, Clovis Eberhart, Jérémy Dubut, Ichiro Hasuo:
Formal Verification of Intersection Safety for Automated Driving. ITSC 2023: 107-114 - [c12]Clovis Eberhart, Jérémy Dubut, James Haydon, Ichiro Hasuo:
Formal Verification of Safety Architectures for Automated Driving. IV 2023: 1-8 - [i15]Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo:
Compositional Solution of Mean Payoff Games by String Diagrams. CoRR abs/2307.08034 (2023) - [i14]Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo:
Compositional Probabilistic Model Checking with String Diagrams of MDPs. CoRR abs/2307.08765 (2023) - [i13]James Haydon, Martin Bondu, Clovis Eberhart, Jérémy Dubut, Ichiro Hasuo:
Formal Verification of Intersection Safety for Automated Driving. CoRR abs/2308.06785 (2023) - [i12]Clovis Eberhart, Jérémy Dubut, James Haydon, Ichiro Hasuo:
Formal Verification of Safety Architectures for Automated Driving. CoRR abs/2308.10365 (2023) - 2022
- [j2]Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Samuel Humeau, Clovis Eberhart, Ichiro Hasuo:
Codensity Games for Bisimilarity. New Gener. Comput. 40(2): 403-465 (2022) - [c11]Clovis Eberhart, James Haydon, Jérémy Dubut, Ahmet Cetinkaya, Sasinee Pruekprasert:
Logic for Timed Agent Network Topologies. CDC 2022: 2870-2877 - [i11]Sasinee Pruekprasert, Jérémy Dubut, Toru Takisaka, Clovis Eberhart, Ahmet Cetinkaya:
Moment Propagation Through Carleman Linearization with Application to Probabilistic Safety Analysis. CoRR abs/2201.08648 (2022) - [i10]Ichiro Hasuo, Clovis Eberhart, James Haydon, Jérémy Dubut, Rose Bohrer, Tsutomu Kobayashi, Sasinee Pruekprasert, Xiao-Yi Zhang, Erik André Pallas, Akihisa Yamada, Kohei Suenaga, Fuyuki Ishikawa, Kenji Kamijo, Yoshiyuki Shinya, Takamasa Suetomi:
Goal-Aware RSS for Complex Scenarios via Program Logic. CoRR abs/2207.02387 (2022) - 2021
- [c10]Sasinee Pruekprasert, Clovis Eberhart, Jérémy Dubut:
Fast Synthesis for Symbolic Self-triggered Control under Right-recursive LTL Specifications. CDC 2021: 1321-1328 - [c9]Clovis Eberhart, Akihisa Yamada, Stefan Klikovits, Shin-ya Katsumata, Tsutomu Kobayashi, Ichiro Hasuo, Fuyuki Ishikawa:
Architecture-Guided Test Resource Allocation via Logic. TAP@STAF 2021: 22-38 - [c8]Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada, Ichiro Hasuo:
A Compositional Approach to Parity Games. MFPS 2021: 278-295 - [i9]Ichiro Hasuo, Yuichiro Oyabu, Clovis Eberhart, Kohei Suenaga, Kenta Cho, Shin-ya Katsumata:
Control-Data Separation and Logical Condition Propagation for Efficient Inference on Probabilistic Programs. CoRR abs/2101.01502 (2021) - [i8]Sasinee Pruekprasert, Clovis Eberhart, Jérémy Dubut:
Fast Synthesis for Symbolic Self-triggered Control under Right-recursive LTL Specifications. CoRR abs/2103.16122 (2021) - [i7]Clovis Eberhart, Akihisa Yamada, Stefan Klikovits, Shin-ya Katsumata, Tsutomu Kobayashi, Ichiro Hasuo, Fuyuki Ishikawa:
Architecture-Guided Test Resource Allocation Via Logic. CoRR abs/2107.10948 (2021) - 2020
- [c7]Sasinee Pruekprasert, Clovis Eberhart, Jérémy Dubut:
Symbolic Self-triggered Control of Continuous-time Non-deterministic Systems without Stability Assumptions for 2-LTL Specifications. ICARCV 2020: 548-554 - [i6]Sasinee Pruekprasert, Clovis Eberhart, Jérémy Dubut:
Symbolic Self-triggered Control of Continuous-time Non-deterministic Systems without Stability Assumptions for 2-LTL Specifications. CoRR abs/2010.11663 (2020)
2010 – 2019
- 2019
- [c6]Akihisa Yamada, Clovis Eberhart, Fuyuki Ishikawa, Nian-Ze Lee:
Scenario Sampling for Cyber Physical Systems using Combinatorial Testing. ICST Workshops 2019: 198-199 - [c5]Clovis Eberhart, Bartek Klin:
History-Dependent Nominal μ-Calculus. LICS 2019: 1-13 - [c4]Clovis Eberhart, Tom Hirschowitz, Alexis Laouar:
Template Games, Simple Games, and Day Convolution. FSCD 2019: 16:1-16:19 - [i5]Sasinee Pruekprasert, Toru Takisaka, Clovis Eberhart, Ahmet Cetinkaya, Jérémy Dubut:
Moment Propagation of Discrete-Time Stochastic Polynomial Systems using Truncated Carleman Linearization. CoRR abs/1911.12683 (2019) - 2018
- [b1]Clovis Eberhart:
Categories and String Diagrams for Game Semantics. (Catégories et diagrammes de cordes pour les jeux concurrents). Grenoble Alpes University, France, 2018 - [c3]Clovis Eberhart, Tom Hirschowitz:
What's in a game?: A theory of game models. LICS 2018: 374-383 - [i4]Clovis Eberhart, Tom Hirschowitz, Alexis Laouar:
Simple game semantics and Day convolution. CoRR abs/1810.06991 (2018) - 2017
- [j1]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
An intensionally fully-abstract sheaf model for π (expanded version). Log. Methods Comput. Sci. 13(4) (2017) - [c2]Clovis Eberhart, Tom Hirschowitz:
Justified Sequences in String Diagrams: a Comparison Between Two Approaches to Concurrent Game Semantics. CALCO 2017: 10:1-10:16 - [i3]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
An intensionally fully-abstract sheaf model for π (expanded version). CoRR abs/1710.06744 (2017) - [i2]Clovis Eberhart, Tom Hirschowitz:
What's in a game? A theory of game models. CoRR abs/1711.10860 (2017) - 2015
- [c1]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
An Intensionally Fully-abstract Sheaf Model for pi. CALCO 2015: 86-100 - 2013
- [i1]Clovis Eberhart, Tom Hirschowitz, Thomas Seiller:
Fully-abstract concurrent games for pi. CoRR abs/1310.4306 (2013)
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 2025-01-04 03:16 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:
