Rate two more papers (in Model Checking).
Chris Pressey
1 year, 25 days ago
15 | 15 |
Of these, [**101** have the highest rating](by-rating/Top-rated.md),
|
16 | 16 |
[**25** are considered classics](by-rating/Classic.md),
|
17 | 17 |
[**46** are considered very interesting](by-rating/Very%20Interesting.md),
|
18 | |
while [**78** are yet to be rated](by-rating/Unrated.md).
|
|
18 |
while [**76** are yet to be rated](by-rating/Unrated.md).
|
19 | 19 |
|
20 | 20 |
<!-- /TOTALS -->
|
21 | 21 |
|
149 | 149 |
|
150 | 150 |
### Model Checking
|
151 | 151 |
|
152 | |
* [Model Checking CTL is Almost Always Inherently Sequential](https://arxiv.org/abs/1103.4990)
|
153 | |
* [Cycle Detection in Computation Tree Logic](https://arxiv.org/abs/1609.04095)
|
154 | 152 |
* [Direct Model-checking of SysML Models](https://www.scitepress.org/Papers/2021/102563/102563.pdf)
|
155 | 153 |
|
156 | 154 |
### Name Binding
|
101 | 101 |
I like how it's described as
|
102 | 102 |
"a chapter for the (very expensive) Handbook of Modal Logic, published by Elsevier in 2006".
|
103 | 103 |
|
|
104 |
Model Checking
|
|
105 |
--------------
|
|
106 |
|
|
107 |
### Model Checking CTL is Almost Always Inherently Sequential
|
|
108 |
|
|
109 |
* rating: 0
|
|
110 |
|
|
111 |
By "inherently sequential" they mean P-complete. Model checking for CTL is already known
|
|
112 |
to be P-complete, but they show it for a whole bunch of different fragments too.
|
|
113 |
|
|
114 |
### Cycle Detection in Computation Tree Logic
|
|
115 |
|
|
116 |
* rating: 1
|
|
117 |
|
|
118 |
A variation of CTL* which is aware of cycles is defined; it is called Cycle-CTL*. Various
|
|
119 |
things are proven about Cycle-CTL*. It is a very expressive language for statements
|
|
120 |
about the temporal behaviour of a system.
|
|
121 |
|
104 | 122 |
PLDI
|
105 | 123 |
----
|
106 | 124 |
|