New answers tagged software-verification
0
votes
Formally Verify if a Sequence of Regex-Based Modifications is Idempotent
This is likely to be a very hard problem, so hard that I don't think you should expect a useful solution that can handle all possible regexes.
The extended regular expressions supported by Python's <...

D.W.♦
- 156k
Top 50 recent answers are included
Related Tags
software-verification × 120formal-methods × 35
model-checking × 24
logic × 18
hoare-logic × 17
proof-techniques × 14
correctness-proof × 11
programming-languages × 8
algorithms × 6
automata × 6
functional-programming × 6
computation-tree-logic × 6
program-correctness × 6
semantics × 5
linear-temporal-logic × 5
loop-invariants × 5
reference-request × 4
satisfiability × 4
induction × 4
automated-theorem-proving × 4
software-testing × 4
graphs × 3
formal-languages × 3
computability × 3
finite-automata × 3