Formal development of correct algorithms: an example based on Earley’s recogniser
- Lookup NU author(s)
- Professor Cliff Jones
|
|
|
|
| Author(s) | | Jones CB |
| Editor(s) | | |
| Publication type | | Conference Proceedings (inc. Abstract) |
| Conference Name | | ACM Conference on Proving Assertions about Programs |
| Conference Location | | New Mexico State University, Las Cruces, New Mexico |
| Year of Conference | | 1972 |
| Date | | 6-7 January 1972 |
| Volume | | |
| Pages | | 150-169 |
|
|
|
| Full text for this publication is not currently held within this repository. Alternative links are provided below where available. |
|
|
|
| Publisher | | ACM |
| Notes | | Proceedings published as ACM SIGPLAN Notices vol.7, no.1, January,1972; also ACM SIGACT News no.14, January,1972. |
