Publications

Journals
[1]	R. Colvin, I.J. Hayes, and P.A. Strooper. Calculating modules in contextual logic program refinement. Theory and Practice of Logic Programming, 2006. Accepted 21 August 2006.
[2]	I. J. Hayes, R. Colvin, D. Hemer, R. Nickson, and P. A. Strooper. A refinement calculus for logic programs. Theory and Practice of Logic Programming, 2(4-5):425-460, July-September 2002.
Book Chapter
[3]	R. Colvin, L. Groves, I. J. Hayes, D. Hemer, R. Nickson, and P.A. Strooper. Developing logic programs from specifications using stepwise refinement. In Maurice Bruynooghe and Kung-Kiu Lau, editors, Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, volume 3049 of Lecture Notes in Computer Science, pages 66-89. Springer Verlag, 2004.
Conference
[4]	Robert Colvin and Brijesh Dongol. Verifying lock-freedom using well-founded orders. In Proceedings of the International Conference on Theoretical Computer Science (ICTAC), 2007. To appear.
[5]	Lars Grunske, Robert Colvin, and Kirsten Winter. Probabilistic FMEA. In Proceedings of Quantitative Evaluation of Systems (QEST), 2007. To appear.
[6]	Robert Colvin and Lindsay Groves. A scalable lock-free stack algorithm and its verification. In Proceedings of Software Engineering and Formal Methods (SEFM), 2007. To appear.
[7]	Lian Wen, Robert Colvin, Kai Lin, John Seagrott, Nisansala Yatapanage, and Geoff Dromey. ``Integrare'', a collaborative environment for Behavior-Oriented design. In International Conference on Cooperatve Design, Visualisation, and Engineering (CDVE). Lecture Notes in Computer Science, 2007. To appear.
[8]	Robert Colvin, Lars Grunske, and Kirsten Winter. Probabilistic timed Behavior Trees. In Jim Davies and Jeremy Gibbons, editors, Proceedings of the International Conference on Integrated Formal Methods (IFM), volume 4591 of Lecture Notes in Computer Science, pages 156-175. Springer-Verlag, 2007.
[9]	Lars Grunske, Kirsten Winter, and Robert Colvin. Timed Behavior Trees and their Application to Verifying Real-time Systems. In Proceedings of the 18th Australian Conference on Software Engineering (ASWEC 2007), pages 211-220. IEEE Computer Society, 2007.
[10]	Robert Colvin and Lindsay Groves. Derivation of a scalable lock-free stack algorithm. In Proceedings of the REFINE 2006 Workshop (REFINE 2006). Electronic Notes in Theoretical Computer Science, 2006.
[11]	Robert Colvin, Lindsay Groves, Victor Luchangco, and Mark Moir. Formal verification of a lazy concurrent list-based set algorithm. In Thomas Ball and Robert B. Jones, editors, Computer Aided Verification, 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, volume 4144 of Lecture Notes in Computer Science, pages 475-488. Springer, 2006.
[12]	Robert Colvin and Lindsay Groves. Formal verification of an array-based nonblocking queue. In 10th International Conference on Engineering of Complex Computer Systems (ICECCS 2005), 16-20 June 2005, Shanghai, China, pages 507-516. IEEE Computer Society, 2005.
[13]	Robert Colvin, Simon Doherty, and Lindsay Groves. Verifying concurrent data structures by simulation. In Proceedings of the REFINE 2005 Workshop (REFINE 2005), volume 137, pages 93-110. Electronic Notes in Theoretical Computer Science, 2005. [ http ]
[14]	R. Colvin, I. J. Hayes, D. Hemer, and P.A. Strooper. Refinement of higher-order logic programs. In M. Leuschel, editor, Proceedings of the International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR 2002), volume 2664 of Lecture Notes in Computer Science, pages 126-143. Springer, 2003.
[15]	R. Colvin, I. J. Hayes, D. Hemer, and P. Strooper. Translating refined logic programs to Mercury. In Michael Oudshoorn, editor, Proceedings of the Twenty-Fifth Australasian Computer Science Conference, volume 4 of Conferences in Research and Practice in Information Technology, pages 33-40. Australian Computer Society, January 2002.
[16]	D. Hemer, R. Colvin, I. J. Hayes, and P. Strooper. Don't care non-determinism in logic program refinement. In James Harland, editor, Proceeding of Computing: the Australasian Theory Symposium, volume 61 of Electronic Notes in Computer Science (ENTCS). Elsevier Science, January 2002.
[17]	R. Colvin, I. J. Hayes, and P. Strooper. A technique for modular logic program refinement. In K.-K. Lau, editor, Logic Based Program Synthesis and Transformation (LOPSTR 2000), Selected Papers, volume 2402 of LNCS, pages 38-56. Springer, 2001.
[18]	R. Colvin, I. J. Hayes, and P. Strooper. Refining logic programs using types. In Jenny Edwards, editor, Australasian Computer Science Conference (ACSC 2000), pages 43-50. IEEE Computer Society, 2000.
[19]	R. Colvin, I. J. Hayes, and P. Strooper. Data refining logic programs. In Jim Grundy, Martin Schwenke, and Trevor Vickers, editors, International Refinement Workshop and Formal Methods Pacific 1998, Discrete Mathematics and Theoretical Computer Science, pages 100-116. Springer--0.2em Verlag, 1998.
[20]	R. Colvin, I. J. Hayes, R. Nickson, and P. Strooper. A tool for logic program refinement. In D. J. Duke and A. S. Evans, editors, Second BCS-FACS Northern Formal Methods Workshop, Electronic Workshops in Computing. Springer Verlag, 1997.
PhD Thesis
[21]	Robert Colvin. Contextual and Data Refinement for the Refinement Calculus for Logic Programs. PhD thesis, School of Information Technology and Electrical Engineering, University of Queensland, August 2002.
Tech reports
[22]	Robert Colvin and I. J. Hayes. A semantics for Behavior Trees. ACCS Technical Report ACCS-TR-07-01, ARC Centre for Complex Systems, April 2007.
[23]	R. Colvin. Coding guidelines for developing real-time software amenable to scheduling analysis. Project Report 0036-3, SVRC Services, May 2002.
[24]	I. J. Hayes, R. Nickson, P. Strooper, and R. Colvin. A declarative semantics for logic program refinement. Technical Report 00-30, Software Verification Research Centre, The University of Queensland, 2000.

This file has been generated by bibtex2html 1.78

Last updated 16th August 2007