Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
Fuente:
arXiv
Saved in:
| Main Authors: | Chen, Boqi, Marussy, Kristóf, Semeráth, Oszkár, Mussbacher, Gunter, Varró, Dániel |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Proceedings 16th International Workshop on Graph Computation Models
by: Lambers, Leen, et al.
Published: (2026)
by: Lambers, Leen, et al.
Published: (2026)
Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)
by: Kan, Shuanglong, et al.
Published: (2025)
Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars
by: Iosif, Radu, et al.
Published: (2025)
by: Iosif, Radu, et al.
Published: (2025)
Chance and Mass Interpretations of Probabilities in Markov Decision Processes (Extended Version)
by: Tsai, Yun Chen, et al.
Published: (2025)
by: Tsai, Yun Chen, et al.
Published: (2025)
Interpreted Higher-Dimensional Automata for Concurrent Discrete-Event Control
by: Bellier, Dylan, et al.
Published: (2026)
by: Bellier, Dylan, et al.
Published: (2026)
Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
by: Drewes, Frank, et al.
Published: (2025)
by: Drewes, Frank, et al.
Published: (2025)
Automata on Graph Alphabets
by: Bazille, Hugo, et al.
Published: (2026)
by: Bazille, Hugo, et al.
Published: (2026)
Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)
by: Drewes, Frank, et al.
Published: (2024)
Regular Grammars for Sets of Graphs of Tree-Width 2
by: Bozga, Marius, et al.
Published: (2024)
by: Bozga, Marius, et al.
Published: (2024)
Fine-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs
by: Drabik, Karolina, et al.
Published: (2025)
by: Drabik, Karolina, et al.
Published: (2025)
Efficient Construction of Reachability Graphs for Petri Net Product Lines
by: Gómez-Martínez, Elena, et al.
Published: (2026)
by: Gómez-Martínez, Elena, et al.
Published: (2026)
A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks
by: Dhayalkar, Sahil Rajesh
Published: (2025)
by: Dhayalkar, Sahil Rajesh
Published: (2025)
Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems
by: Shoudai, Takayoshi, et al.
Published: (2026)
by: Shoudai, Takayoshi, et al.
Published: (2026)
Networks of Moore Machines
by: Yodaiken, Victor
Published: (2015)
by: Yodaiken, Victor
Published: (2015)
Alloy-Driven Verification of Object-Centric Event Data: From Temporal Logic to Knowledge Graphs
by: Latif, Saba, et al.
Published: (2025)
by: Latif, Saba, et al.
Published: (2025)
GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
by: De Rosa, Mattia, et al.
Published: (2025)
by: De Rosa, Mattia, et al.
Published: (2025)
Counting Abstraction for the Verification of Structured Parameterized Networks
by: Bozga, Marius, et al.
Published: (2025)
by: Bozga, Marius, et al.
Published: (2025)
Robust MITL planning under uncertain navigation times
by: Linard, Alexis, et al.
Published: (2024)
by: Linard, Alexis, et al.
Published: (2024)
A Characterization of Turing Machines that Compute Primitive Recursive Functions
by: Schwartz, Daniel G.
Published: (2025)
by: Schwartz, Daniel G.
Published: (2025)
Passive Learning of Lattice Automata from Recurrent Neural Networks
by: Slimi, Jaouhar, et al.
Published: (2025)
by: Slimi, Jaouhar, et al.
Published: (2025)
Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
by: Nepeivoda, Antonina, et al.
Published: (2025)
by: Nepeivoda, Antonina, et al.
Published: (2025)
Foundation Models for Logistics: Toward Certifiable, Conversational Planning Interfaces
by: Yang, Yunhao, et al.
Published: (2025)
by: Yang, Yunhao, et al.
Published: (2025)
Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)
by: Mazowiecki, Filip, et al.
Published: (2025)
Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
by: Hausmann, Daniel, et al.
Published: (2024)
by: Hausmann, Daniel, et al.
Published: (2024)
Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
by: Stan, Daniel, et al.
Published: (2026)
by: Stan, Daniel, et al.
Published: (2026)
The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)
by: Chen, Zeyu, et al.
Published: (2026)
Two-way affine automata can verify every language
by: Chen, Zeyu, et al.
Published: (2025)
by: Chen, Zeyu, et al.
Published: (2025)
Exact Separation of Words via Trace Geometry
by: Chen, Zeyu, et al.
Published: (2026)
by: Chen, Zeyu, et al.
Published: (2026)
RESTL: Reinforcement Learning Guided by Multi-Aspect Rewards for Signal Temporal Logic Transformation
by: Fang, Yue, et al.
Published: (2025)
by: Fang, Yue, et al.
Published: (2025)
Extracting Robust Register Automata from Neural Networks over Data Sequences
by: Hong, Chih-Duo, et al.
Published: (2025)
by: Hong, Chih-Duo, et al.
Published: (2025)
Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
by: Raskin, Jean-François, et al.
Published: (2024)
by: Raskin, Jean-François, et al.
Published: (2024)
Compositional Abstraction for Timed Systems with Broadcast Synchronization
by: Chen, Hanyue, et al.
Published: (2025)
by: Chen, Hanyue, et al.
Published: (2025)
Extending AALpy with Passive Learning: A Generalized State-Merging Approach
by: von Berg, Benjamin, et al.
Published: (2025)
by: von Berg, Benjamin, et al.
Published: (2025)
Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
by: Kuriyama, Takayuki
Published: (2026)
by: Kuriyama, Takayuki
Published: (2026)
Deconstructing Subset Construction -- Reducing While Determinizing
by: Nicol, John, et al.
Published: (2025)
by: Nicol, John, et al.
Published: (2025)
Learning Reward Machines from Partially Observed Policies
by: Shehab, Mohamad Louai, et al.
Published: (2025)
by: Shehab, Mohamad Louai, et al.
Published: (2025)
Transformers as Transducers
by: Strobl, Lena, et al.
Published: (2024)
by: Strobl, Lena, et al.
Published: (2024)
Stochastic Alignments: Matching an Observed Trace to Stochastic Process Models
by: Li, Tian, et al.
Published: (2025)
by: Li, Tian, et al.
Published: (2025)
Active Learning of Symbolic Automata Over Rational Numbers
by: Hagedorn, Sebastian, et al.
Published: (2025)
by: Hagedorn, Sebastian, et al.
Published: (2025)
Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
by: Dumitru, Radu Cosmin, et al.
Published: (2026)
by: Dumitru, Radu Cosmin, et al.
Published: (2026)
Similar Items
-
Proceedings 16th International Workshop on Graph Computation Models
by: Lambers, Leen, et al.
Published: (2026) -
Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025) -
Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars
by: Iosif, Radu, et al.
Published: (2025) -
Chance and Mass Interpretations of Probabilities in Markov Decision Processes (Extended Version)
by: Tsai, Yun Chen, et al.
Published: (2025) -
Interpreted Higher-Dimensional Automata for Concurrent Discrete-Event Control
by: Bellier, Dylan, et al.
Published: (2026)