Publications: Cliff B Jones - Computing Science - Newcastle University

More documents

Recommendations

Info

[204] C. B. Jones. Program specification and verification in VDM. Technical ReportUMCS 86-10-5, University of Manchester, 1986. extended version of [112](includes the full proofs).[205] C. B. Jones, P. Lindsay, and C. Wadsworth. IPSE 2.5 theorem proving conceptspaper. Technical Report 060/00021/1.5, Manchester University and RutherfordAppleton Laboratory, June 1986.[206] B. T. Denvir, V. A. Downes, C. B. Jones, R. A. Snowdon, and M. K. Tordoff.IPSE 2.5 project proposal. Technical report, ICL/STC-IDEC/STL/University ofManchester, February 1985.[207] H. Barringer and C. B. Jones. A survey of verification techniques for parallelprograms. Technical report, University of Manchester, September 1982.[208] C. B. Jones. Development Methods for Computer Programs including a Notionof Interference. PhD thesis, Oxford University, June 1981. Printed as:Programming Research Group, Technical Monograph 25.[209] C. B. Jones. Implementation bias in constructive specification of abstract objects.typescript, September 1977.[210] C. B. Jones. Formal definition in compiler development. Technical Report25.145, IBM Laboratory Vienna, February 1976.[211] C. B. Jones. Program development using data abstraction. typescript, December1976.[212] H. Bekič, H. Izbicki, C. B. Jones, and F. Weissenböck. Some experiments withusing a formal language definition in compiler development. Technical ReportLN 25.3.107, IBM Laboratory, Vienna, December 1975.[213] H. Bekič, D. Bjørner, W. Henhapl, C. B. Jones, and P. Lucas. A formal definitionof a PL/I subset. Technical Report 25.139, IBM Laboratory Vienna, December1974.[214] D. N. Chapman and C. B. Jones. Formal development: An example using FDSS.Technical Report TN 9007, IBM Laboratory, Hursley, 1973.[215] C. D. Allen and C. B. Jones. The formal development of an algorithm. TechnicalReport 12.110, IBM Laboratory Hursley, March 1973.[216] C. B. Jones. Formal development of programs. Technical Report 12.117, IBMLaboratory Hursley, June 1973.[217] C. D. Allen, D. N. Chapman, and C. B. Jones. A formal definition of ALGOL60. Technical Report 12.105, IBM Laboratory Hursley, August 1972.[218] C. B. Jones. Operations and formal development. Technical Report TN 9004,IBM Laboratory, Hursley, September 1972.[219] C. B. Jones. Development of correct programs: An example based on Earley’srecogniser. Technical Report TN 9000, IBM Laboratory, Hursley, April 1971.16
[220] K. V. Hanford and C. B. Jones. Dynamic syntax: A concept for the definitionof the syntax of programming languages. Technical Report 12.090, IBMLaboratory Hursley, June 1971.[221] C. B. Jones. Formal development of correct algorithms: an example based onEarley’s recogniser. Technical Report 12.095, IBM Laboratory Hursley, December1971.[222] W. Henhapl and C. B. Jones. On the interpretation of GOTO statements in theULD. Technical Report LN 25.3.065, IBM Laboratory, Vienna, March 1970.[223] W. Henhapl and C. B. Jones. The block concept and some possible implementations,with proofs of equivalence. Technical Report 25.104, IBM LaboratoryVienna, April 1970.[224] C. B. Jones. A technique for showing that two functions preserve a relation betweentheir domains. Technical Report LR 25.3.067, IBM Laboratory, Vienna,April 1970.[225] W. Henhapl and C. B. Jones. Some observations on the implementation ofreference mechanisms for automatic variables. Technical Report LR 25.3.070,IBM Laboratory, Vienna, May 1970.[226] C. B. Jones and P. Lucas. Proving correctness of implementation techniques.Technical Report 25.110, IBM Laboratory Vienna, August 1970.[227] C. B. Jones. Yet another proof of the block concept. Technical Report LN25.3.075, IBM Laboratory, Vienna, August 1970.[228] S. M. Glassover, K. V. Hanford, and C. B. Jones. The syntax machine: Adescription. Technical Report 12.078, IBM Laboratory Hursley, January 1969.[229] C. B. Jones. A proof of the correctness of some optimising techniques. TechnicalReport LN 25.3.051, IBM Laboratory, Vienna, June 1969.[230] C. B. Jones. A proof of the correctness of an interpreter based on axiom schema.Technical Report LN 25.3.053, IBM Laboratory, Vienna, June 1969.[231] C. B. Jones. Mathematical semantics of goto: Exit formulation and its relationto continuations. Technical report, IBM Laboratory Vienna, July 1968.[232] S. M. Glassover, K. V. Hanford, and C. B. Jones. The syntax machine: Anintroduction. Technical Report 12.077, IBM Laboratory Hursley, October 1968.[233] P. B. Schofield and C. B. Jones. A random generator for the automatic productionof executable PL/I programs (APEX). Technical Report 12.062, IBMLaboratory Hursley, April 1966.[234] P. B. Schofield and C. B. Jones. APEX manual. IBM Laboratory, Hursley, April1966.17
Page 1 and 2: Main Publications: Cliff B JonesBoo
Page 3 and 4: [24] D. Bjørner, C. B. Jones, M. M
Page 5 and 6: [49] Cliff B. Jones. Specification
Page 7 and 8: [74] C. B. Jones. Dependability of
Page 9 and 10: [100] C. B. Jones. Does the O-O com
Page 11 and 12: [130] Cliff B. Jones. More on excep
Page 13 and 14: [161] Cliff Jones. Determining the
Page 15: [191] Gary T. Leavens, Jean-Raymond

Publications: Cliff B Jones - Computing Science - Newcastle University

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?