default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Philippe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j3]Tzanis Anevlavis
, Matthew Philippe, Daniel Neider, Paulo Tabuada:
Being Correct Is Not Enough: Efficient Verification Using Robust Linear Temporal Logic. ACM Trans. Comput. Log. 23(2): 8:1-8:39 (2022)- 2021
- [i2]Tzanis Anevlavis, Matthew Philippe, Daniel Neider, Paulo Tabuada:
Being correct is not enough: efficient verification using robust linear temporal logic. CoRR abs/2102.11991 (2021)
2010 – 2019
- 2019
- [j2]Matthew Philippe, Nikolaos Athanasopoulos, David Angeli, Raphaël M. Jungers:
On Path-Complete Lyapunov Functions: Geometry and Comparison. IEEE Trans. Autom. Control. 64(5): 1947-1957 (2019) - [c9]Matthew Philippe, Raphaël M. Jungers:
A complete characterization of the ordering of path-complete methods. HSCC 2019: 138-146 - [c8]Tzanis Anevlavis, Daniel Neider, Matthew Philippe, Paulo Tabuada:
Evrostos: the rLTL verifier. HSCC 2019: 218-223 - 2018
- [c7]Tzanis Anevlavis, Matthew Philippe, Daniel Neider, Paulo Tabuada:
Verifying rLTL formulas: now faster than ever before! CDC 2018: 1556-1561 - 2017
- [c6]David Angeli, Nikolaos Athanasopoulos, Raphaël M. Jungers, Matthew Philippe:
A linear program to compare path-complete Lyapunov functions. CDC 2017: 5888-5893 - [c5]David Angeli, Nikolaos Athanasopoulos, Raphaël M. Jungers, Matthew Philippe:
Path-Complete Graphs and Common Lyapunov Functions. HSCC 2017: 81-90 - 2016
- [j1]Matthew Philippe, Ray Essick, Geir E. Dullerud, Raphaël M. Jungers:
Stability of discrete-time switching systems with constrained switching sequences. Autom. 72: 242-250 (2016) - [c4]Matthew Philippe, Ray Essick, Geir E. Dullerud, Raphaël M. Jungers:
Extremal storage functions and minimal realizations of discrete-time linear switching systems. CDC 2016: 5533-5538 - 2015
- [c3]Ray Essick, Matthew Philippe, Geir E. Dullerud, Raphaël M. Jungers:
The minimum achievable stability radius of switched linear systems with feedback. CDC 2015: 4240-4245 - [c2]Matthew Philippe, Raphaël M. Jungers:
Converse Lyapunov theorems for discrete-time linear switching systems with regular switching sequences. ECC 2015: 1902-1907 - [c1]Matthew Philippe, Raphaël M. Jungers:
A sufficient condition for the boundedness of matrix products accepted by an automaton. HSCC 2015: 51-57 - [i1]Matthew Philippe, Gilles Millerioux, Raphaël M. Jungers:
Deciding the boundedness and dead-beat stability of constrained switching systems. CoRR abs/1512.04887 (2015)
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-09 13:01 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:
