Similar Items: Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays
- Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
- High-level Counterexamples for Probabilistic Automata
- Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories
- Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
- Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation
- Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories