arXiv (All)
open access
Testing and Learning Symbolic Finite State Machines
Symbolic finite state machines (SFSMs) describe input/output behaviour using guards and output assignments with possibly infinite data domains. We study deterministic and completely specified SFSMs whose guards and output assignments depend only on the current input. We define finite representative
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Testing and Learning Symbolic Finite State Machines#1043157
- CmdNeedle: Measuring the Incompleteness of Command Denylists for AI Agents#280136
- Fully tolerant product state testing and closest product state learning#1157327
- Generator-Independent Runtime Assurance under Partial Observation#973646
- AKRASIA: Stealthy Backdoor Attack on Reasoning-based Code LLMs#926229
Record · ID 1061240
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive