Cited by 652Formal Methods in VerificationLogic, programming, and type systemsEmbedded Systems Design Techniques

Verification and Control of Hybrid Systems

Tabuada, Paulo·2009·Springer eBooks

Integrity signals

Registry

Crossref · 10.1007/978-1-4419-0224-5

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Authoring safety specifications is routine in automated controller design, and can frequently be achieved for both traditional software systems and domain-specific AI.

    “Authoring safety specifications is routine in automated controller design (Tabuada, 2009), and can frequently be achieved for both traditional software systems and domainspecific AI.”
  • The formal verification of AI-enabled systems literature builds on more classic work on formal verification of control policies and classical expert systems, to develop methods for formal verification of neural networks and other machine learning systems.

    “This builds on more classic work on formal verification of control policies (e.g., (Tabuada, 2009)) and classical expert systems (O'Keefe & O'Leary, 1993), to develop methods for formal verification of neural networks and other machine learning systems.”

Cited by

Sorted by citations

Authors
Tabuada, P.
Affiliations
University of California, Los Angeles (US)
Corresponding author
Tabuada, Paulo
Venue
Springer eBooks
Publisher
Springer US
Published
2009
OpenAlex
W2487779201
Cited by
652
References
0
Citations by year
2026: 17 · 2025: 33 · 2024: 67 · 2023: 44 · 2022: 40 · 2021: 42 · 2020: 45 · 2019: 63 · 2018: 50 · 2017: 45 · 2016: 43 · 2015: 40 · 2014: 39 · 2013: 33 · 2012: 19
FWCI
4.27
Type
book
Language
en
Open access
closed
Locations
Springer eBooks (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Formal Methods in Verification
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
Keywords
hybrid systems, verification, control, finite automata, differential equations

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review