SPADE: A Library for Programmatic Parsing and Verification of Discrete Data Structures
SPADE is a library written in C# that takes string instances of discrete math data structures and parses them into data structures that are easily accessible using C#’s built in data structures. It also checks that the string instances appropriately follow specified constraints, that the various sets and lists of a problem relate to each other in a specified way. These constraints are defined using a language written as a string that closely follows normal discrete math syntax. Using this language, SPADE provides a flexible framework for defining problem types out of basic discrete math operations, which allows efficient parsing and validation of string representations of that problem.
Authors
- Russell Phillips (ORCID: https://orcid.org/0009-0007-2986-7889)
- Paul Bodily (ORCID: https://orcid.org/0000-0002-5941-0069)
Institutions
- Idaho State University (US)
Publication Details
- Published
- 2025-05-09
- DOI
- https://doi.org/10.1109/ietc64455.2025.11039449
- Primary Topic
- Simulation Techniques and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00