:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lee, Robin, Nam, Youngho
Format:	Preprint
Publié:	2025
Sujets:	Software Engineering 68Q60, 03B70 D.2.5
Accès en ligne:	https://arxiv.org/abs/2507.14687
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

EQ-Robin: Constraint-Resilient Generation of Multiple Minimal Unique-Cause MC/DC Test Suites
par: Lee, Robin, et autres
Publié: (2025)

Trace Validation of Unmodified Concurrent Systems with OmniLink
par: Hackett, Finn, et autres
Publié: (2026)

Day algebras
par: Robinson, Edmund, et autres
Publié: (2025)

Cone-Induced Observation Congruences for Vector-Valued Quantitative Languages
par: Alpay, Faruk, et autres
Publié: (2026)

The complexity of being monitorable
par: Camerlo, Riccardo, et autres
Publié: (2026)

Certified Finite-State Induction for a Perturbed Hofstadter Recursion
par: Mantovanelli, Marco
Publié: (2026)

A Minimal Substitution Basis for the Kalmár Elementary Functions
par: Prunescu, Mihai, et autres
Publié: (2025)

On Immutable Memory Systems for Artificial Agents: A Blockchain-Indexed Automata-Theoretic Framework Using ECDH-Keyed Merkle Chains
par: Wright, Craig Steven
Publié: (2025)

Regainingly approximable numbers and sets
par: Hertling, Peter, et autres
Publié: (2023)

A study of distributional complexity measures for Boolean functions
par: Köhler-Schindler, Laurin, et autres
Publié: (2024)

Optimal Simultaneous Byzantine Agreement, Common Knowledge and Limited Information Exchange
par: van der Meyden, Ron
Publié: (2025)

New Fault Domains for Conformance Testing of Finite State Machines
par: Vaandrager, Frits, et autres
Publié: (2024)

A Methodological Analysis of Empirical Studies in Quantum Software Testing
par: Li, Yuechen, et autres
Publié: (2026)

Refutability as Recursive as Provability
par: Cattabriga, Paola
Publié: (2024)

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
par: Kattermann, David, et autres
Publié: (2025)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
par: Lopez, Aliaume
Publié: (2024)

Why the classes P and NP are not well-defined finitarily
par: Anand, Bhupinder Singh
Publié: (2024)

NP-hard problems are not in BQP
par: Czerwinski, Reiner
Publié: (2023)

Time-inhomogeneous N-particle Branching Brownian Motion and the continuous random energy model
par: Legrand, Alexandre, et autres
Publié: (2024)

Jean-Raymond Abrial: A Scientific Biography of a Formal Methods Pioneer
par: Bowen, Jonathan P., et autres
Publié: (2026)

Language-Based Protocol Testing
par: Liggesmeyer, Alexander, et autres
Publié: (2025)

Nominal techniques as an Agda library
par: Gabbay, Murdoch J., et autres
Publié: (2026)

Directed Grammar-Based Test Generation
par: Kirschner, Lukas, et autres
Publié: (2025)

Systematic Evaluation of Black-Box Checking for Fast Bug Detection
par: Pellen, Bram, et autres
Publié: (2025)

Evaluating Developer-written Unit Test Case Reduction for Java -- A Replication Study
par: Le, Tuan D, et autres
Publié: (2025)

Contract-based Verification of Digital Twins
par: Naeem, Muhammad, et autres
Publié: (2025)

Black-box Context-free Grammar Inference for Readable & Natural Grammars
par: Arefin, Mohammad Rifat, et autres
Publié: (2025)

Array-Carrying Symbolic Execution for Function Contract Generation
par: Lu, Weijie, et autres
Publié: (2026)

Biprofile Deviation Logic: Report-Replacement Frames and Audit Witnesses
par: Alpay, Faruk, et autres
Publié: (2026)

Formal Verification of Imperative First-Class Functions in Move
par: Grieskamp, Wolfgang, et autres
Publié: (2026)

On systematic construction of correct logic programs
par: Drabent, Włodzimierz
Publié: (2025)

Multiple Query Satisfiability of Constrained Horn Clauses
par: De Angelis, Emanuele, et autres
Publié: (2022)

Continuum graph dynamics via population dynamics: well-posedness, duality and equilibria
par: Greven, Andreas, et autres
Publié: (2023)

Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
par: Lopez, Aliaume
Publié: (2024)

Evolomino is NP-complete
par: Nikolaev, Andrei V.
Publié: (2025)

Dilations and information flow axioms in categorical probability
par: Fritz, Tobias, et autres
Publié: (2022)

Preprocessing is All You Need: Boosting the Performance of Log Parsers With a General Preprocessing Framework
par: Qin, Qiaolin, et autres
Publié: (2024)

Normalization properties of $λμ$-calculus using realizability semantics
par: Battyanyi, Peter, et autres
Publié: (2023)

On Chaitin's Heuristic Principle and Halting Probability
par: Salehi, Saeed
Publié: (2023)

High-Performance Generation of Constrained Inputs
par: Crump, Addison, et autres
Publié: (2025)