You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
| Chapter title |
Formal Correctness Proofs of Functional Programs: Dijkstra’s Algorithm, a Case Study
|
|---|---|
| Chapter number | 4 |
| Book title |
Computational Logic
|
| Published by |
Springer, Berlin, Heidelberg, January 1999
|
| DOI | 10.1007/978-3-642-58622-4_4 |
| Book ISBNs |
978-3-64-263670-7, 978-3-64-258622-4
|
| Authors |
Holger Benl, Helmut Schwichtenberg |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| United States | 1 | 33% |
| Unknown | 2 | 67% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 1 | 33% |
| Student > Master | 1 | 33% |
| Unknown | 1 | 33% |
| Readers by discipline | Count | As % |
|---|---|---|
| Engineering | 2 | 67% |
| Unknown | 1 | 33% |