Reasoning about infinite computations
Information and Computation
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Dynamic Logic
A topological characterization of weakness
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A Practical Introduction to PSL (Series on Integrated Circuits and Systems)
A Practical Introduction to PSL (Series on Integrated Circuits and Systems)
The definition of a temporal clock operator
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Resets vs. aborts in linear temporal logic
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
On the characterization of until as a fixed point under clocked semantics
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Some complexity results for systemverilog assertions
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
| Hi-index | 0.00 |
We study the relation between logical contradictions such as p *** ¬p and structural contradictions such as p *** (p .q ). Intuitively, we expect the two to be treated similarly, but they are not by PSL, nor by SVA. We provide a solution that treats both kinds of contradictions in a consistent manner. The solution reveals that not all structural contradictions are created equal: we must distinguish between them in order to preserve important characteristics of the logic. A happy result of our solution is that it provides the semantics over the natural alphabet 2 P , as opposed to the current semantics of PSL/SVA that use an inflated alphabet including the cryptic letters *** and $\bot$. We show that the complexity of model checking PSL/SVA is not affected by our proposed semantics.