Image de couverture de livre

Scalable Computation of Inter-Core Bounds Through Exact Abstractions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Foughali, Mohammed Aristide, Mikučionis, Marius, Zhang, Maryline
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory Symbolic Computation
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Computing Sound Lower and Upper Bounds on Hamilton-Jacobi Reach-Avoid Value Functions
par: Tabbara, Ihab, et autres
Publié: (2025)

Specializing anti-unification for interaction models composition via gate connections
par: Nguetoum, Joel, et autres
Publié: (2025)

Scalable and Approximation-free Symbolic Control for Unknown Euler-Lagrange Systems
par: Das, Ratnangshu, et autres
Publié: (2025)

Algebraic power series and their automatic complexity modulo prime powers
par: Rowland, Eric, et autres
Publié: (2024)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
par: Yamakami, Tomoyuki
Publié: (2024)

CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams
par: Sistla, Meghana, et autres
Publié: (2022)

Tracer: A Tool for Race Detection in Software Defined Network Models
par: Caltais, Georgiana, et autres
Publié: (2024)

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

Weakly-unambiguous Parikh automata and their link to holonomic series
par: Bostan, Alin, et autres
Publié: (2025)

FORM: Learning Expressive and Transferable First-Order Logic Reward Machines
par: Ardon, Leo, et autres
Publié: (2024)

Graded Symbolic Verification with a Fuzzy Dolev-Yao Attacker Model
par: Moran, Murat
Publié: (2026)

Counting Abstraction for the Verification of Structured Parameterized Networks
par: Bozga, Marius, et autres
Publié: (2025)

Compositional Abstraction for Timed Systems with Broadcast Synchronization
par: Chen, Hanyue, et autres
Publié: (2025)

Real-Time Emergency Vehicle Detection using Mel Spectrograms and Regular Expressions
par: Pacheco-Gonzalez, Alberto, et autres
Publié: (2023)

Structural Abstraction and Refinement for Probabilistic Programs
par: Li, Guanyan, et autres
Publié: (2025)

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
par: Eichler, Paul, et autres
Publié: (2024)

Dynamic Symbolic Execution for Semantic Difference Analysis of Component and Connector Architectures
par: Grahl, Johanna, et autres
Publié: (2025)

GOL in GOL in HOL: Verified Circuits in Conway's Game of Life
par: Myreen, Magnus O., et autres
Publié: (2025)

Exact Separation of Words via Trace Geometry
par: Chen, Zeyu, et autres
Publié: (2026)

Exact Accepting-State Spectrum for Reversal of Permutation Automata
par: German, Samuel
Publié: (2026)

Regular Grammars for Sets of Graphs of Tree-Width 2
par: Bozga, Marius, et autres
Publié: (2024)

Iterating Non-Aggregative Structure Compositions
par: Bozga, Marius, et autres
Publié: (2025)

Exact descriptional complexity of determinization of input-driven pushdown automata
par: Martynova, Olga
Publié: (2024)

Scalable Tree-based Register Automata Learning
par: Dierl, Simon, et autres
Publié: (2024)

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
par: Bozga, Marius, et autres
Publié: (2026)

DTMC Model Checking by Path Abstraction Revisited (extended version)
par: Hartmanns, Arnd, et autres
Publié: (2025)

Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
par: Heck, Linus, et autres
Publié: (2025)

A Tree Sampler for Bounded Context-Free Languages
par: Considine, Breandan
Publié: (2024)

Languages of Boundedly-Ambiguous Vector Addition Systems with States
par: Czerwiński, Wojciech, et autres
Publié: (2025)

TuringQ: Benchmarking AI Comprehension in Theory of Computation
par: Zahraei, Pardis Sadat, et autres
Publié: (2024)

Inform: From Compartmental Models to Stochastic Bounded Counter Machines
par: Leys, Tim, et autres
Publié: (2024)

Bounded treewidth, multiple context-free grammars, and downward closures
par: Aiswarya, C., et autres
Publié: (2025)

A Complexity Bound for Determinisation of Min-Plus Weighted Automata
par: Almagor, Shaull, et autres
Publié: (2026)

Unconditional Time and Space Complexity Lower Bounds for Intersection Non-Emptiness
par: Wehar, Michael
Publié: (2025)

Computational Complexity of Alignments
par: Schwanen, Christopher T., et autres
Publié: (2026)

Computational Model for Parsing Expression Grammars
par: Rubtsov, Alexander, et autres
Publié: (2024)

Temporal Causal Models as a Model of Computation
par: Gladyshev, Maksim, et autres
Publié: (2026)

Computing measures of weak-MSO definable sets of trees
par: Niwiński, Damian, et autres
Publié: (2024)

Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
par: Principato, Flavio T., et autres
Publié: (2025)

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
par: Yamakami, Tomoyuki
Publié: (2024)