A pipeline that mines process trees from event logs, translates them into PLTL specifications via fixed patterns, and validates satisfiability and requirements with automated provers.
Re-evaluation of Logical Specification in Behavioural Verification
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
This study empirically validates automated logical specification methods for behavioural models, focusing on their robustness, scalability, and reproducibility. By the systematic reproduction and extension of prior results, we confirm key trends, while identifying performance irregularities that suggest the need for adaptive heuristics in automated reasoning. Our findings highlight that theorem provers exhibit varying efficiency across problem structures, with implications for real-time verification in CI/CD pipelines and AI-driven IDEs supporting on-the-fly validation. Addressing these inefficiencies through self-optimising solvers could enhance the stability of automated reasoning, particularly in safety-critical software verification.
citation-role summary
background 1
citation-polarity summary
fields
cs.SE 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Logic Mining from Process Logs: Towards Automated Specification and Verification
A pipeline that mines process trees from event logs, translates them into PLTL specifications via fixed patterns, and validates satisfiability and requirements with automated provers.