Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
| Hi-index | 0.00 |
We provide a simpler alternative proof of the PSPACE-hardness of propositional Hoare logic (PHL).