Theoretical Computer Science Group publications

• Logahedra: a New Weakly Relational Domain. Jacob M. Howe and Andy King. In Zhiming Lu and Anders P. Ravn, editors, International Symposium on Automated Technology for Verification and Analysis, Lecture Notes in Computer Science. Springer-Verlag, October 2009.
• A compositional translation of Timed Automata with Deadlines to Uppaal Timed Automata. Rodolfo Gomez. In Proc. of the 7th Int. Conf. on Formal Modelling and Analysis of Timed Systems (FORMATS'09), 14-16 September, Budapest, Hungary, LNCS 5813, pages 179-194. Springer, September 2009.
• Podcasting by synchronising PowerPoint and voice: What are the pedagogical benefits?. Darren K. Griffin, David Mitchell, and Simon Thompson. Computers and Education, 53(2):532-539, September 2009.
• Erlang Programming. Francesco Cesarini and Simon Thompson. O'Reilly, June 2009.
• Integer Polyhedra for Program Analysis. Philip Charles, Jacob Howe, and Andy King. In Andrew Goldberg and Yunhong Zhou, editors, Proceedings of the Fifth International Conference on Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science. Springer-Verlag, June 2009.
• Compositional detection of Zeno behavior in Timed Automata with Deadlines. Rodolfo Gomez. Technical report 3-09, Computing Laboratory, University of Kent, June 2009.
• Modularity of convergence in infinitary rewriting. Stefan Kahrs. In Ralf Treinen, editor, Rewriting Techniques and Applications, volume 5595 of Lecture Notes in Computer Science, pages 179-193. Springer, June 2009.
• Modularity of convergence in infinitary rewriting. Stefan Kahrs. In Rewriting Techniques and Applications, page 15, June 2009. to appear.
• From LIDL(m) to Timed Automata. Rodolfo Gomez. Technical Report TR-2-09-2009, Computing Laboratory, University of Kent, April 2009.
• The expressiveness of spider diagrams augmented with constants. Gem Stapleton, John Taylor, Simon Thompson, and John Howse. Journal of Visual Languages and Computing, 20:30-49, April 2009.
• Clone Detection and Removal for Erlang/OTP within a Refactoring Environment. Huiqing Li and Simon Thompson. In Massimiliano Di Penta and Jens Knodel, editors, Third International Workshop on Detection of Software Clones, page 1pp, Kaiserslautern, Germany, March 2009.
• Preface: Special Issue on REFINE 2006. Bernhard Aichernig, Eerke A. Boiten, Michael Butler, John Derrick, and Lindsay Groves. Formal Aspects of Computing, 21(1-2):1, February 2009.
• Relational concurrent refinement II: Internal operations and outputs. E.A. Boiten, J. Derrick, and G. Schellhorn. Formal Aspects of Computing, 21(1-2):65-102, February 2009.
• Modelling divergence in relational concurrent refinement. E.A. Boiten and J. Derrick. In M. Leuschel and H. Wehrheim, editors, IFM 2009: Integrated Formal Methods, volume 5423 of LNCS, pages 183-199. Springer Verlag, February 2009.
• Functional programming. Olaf Chitil. In Benjamin W. Wah, editor, Encyclopedia of Computer Science and Engineering, volume 2, pages 1334-1344. John Wiley & Sons, Hoboken, NJ, January 2009.
• Clone Detection and Removal for Erlang/OTP within a Refactoring Environment. Huiqing Li and Simon Thompson. In ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM'09), Savannah, Georgia, USA, January 2009.
• Linear, bounded, functional pretty-printing. S. Doaitse Swierstra and Olaf Chitil. Journal of Functional Programming, 19(01):1-16, January 2009.
• Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry. Andy King. In Puri Arenas and Damiano Zanardini, editors, Proceedings on Logic-Based Methods in Programming Envrionments, pages 1-7, Udine, December 2008. Invited paper.
• Inferring Non-Suspension Conditions for Logic Programs with Dynamic Scheduling. Samir Genaim and Andy King. ACM Transactions on Computational Logic, November 2008. To appear.
• Tool Support for Refactoring Functional Programs. Huiqing Li and Simon Thompson. In Danny Dig, Robert Fuhrer, and Ralph Johnson, editors, Proceedings of the Second ACM SIGPLAN Workshop on Refactoring Tools, page 4pp, Nashville, Tennessee, USA, October 2008.
• From ABZ to cryptography (abstract). Eerke A. Boiten. In E. Börger, M. Butler, J.P. Bowen, and P. Boca, editors, ABZ 2008, volume 5238 of LNCS, page 353. Springer, September 2008.
• Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages. Aidan Delaney, John Taylor, and Simon Thompson. In Gem Stapleton, John Howse, and John Lee, editors, Diagrammatic Representation and Inference: 5th International Conference, Diagrams 2008, Herrsching, Germany, September 19-21, 2008, number 5223 in Lecture Notes in Computer Science, pages 172-187, September 2008.
• Anytime algorithms for robdd symmetry detection and approximation. Neil J Kettle. PhD thesis, Computing Laboratory, University of Kent, September 2008.
• Refactoring with Wrangler, updated: Data and process refactorings, and integration with Eclipse. Huiqing Li, Simon Thompson, George Orosz, and Melinda Toth. In Zoltan Horvath and Tee Teoh, editors, Proceedings of the Seventh ACM SIGPLAN Erlang Workshop, page 12pp. ACM Press, September 2008.
• Refactoring with Wrangler, updated. Huiqing Li, Simon Thompson, Gy"orgy Orosz, and Melinda T"oth. In ACM SIGPLAN Erlang Workshop 2008, Victoria, British Columbia, Canada, September 2008.
• Implementation and application of functional languages: 19th international workshop, ifl 2007, freiburg, germany, september 27-29, 2007. revised selected papers. Olaf Chitil, Zoltàn Horvàth, and Viktòria Zsòk, editors, LNCS 5083, Berlin, Heidelberg, July 2008. Springer-Verlag.
• Comprehending finite maps for algorithmic debugging of higher-order functional programs. Olaf Chitil and Thomas Davie. In PPDP '08: Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming, pages 205-216. ACM, July 2008.
• Bit-Precise Reasoning with Affine Functions. Neil Kettle and Andy King. Electronic Notes in Theoretical Computer Science, page 12, July 2008. Revised, Selected papers from the Bit-Precise Reasoning (BPR'08) workshop in Princetown.
• Inferring Congruence Equations using SAT. Andy King and Harald Sondergaard. In Aarti Gupta and Sharad Malik, editors, Twentieth International Conference on Computer-Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, July 2008.
• Preface: Refine 2008 proceedings. Eerke A. Boiten, John Derrick, and Gerhard Schellhorn. Electronic Notes in Theoretical Computer Science, 214:1, June 2008.
• Verification of Timed Automata with Deadlines in Uppaal. Rodolfo Gomez. Technical Report 2-08, Computing Laboratory, University of Kent, June 2008.
• More relational refinement: traces and partial relations. J. Derrick and E.A. Boiten. Electronic Notes in Theoretical Computer Science, 214:255-276, May 2008. Proceedings of REFINE 2008 (Turku, May 2008).
• Clone Detection and Removal for Erlang/OTP within a Refactoring Environment. Huiqing Li and Simon Thompson. In P. Achten, P. Koopman, and M. T. Morazán, editors, Draft Proceedings of the Ninth Symposium on Trends in Functional Programming(TFP), The Netherlands, May 2008.
• A Certified Refactoring Engine. Nik Sultana and Simon Thompson. In P. Achten, P. Koopman, and M. T. Morazán, editors, Draft Proceedings of the Ninth Symposium on Trends in Functional Programming (TFP), May 2008.
• An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs. Neil Kettle and Andy King. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27(4):764-777, April 2008. Digital Object Identifier 10.1109/TCAD.2008.917592.
• Programming errors in traversal programs over structured data. Ralf Laemmel, Simon Thompson, and Markus Kaiser. In Jurgen Vinju and Adrian Johnstone, editors, 8th Workshop on Language Description, Tools and Applications, ENTCS. Springer, April 2008.
• Verification of Refactorings in Isabelle/HOL. Nik Sultana. Master's thesis, Computing Laboratory, University of Kent, April 2008.
• Logic-based program synthesis and transformation, kongens lyngby, denmark, august 23-24, 2007, revised selected papers. Andy King. Number 4915 in Lecture Notes in Computer Science. Springer-Verlag, March 2008.
• Preface: Proceedings of the BCS-FACS Refinement Workshop (REFINE 2007). E.A. Boiten, J. Derrick, and G. Smith. Electronic Notes in Theoretical Computer Science, 201:1, February 2008.
• Reduction and refinement. Eerke Boiten and Dan Grundy. Electronic Notes in Theoretical Computer Science, 201C:31-44, February 2008. Proceedings of the BCS-FACS Refinement Workshop, Oxford, 2007. doi 10.1016/j.entcs.2008.02.014.
• Inferring Congruence Equations with SAT. Andy King and Harald Sondergaard. Technical Report 1-08, Computing Laboratory, University of Kent, January 2008.
• Tool Support for Refactoring Functional Programs. Huiqing Li and Simon Thompson. In Partial Evaluation and Program Manipulation, San Francisco, California, USA, January 2008.
• Mechanical Verification of Refactorings. Nik Sultana and Simon Thompson. In Workshop on Partial Evaluation and Program Manipulation. ACM SIGPLAN, January 2008.
• Monadic prompt lazy assertions in Haskell. Olaf Chitil and Frank Huch. In Zhong Shao, editor, Programming Languages and Systems, 5th Asian Symposium, APLAS 2007, LNCS 4807, pages 38-53. Springer, November 2007.
• Expressiveness of temporal query languages: On the modelling of intervals, interval relationships and states. R.S. Gomez and J.C. Ausguto. Artificial Intelligence Review, November 2007. Electronic version available online (http://www.springerlink.com/content/r3347p646152351m).
• Efficient Detection of Zeno Runs in Timed Automata. Rodolfo Gomez and Howard Bowman. In J.-F. Raskin and P.S. Thiagarajan, editors, 5th International Conference FORMATS 2007 (Formal Modelling and Analysis of Timed Systems), volume 4763 of LNCS, pages 195-210, Salzburg, Austria, October 2007. Springer.
• Refactorings that Split and Merge Programs. Christopher Brown and Simon Thompson. In Draft Proceedings of the 19th International Symposium on Implementation and Application of Functional Languages, IFL 2007, Freiburg, Germany., September 2007.
• Testing Erlang Refactorings with QuickCheck. {Huiqing Li and Simon Thompson. In Draft Proceedings of the 19th International Symposium on Implementation and Application of Functional Languages, IFL 2007, Freiburg, Germany, September 2007.
• Testing Erlang Refactorings with QuickCheck. Huiqing Li and Simon Thompson. In the 19th International Symposium on Implementation and Application of Functional Languages, IFL 2007, LNCS, Freiburg, Germany, September 2007.
• Algorithmic debugging and trusted functions. Yong Luo and Olaf Chitil. Technical report 10-07, University of Kent, Computing Laboratory, UK, August 2007.
• Algorithmic debugging for locally defined functions. Yong Luo and Olaf Chitil. Technical report 8-07, University of Kent, Computing Laboratory, UK, August 2007.
• Algorithmic debugging with cyclic traces of lazy functional programs. Yong Luo and Olaf Chitil. Technical report 9-07, University of Kent, Computing Laboratory, UK, August 2007.
• Replacing unevaluated parts in the traces of functional programs. Yong Luo and Olaf Chitil. Technical report 7-07, University of Kent, Computing Laboratory, UK, August 2007.
• Taming the Wrapping of Integer Arithmetic. Axel Simon and Andy King. In Gilberto File and Hanne Riis Nielson, editors, Fourteenth International Static Analysis Symposium, Lecture Notes in Computer Science. Springer, August 2007. To Appear, see http://www.springer.de/comp/lncs/index/html.
• Declarative extensions of XML languages. Simon Thompson, Peter R. King, and Patrick Schmitz. In Peter R. King and Steven Simske, editors, Proceedings of the 2007 ACM symposium on Document engineering, pages 89-91. ACM, ACM Press, August 2007.
• Editorial: Proceedings of the 11th BCS-FACS Refinement Workshop, Macao, 2006. B. Aichernig, E.A. Boiten, J. Derrick, and L. Groves. Electronic Notes in Theoretical Computer Science, 187:1, July 2007.
• Refine 2007 participants' proceedings. Eerke A. Boiten, John Derrick, and Graeme Smith. Technical Report 4-07, University of Kent, Computing Laboratory, July 2007.
• Relational concurrent refinement with internal operations. J. Derrick and E.A. Boiten. Electronic Notes in Theoretical Computer Science, 187:35-53, July 2007. Proceedings of Refine 2007, the 11th BCS-FACS Refinement Workshop. Editors: B. Aichernig, E.A. Boiten, J. Derrick and L. Groves.
• Infinitary rewriting: meta-theory and convergence. Stefan Kahrs. Acta Informatica, 44(2):91-121, May 2007.
• Declarative extensions of xml languages. Simon Thompson and Peter King. Technical Report 3-07, University of Kent, Computing Laboratory, May 2007.
• A pattern logic for prompt lazy assertions. Olaf Chitil and Frank Huch. In Implementation and Application of Functional Languages, 18th International Workshop, IFL 2006, LNCS 4449, pages 126-144, April 2007.
• Structure and properties of traces for functional programs. Olaf Chitil and Yong Luo. In Ian Mackie, editor, Proceedings of the 3rd International Workshop on Term Graph Rewriting, Termgraph 2006, ENTCS, pages 39-63. Elsevier, April 2007.
• Proving the correctness of algorithmic debugging for functional programs. Yong Luo and Olaf Chitil. In Trends in Functional Programming, volume 7, pages 19-34. Intellect Books, January 2007.
• Control Generation by Program Transformation. Andy King and Jonathan C. Martin. Fundamenta Informaticae, 69(1-2):179-218, 2006.
• How to stop time stopping. H. Bowman and R. Gomez. Formal Aspects of Computing, 18(4):459-493, December 2006.
• Compositional detection of Zeno behaviour in Timed Automata. R. Gomez and H. Bowman. Technical Report 12-06, University of Kent, Computing Laboratory, CT2 7NF Canterbury, Kent, UK, December 2006.
• Refactoring erlang programs. Huiqing Li, Simon Thompson, László Lövei, Zoltán Horváth, Tamás Kozsik, Anikó Víg, and Tamás Nagy. In The Proceedings of 12th International Erlang/OTP User Conference, Stockholm, Sweden, November 2006.
• Widening Polyhedra with Landmarks. Axel Simon and Andy King. In Naoki Kobayashi, editor, Fourth Asian Symposium on Programming Languages and Systems, volume 4279 of Lecture Notes in Computer Science, pages 166-182. Springer Verlag, November 2006. See also http://www.springer.de/comp/lncs/index.html.
• Verification of real-time systems: Improving tool support. Rodolfo Sabas Gomez. PhD thesis, Computing Laboratory, University of Kent, October 2006.
• A Pattern Logic for Prompt Lazy Assertions in Haskell. Olaf Chitil and Frank Huch. In Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006, Budapest, Hungary, September 2006. Eotvos Lorand University.
• Promoting non-strict programming. Olaf Chitil. In Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006, pages 512-516, Budapest, Hungary, September 2006. Eotvos Lorand University.
• Display of functional values for debugging. Thomas Davie and Olaf Chitil. In Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006, pages 326-337, Budapest, Hungary, September 2006. Eotvos Lorand University.
• A comparative study of refactoring haskell and erlang programs. Huiqing Li and Simon Thompson. In Massimiliano Di Penta and Leon Moonen, editors, Sixth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2006), pages 197-206. IEEE, September 2006.
• Refactoring haskell programs. Huiqing Li. PhD thesis, Computing Laboratory, University of Kent, Canterbury, Kent, UK, September 2006.
• Replacing unevaluated parts in the traces of functional programs. Yong Luo and Olaf Chitil. In Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006, pages 304-325, Budapest, Hungary, September 2006. Eotvos Lorand University.
• Editorial: Special issue on Refine 2005. Eerke A. Boiten and Michael Butler. Formal Aspects of Computing, 18(3):263, August 2006.
• Proof of New Decompositional Results for Generalized Symmetries. Neil Kettle and Andy King. Technical Report 05-06, University of Kent, Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF, August 2006.
• Detecting Determinacy in Prolog Programs. Andy King, Lunjin Lu, and Samir Genaim. In Sandro Etalle and Mirek Truszczynski, editors, Twenty Second International Conference on Logic Programming, volume 4079 of Lecture Notes in Computer Science, pages 132-147. Springer-Verlag, August 2006.
• Collapsing Closures. Xuan Li, Andy King, and Lunjin Lu. In Sandro Etalle and Mirek Truszczynski, editors, Twenty Second International Conference on Logic Programming, volume 4079 of Lecture Notes in Computer Science, pages 148-162. Springer-Verlag, August 2006. Also see http://www.springer.de/comp/lncs/index.html.
• Gene expression programming with pre-order traversals. Stefan Kahrs. In Konstantinos Sirlantzis, editor, 6th International Conference on Recent Advances in Soft Computing, pages 84-89. RASC 2006, July 2006.
• Genetic programming with primitive recursion. Stefan Kahrs. In Maarten Keijzer and et. al., editors, 8th annual conference on Genetic and evolutionary computation, volume 1, pages 941-942. ACM SIGEVO, ACM Press, July 2006.
• Combining algorithmic debugging and program slicing. Josep Silva and Olaf Chitil. In Eighth ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming , PPDP 2006, pages 157-166. ACM Press, July 2006.
• Pretty printing with delimited continuations. Olaf Chitil. Technical report 4-06, University of Kent, Computing Laboratory, June 2006.
• Proving the correctness of algorithmic debugging for functional programs. Olaf Chitil and Yong Luo. In Pre-Proceedings of the Seventh Symposium on Trends in Functional Programming, TFP 2006. University of Nottingham, April 2006.
• Towards a theory of tracing for functional programs based on graph rewriting. Olaf Chitil and Yong Luo. In Ian Mackie, editor, Draft Proceedings of the 3rd International Workshop on Term Graph Rewriting, Termgraph 2006, page 10, April 2006.
• One right does make a wrong. Thomas Davie and Olaf Chitil. In Pre-Proceedings of the Seventh Symposium on Trends in Functional Programming, TFP 2006, April 2006.
• Correctness of Closure Collapsing. Xuan Li, Andy King, and Lunjin Lu. Technical Report 2-06, University of Kent, Computing Laboratory, University of Kent, Canterbury, CT2 7NF, April 2006.
• Lazy Set-Sharing Analysis. Xuan Li, Andy King, and Lunjin Lu. In Philip Wadler and Masimi Hagiya, editors, Eighth International Symposium on Functional and Logic Programming, volume 3945 of Lecture Notes in Computer Science, pages 177-191. Springer-Verlag, April 2006. Also see http://www.springer.de/comp/lncs/index.html.
• Widening ROBDDs with Prime Implicants. Neil Kettle, Andy King, and Tadeusz Strzemecki. In Holger Hermanns and Jens Palsberg, editors, Twelfth International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 3920 of Lecture Notes in Computer Science, pages 105-119. Springer-Verlag, March 2006. Also see http://www.springer.de/comp/lncs/index.html.
• Proof of New Implicational Relationships between Generalized Symmetries. Neil Kettle and Andy King. Technical Report 13-05, University of Kent, Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF, February 2006.
• Mechanising a Unifying Theory. Gift Nuka and Jim Woodcock. In UTP'06: First International Symposium on Unifying Theories of Programming, Middlesbrough (UK), February 2006. To be published in Lecture Notes in Computer Science 2006.
• Concurrency theory, calculi and automata for modelling untimed and timed concurrent systems. H. Bowman and R.S. Gomez. Springer, January 2006.
• An Anytime Symmetry Detection Algorithm for ROBDDs. Neil Kettle and Andy King. In Hidetoshi Onodera, editor, Eleventh Asia and South Pacific Design Automation Conference, pages 243-248. IEEE, January 2006. Copyright held by IEEE 2006.
• Formal modeling of connectionism using concurrency theory, an approach based on automata and model checking. Li Su, Howard Bowman, and Brad Wyble. Technical Report 1-06, University of Kent, Computing Laboratory, January 2006.
• Computing Convex Hulls with a Linear Solver. F. Benoy, A. King, and F. Mesnard. Theory and Practice of Logic Programming, 5(1&2):259-271, 2005. (Theory and Practice of Logic Programming was formally known as The Journal of Logic Programming, see http://www.cwi.nl/projects/alp/Welcome/appeal.html).
• Editorial: Special issue on Integrated Formal Methods. Eerke A. Boiten, John Derrick, and Graeme Smith. Formal Aspects of Computing, 17(4):389, December 2005.
• A tool for the syntactic detection of zeno-timelocks in timed automata. H Bowman, R Gomez, and L Su. Electronic Notes in Theoretical Computer Science, 139(1):25-47, November 2005. Proceedings of the 6th AMAST Workshop on Real-time Systems (ARTS 2004).
• Birrell's distributed reference listing revisited. Luc Moreau, Peter Dickman, and Richard Jones. ACM Transactions on Programming Languages and Systems (TOPLAS), 27(6):1-52, November 2005.
• Hat-explore: Source-based trace exploration. Olaf Chitil. In Colin Runciman, editor, Hat Day 2005: work in progress on the Hat tracing system for Haskell, pages 1-5. Tech. Report YCS-2005-395, Dept. of Computer Science, University of York, UK, October 2005.
• Hat-delta - one right does make a wrong. Thomas Davie and Olaf Chitil. In Colin Runciman, editor, Hat Day 2005: work in progress on the Hat tracing system for Haskell, pages 6-11. Tech. Report YCS-2005-395, Dept. of Computer Science, University of York, UK, October 2005.
• Determinacy Inference by Suspension Inference. Andy King, Lunjin Lu, and Samir Genaim. Technical Report 2-05, University of Kent, Computing Laboratory, University of Kent, October 2005.
• A Type Theory with Partially Defined Functions. Yong Luo. Technical Report 10-05, University of Kent, Computing Laboratory, University of Kent, Canterbury, Kent, UK, October 2005.
• New eta-reduction and Church-Rosser. Yong Luo. Technical Report 7-05, University of Kent, Computing Laboratory, University of Kent, Canterbury, Kent, UK, October 2005.
• Yet Another Normalisation Proof for Martin-Lof's Logical Framework - Terms with correct arities are strongly normalising. Yong Luo. Technical Report 6-05, University of Kent, Computing Laboratory, University of Kent, Canterbury, Kent, UK, October 2005.
• Porting HaRe to the GHC API. Chris Ryder and Simon Thompson. Technical Report 8-05, University of Kent, Computing Laboratory, University of Kent, Canterbury, Kent, UK, October 2005.
• Pretty printing with partial continuations. Olaf Chitil. In Andrew Butterfield, editor, Draft Proceedings of the 17th International Workshop on Implementation and Application of Functional Languages, IFL 05, page 2. Tech. Report No: TCD-CS-2005-60, University of Dublin, Ireland, September 2005.
• Hat-delta: One right does make a wrong. Thomas Davie and Olaf Chitil. In Andrew Butterfield, editor, Draft Proceedings of the 17th International Workshop on Implementation and Application of Functional Languages, IFL 05, page 11. Tech. Report No: TCD-CS-2005-60, University of Dublin, Ireland, September 2005.
• A fast analysis for thread-local garbage collection with dynamic class loading. Richard Jones and Andy King. In Fifth IEEE International Workshop on Source Code Analysis and Manipulation, pages 129-138, Budapest, September 2005. IEEE Computer Society.
• Formalisation of Haskell Refactorings. Huiqing Li and Simon Thompson. In Marko van Eekelen and Kevin Hammond, editors, Trends in Functional Programming, September 2005.
• Tableaux for Diagrammatic Reasoning. Octavian Patrascoiu, Simon Thompson, and Peter Rodgers. In Philip Cox and Trevor Smedley, editors, Proceedings of the 2005 International Workshop on Visual Languages and Computing, pages 279-286, September 2005. Published as a part of the Proceedings of the Eleventh International Conference on Distributed Multimedia Systems.
• Software Metrics: Measuring Haskell. Chris Ryder and Simon Thompson. In Marko van Eekelen and Kevin Hammond, editors, Trends in Functional Programming, September 2005.
• Exploiting Sparsity in Polyhedral Analysis. Axel Simon and Andy King. In Chris Hankin, editor, Twelfth International Static Analysis Symposium, volume 3672 of Lecture Notes in Computer Science, pages 336-351. Springer Verlag, September 2005. Also see http://www.springer.de/comp/lncs/index.html.
• A New Language for the Visualization of Logic and reasoning. Gem Stapleton, Simon Thompson, Andrew Fish, John Howse, and John Taylor. In Philip Cox and Trevor Smedley, editors, Proceedings of the 2005 International Workshop on Visual Languages and Computing, pages 287-292, September 2005. Published as a part of the Proceedings of the Eleventh International Conference on Distributed Multimedia Systems.
• Modelling Reactive Multimedia: Design and Authoring. Simon Thompson, Peter King, and Helen Cameron. Multimedia Tools and Applications, 27(1):23 - 52, September 2005.
• Refactoring Functional Programs. Simon Thompson. In Varmo Vene and Tarmo Uustalu, editors, Advanced Functional Programming, 5th International School, AFP 2004, volume 3622 of Lecture Notes in Computer Science, pages 331-357. Springer Verlag, September 2005.
• Formal program development with approximations. Eerke A. Boiten and John Derrick. In Helen Treharne, Steve King, Martin Henson, and Steve Schneider, editors, ZB 2005, volume 3455 of Lecture Notes in Computer Science, pages 375-393. Springer, April 2005.
• Refine 2005 workshop. J. Derrick and E. Boiten, editors, volume 137(2) of Electronic Notes in Theoretical Computer Science. Elsevier, April 2005. http://www.sciencedirect.com/science/journal/15710661.
• The Haskell Refactorer: HaRe, and its API. Huiqing Li, Simon Thompson, and Claus Reinke. In John Boyland and Görel Hedin, editors, Proceedings of the 5th workshop on Language Descriptions, Tools and Applications (LDTA 2005), April 2005. Published as Volume 141, Number 4 of Electronic Notes in Theoretical Computer Science, http://www.sciencedirect.com/science/journal/15710661.
• Determinacy Inference for Logic Programs. Lunjin Lu and Andy King. In Mooly Sagiv, editor, European Symposium on Programming, volume 3444, pages 108-123. Springer-Verlag, April 2005. Also see http://www.springer.de/comp/lncs/index.html.
• Source-based trace exploration. Olaf Chitil. In Clemens Grelck, Frank Huch, Greg J. Michaelson, and Phil Trinder, editors, Implementation and Application of Functional Languages, 16th International Workshop, IFL 2004, LNCS 3474, pages 126-141. Springer, March 2005.
• Discrete Timed Automata. Rodolfo Gomez and Howard Bowman. Technical Report 3-05, University of Kent, Computing Laboratory, February 2005.
• Pretty printing with lazy dequeues. Olaf Chitil. Transactions on Programming Languages and Systems (TOPLAS), 27(1):163-184, January 2005.
• PITL2MONA}: Implementing a Decision Procedure for Propositional Interval Temporal Logic. Rodolfo Gomez and Howard Bowman. Journal of Applied Non-Classical Logics, 14(1-2):105-148, 2004. Issue on Interval Temporal Logics and Duration Calculi. V. Goranko and A. Montanari guest eds.
• A naive bayes learning based website reconfiguration system. Jia Li, Huiqing Li, and Xiumei Jia. In Proceedings of the 2004 International Conference on Machine Learning and Applications, December 2004.
• Transformation in HaRe. Chau Nguyen-Viet. Technical report, University of Kent, Computing Laboratory, University of Kent, Canterbury, Kent, UK, December 2004.
• Graph drawing techniques for geographic visualization. Peter Rodgers. In Alan MacEachren, Menno-Jan Kraak, and Jason Dykes, editors, Exploring geovisualization, pages 143-158. Pergamon, December 2004.
• Lazy assertions. Olaf Chitil, Dan McNeill, and Colin Runciman. In Phil Trinder, Greg Michaelson, and Ricardo Pena, editors, Implementation of Functional Languages: 15th International Workshop, IFL 2003, LNCS 3145. Springer, November 2004.
• Inferring Non-Suspension Conditions for Logic Programs with Dynamic Scheduling. Samir Genaim and Andy King. Technical Report 20-04, University of Kent, Computing Laboratory, November 2004.
• The Expressiveness of Spider Diagrams. Gem Stapleton, John Howse, John Taylor, and Simon Thompson. Journal of Logic and Computation, 14(6):857-880, November 2004.
• Determinancy Inference for Logic Programs. Lunjin Lu and Andy King. Technical Report 19-04, University of Kent, Computing Laboratory, University of Kent, October 2004.
• Source-based trace exploration. Olaf Chitil. In Draft Proceedings of the 16th International Workshop on Implementation of Functional Languages, IFL 2004, pages 239-244. Technical Report 0408, University of Kiel, September 2004.
• Collecting the garbage without blocking the traffic. Richard Jones and Andy King. Technical Report 18-04, University of Kent, Computing Laboratory, September 2004.
• Removing garbage collector synchronisation. Andy C. King. PhD thesis, University of Kent at Canterbury, September 2004.
• Dynamic Euler Diagram Drawing. Peter Rodgers, Paul Mutton, and Jean Flower. In Proceedings IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'04), pages 147-156. IEEE, September 2004.
• The Expressiveness of Spider Diagrams Augmented with Constants. Gem Stapleton, John Howse, John Taylor, and Simon Thompson. In Visual Languages / Human Centered Computing 2004, September 2004.
• Software measurement for functional programming. Chris Ryder. PhD thesis, Computing Lab, University of Kent, Canterbury, UK, August 2004.
• Linear temporal logic and Z refinement. John Derrick and Graeme Smith. In C. Rattray, S Maharaj, and C Shankland, editors, Algebraic Methodology and Software Technology (AMAST 2004), volume 3116 of Lecture Notes in Computer Science, pages 117-131. Springer, July 2004.
• Metro Map Layout Using Multicriteria Optimization. Jonathan Stott and Peter Rodgers. In Proceedings 8th International Conference on Information Visualisation (IV04), pages 355-362. IEEE, July 2004.
• Translating Erlang to mucrl. Thomas Arts, Clara Benac Earle, and Juan José Sánchez Penas. In Proceedings of the International Conference on Application of Concurrency to System Design (ACSD2004). IEEE Computer Society Press, June 2004. To appear.
• Input/output abstraction of state based systems. Eerke Boiten. Technical Report 12-04, University of Kent, Computing Laboratory, June 2004.
• Travelling salesman heuristics: Exercises in Haskell. Eerke Boiten. Technical Report 10-04, University of Kent, Computing Laboratory, June 2004.
• Turtle graphics: Exercises in Haskell. Eerke Boiten. Technical Report 11-04, University of Kent, Computing Laboratory, June 2004.
• Observing functional logic computations. Bernd Brassel, Olaf Chitil, Michael Hanus, and Frank Huch. In B. Jayaraman, editor, Proc. of the Sixth International Symposium on Practical Aspects of Declarative Languages (PADL'04), LNCS 3057, pages 193-208. Springer, June 2004.
• Special Issue on MPC 2002: Foreword. Eerke Boiten and Bernhard M"oller. Science of Computer Programming, 51(1-2):1-2, May 2004.
• Using Games to Investigate Movement for Graph Comprehension. John Bovey, Florence Benoy, and Peter Rodgers. In Advanced Visual Interfaces: AVI 2004, pages 71-79. ACM, May 2004.
• How to stop time stopping (preliminary version). Howard Bowman, Rodolfo Gomez, and Li Su. Technical Report 9-04, University of Kent, Computing Laboratory, Canterbury, Kent, CT2 7NF, UK, May 2004.
• Analysing Logic Programs by Reasoning Backwards. Jacob M. Howe, Andy King, and Lunjin Lu. In Maurice Bruynooghe and Kung-Kiu Lau, editors, Program Development in Computational Logic, volume 3049 of Lecture Notes in Computer Science, pages 152-188. Springer-Verlag, May 2004. Also see http://www.springer.de/comp/lncs/index.html.
• On the Inference of Natural Level Mappings. Jonathan C. Martin and Andy King. In Maurice Bruynooghe and Kung-Kiu Lau, editors, Program Development in Computational Logic, volume 3049 of Lecture Notes in Computer Science, pages 432-452. Springer-Verlag, May 2004. Also see http://www.springer.de/comp/lncs/index.html.
• Doctoral Symposium Proceedings, Integrated Formal Methods 2004. Eerke Boiten, John Derrick, and Graeme Smith. Technical Report 4-04, University of Kent, Computing Laboratory, April 2004.
• Integrated formal methods, 4th international conference. Eerke A. Boiten, John Derrick, and Graeme Smith, editors, volume 2999 of Lecture Notes in Computer Science. Springer-Verlag, April 2004.
• Integration of specification languages using viewpoints.. Marius C. Bujorianu. In Eerke A. Boiten, John Derrick, and Graeme Smith, editors, Integrated Formal Methods, 4th International Conference, IFM 2004, volume 2999, page 18. Springer, April 2004.
• Durative events in active databases. R. Gomez and J.C. Augusto. In ICEIS 2004, Proceedings of the 6th International Conference on Enterprise Information Systems, pages 306-311, Porto, Portugal, April 2004.
• Backward Pair Sharing Analysis. Lunjin Lu and Andy King. In Yukiyoshi Kameyama and Peter Stuckey, editors, Seventh International Symposium on Functional and Logic Programming, volume 2998 of Lecture Notes in Computer Science, pages 132-146. Springer-Verlag, April 2004. Also see http://www.springer.de/comp/lncs/index.html.
• Control Generation by Program Transformation. Jonathan C. Martin and Andy King. Technical Report 5-04, University of Kent, Computing Laboratory, University of Kent, Canterbury, CT2 7NF, March 2004.
• Drawing graphs in euler diagrams. Paul Mutton, Peter Rodgers, and Jean Flower. In Alan Blackwell, Kim Marriot, and Atsushi Shimojima, editors, Diagrams 2004, LNAI 2980, pages 66-81. Springer-Verlag, March 2004.
• Convex Hull of Planar H-Polyhedra. Axel Simon and Andy King. International Journal of Computer Mathematics, 81(4):259-271, March 2004.
• What Can Spider Diagrams Say?. Gem Stapleton, John Howse, John Taylor, and Simon Thompson. In Alan Blackwell, Kim Marriott, and Atsushi Shimojima, editors, Diagrammatic Representation and Inference, volume 2980 of Lecture Notes in Computer Science. Springer, March 2004.
• Algebraic reasoning for object-oriented programming. P. H. M. Borba, A. C. A. Sampaio, A. L. C. Cavalcanti, and M. L. Cornelio. Science of Computer Programming, January 2004. To appear.
• Behavioural Reactivity and Real Time Programming in XML: Functional Programming meets SMIL animation. Peter King, Patrick Schmitz, and Simon Thompson. In Jean-Yves Vion-Dury, editor, ACM Symposium on Document Engineering 2004, pages 57-66. ACM, January 2004.
• A Procedure to Translate PARADIGM Specifications to Propositional Linear Temporal Logic and its Application to Verification. Juan Carlos Augusto and Rodolfo Sabas Gomez. International Journal of Software Engineering and Knowledge Engineering, 13(6):627-654, December 2003.
• Forward versus Backward Verification of Logic Programs. Andy King and Lunjin Lu. In Catuscia Palamidessi, editor, International Conference on Logic Programming, volume 2916 of Lecture Notes in Computer Science, pages 315-330. Springer-Verlag, December 2003. Also see http://www.springer.de/comp/lncs/index.html.
• Design and Verification of Distributed Multi-media Systems. D.H. Akehurst, J. Derrick, and A.G. Waters. In Elie Najm, Uwe Nestmann, and Perdita Stevens, editors, FMOODS 2003 - 6th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, volume 2884 of Lecture Notes in Computer Science, pages 276-292. Springer, November 2003.
• Editorial: Special issue on Refinement. Eerke Boiten, Tim Denvir, John Derrick, and Joakim von Wright. Formal Aspects of Computing, 15(2):101-102, November 2003.
• Book review: Concepts in Programming Languages, by John Mitchell. E.A. Boiten. Journal of Functional Programming, 13(6):1087-1088, November 2003.
• Relational concurrent refinement. John Derrick and Eerke Boiten. Formal Aspects of Computing, 15(2-3):182-214, November 2003.
• An Algorithm to Translate PARADIGM specifications to PLTL. Rodolfo S. Gomez, Juan C. Augusto, and Silvia T. Acuña. In Proceedings of the 3ras. Jornadas Iberoamericanas de Ingenieria de Software e Ingenieria de Conocimiento (JIISIC'03), pages 53-63, Valdivia, Chile, November 2003.
• A high-level view of Java applications. Eric Bodden. In OOPSLA'03 ACM SIGPLAN Conference on Object-Oriented Systems, Languages and Applications (Companion), pages 384-385, Anaheim, CA, October 2003. ACM Press. Finalist in the ACM SIGPLAN Student Research Competition, 2003.
• Model Checking Stochastic Automata. J. Bryans, H. Bowman, and J. Derrick. ACM Transactions on Computational Logic, 4(4):452-492, October 2003.
• On Modular Termination Proofs. Jonathan C. Martin and Andy King. Technical Report 13-03, University of Kent, Computing Laboratory, October 2003.
• Verification of concurrent systems. Li Su. Technical Report 10-03, University of Kent, Computing Laboratory, University of Kent, Canterbury, Kent, UK, October 2003. Master thesis.
• Exploring UML refinement through unification. E.A. Boiten and M.C. Bujorianu. In J. J"urjens, B. Rumpe, R. France, and E.B. Fernandez, editors, Critical Systems Development with UML - Proceedings of the UML'03 workshop, number TUM-I0323, pages 47-62. Technische Universit"at M"unchen, September 2003.
• A relational framework for the integration of specifications. Eerke Boiten and John Derrick. Journal of Integrated Design and Process Science, 7(3):39-48, September 2003.
• Lazy assertions. Olaf Chitil, Dan McNeill, and Colin Runciman. In Draft Proceedings of the 15th International Workshop on Implementation of Functional Languages, IFL 2003, pages 31-46, Edinburgh, Scotland, September 2003.
• Discrete Timed Automata and MONA: Description, Specification and Verification of a Multimedia Stream. Rodolfo Gomez and Howard Bowman. In H Konig, M Heiner, and A Wolisz, editors, Formal Techniques for Networked and Distributed Systems - FORTE 2003. Proceedings of the 23rd IFIP WG 6.1 International Conference, number 2767 in LNCS, pages 177-192, Berlin, Germany, September 2003. Springer.
• Testing and Tracing Lazy Functional Programs using QuickCheck and Hat. Koen Claessen, Colin Runciman, Olaf Chitil, John Hughes, and Malcolm Wallace. In 4th Summer School in Advanced Functional Programming, number 2638 in LNCS, pages 59-99, Oxford, August 2003.
• A MONA-based Decision Procedure for Propositional Interval Temporal Logic. Rodolfo Gomez and Howard Bowman. Workshop of Interval Temporal Logics and Duration Calculi (part of the 15th European Summer School in Logic, Language and Information, August 2003.
• Tool support for refactoring functional programs. Huiqing Li, Claus Reinke, and Simon Thompson. In Johan Jeuring, editor, ACM SIGPLAN 2003 Haskell Workshop, pages 27-38. Association for Computing Machinery, August 2003.
• JAnalyzer, a visual static analyzer for Java. Eric Bodden. Technical Report 14-03, University of Kent, Computing Laboratory, July 2003. Submitted to the SET Awards, 2003.
• Movement as an Aid to Understanding Graphs. John Bovey, Peter Rodgers, and Florence Benoy. In Seventh International Conference on Information Visualization (IV03), pages 472-478. IEEE, July 2003.
• Structural Refinement of Systems Specified in Object-Z and CSP. John Derrick and Graeme Smith. Formal Aspects of Computing, 15(1):1 - 27, July 2003.
• Birrell's distributed reference listing revisited. Luc Moreau, Peter Dickman, and Richard Jones. Technical Report 8-03, University of Kent, Computing Laboratory, Canterbury, July 2003.
• Visualizing Weighted Edges in Graphs. Peter Rodgers and Paul Mutton. In Seventh International Conference on Information Visualization (IV03), pages 258-263. IEEE, July 2003.
• Using coupled simulations in non-atomic refinement. John Derrick and Heike Wehrheim. In D Bert, J Bowen, S King, and M Walden, editors, ZB 2003: Formal Specification and Development in Z and B, volume 2651 of Lecture Notes in Computer Science, pages 127-147. Springer, June 2003.
• Timed CSP and Object-Z. John Derrick. In D. Bert, J. Bowen, S. King, and M. Walden, editors, ZB 2003: Formal Specification and Development in Z and B, volume 2651 of Lecture Notes in Computer Science, pages 300-318. Springer, June 2003.
• Well-going programs can be typed. Stefan Kahrs. In Martin Hofmann, editor, Typed Lambda Calculi and Applications, number 2701 in LNCS, pages 167-179. Springer, June 2003.
• Development of a verified Erlang program for resource locking. Thomas Arts, Clara Benac Earle, and John Derrick. Software Tools for Technology Transfer (STTT), May 2003. To be published as a regular paper.
• Getting to the Bottom of Relational Refinement: Relations and Correctness, Partial and Total. Eerke Boiten and Willem-Paul de Roever. In R. Berghammer and B. M"oller, editors, 7th International Seminar on Relational Methods in Computer Science (RelMiCS 7), pages 82-88. University of Kiel, May 2003.
• Presentation Dynamism in XML. Partick Schmitz, Simon Thompson, and Peter King. In WWW 2003, Budapest, Hungary, May 2003. W3C. Poster presentation.
• A case study in refactoring functional programs. Simon Thompson and Claus Reinke. In Roberto Ierusalimschy, Lucilia Figueiredo, and Marcio Tulio Valente, editors, VII Brazilian Symposium on Programming Languages, pages 1-16. Sociedade Brasileira de Computacao, May 2003.
• A decision procedure and complete axiomatization of finite interval temporal logic with projection. H. Bowman and S.J. Thompson. Journal of Logic and Computation, 13(2):195-239, April 2003.
• Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. Samir Genaim and Andy King. In Pierpaolo Degano, editor, European Symposium on Programming, volume 2618 of Lecture Notes in Computer Science, pages 84-98. Springer-Verlag, April 2003. Also see http://www.springer.de/comp/lncs/index.html.
• Forward versus Backward Verification of Logic Programs. Andy King and Lunjin Lu. Technical Report 5-03, University of Kent, Computing Laboratory, University of Kent, April 2003.
• Removing GC synchronisation (extended version). Andy C. King. Technical Report 11-03, University of Kent, Computing Laboratory, April 2003. Winner (Graduate Division) ACM Student Research Competition.
• Transforming Haskell for tracing. Olaf Chitil, Colin Runciman, and Malcolm Wallace. In Ricardo Pena and Thomas Arts, editors, Implementation of Functional Languages: 14th International Workshop, IFL 2002, LNCS 2670, pages 165-181, March 2003. Madrid, Spain, 16-18 September 2002.
• Design and Verification of Distributed Multi-media Systems. D.H. Akehurst, B. Bordbar, J. Derrick, and A.G. Waters. Technical Report 1-03, University of Kent, Computing Laboratory, January 2003.
• Mexitl: Multimedia in executable interval temporal logic. H. Bowman, H. Cameron, P. King, and S.J. Thompson. Formal Methods in System Design, 22:5-38, January 2003.
• Modelling Reactive Multimedia: Events and Behaviours. Helen Cameron, Peter King, and Simon Thompson. Multimedia Tools and Applications, 19(1):53-77, January 2003.
• A Refinement Tool for Z. A.F. Freitas, C.M. Nascimento, and A.L.C. Cavalcanti. In J.S. Dong and J.C.P. Woodcock, editors, Formal Methods and Software Engineering: 5th International Conference on Formal Engineering Methods, ICFEM 2003, volume 2885 of Lecture Notes in Computer Science, pages 396 - 415. Springer-Verlag, January 2003.
• Efficient Groundness Analysis in Prolog. J. M. Howe and A. King. Theory and Practice of Logic Programming, 3(1):95-124, January 2003. (Theory and Practice of Logic Programming was formally known as The Journal of Logic Programming, see http://www.cwi.nl/projects/alp/Welcome/appeal.html).
• Three Optimisations for Sharing. J. M. Howe and A. King. Theory and Practice of Logic Programming, 3(2):243-257, January 2003. (Theory and Practice of Logic Programming was formally known as The Journal of Logic Programming, see http://www.cwi.nl/projects/alp/Welcome/appeal.html).
• Refinement of Actions in Circus. ALC Cavalcanti, ACA Sampaio, and JCP Woodcock. In Proceedings of REFINE'2002, Electronic Notes in Theoretical Computer Science, 2002. Invited Paper.
• Forward Simulation for Data Refinement of Classes. ALC Cavalcanti and D Naumann. In L Eriksson and PA Lindsay, editors, FME 2002: Formal Methods - Getting IT Right, volume 2391 of Lecture Notes in Computer Science, pages 471-490. Springer-Verlag, 2002.
• On a Specification-oriented Model for Object-orientation. ALC Cavalcanti and D Naumann. In Proceedings of the 6th Brazilian Symposium on Programming Languages, pages 114-127, 2002.
• From CPSP-OZ to Java with Processes. ALC Cavalcanti and ACA Sampaio. In Proc Workshop on Formal Methods for Parallel Programming held in conjunction with International Parallel and Distributed Processing Symp, Contained in IPDPS collects proceedings CD-ROM, 2002. IEEE CS Press. Abstract appears in IPDPS Proceedings.
• A Weakest Precondition Semantics for Circus. ALC Cavalcanti and JCP Woodcock. In Proceedings of the Communicating Processing Architectures 2002. Concurrent Systems Engineering, IOS Press, 2002. To appear.
• Refinement: Object-orientation and Concurrency. ALC Cavalcanti. In Proceedings of the 5th Brazilian Workshop on Formal Methods, 2002. To appear.
• Refactoring by Transformation. ML Cornelio, ALC Cavalcanti, and ACA Sampaio. In Proceedings of REFINE'2002, Electronic Notes in Theoretical Computer Science, 2002. Invited Paper.
• Refinement Algebra for Formal Bytecode Generation. AA Duran, ACA Sampaio, and ALC Cavalcanti. In Proceedings of the 4th International Conference on Formal Engineering Methods - ICFEM 2002. Springer-Verlag, 2002. To appear.
• JACK: A Framework for Process Algebra Implementation in Java. LJS Freitas, ACA Sampaio, and LC Cavalcanti. In Proceedings of the 16th Brazilian Symposium on Software Engineering, 2002. To appear.
• Automation of a Normal Form Reduction Strategy for Object-oriented Programming. B Oliveira, ALC Cavalcanti, and ACA Sampaio. In Proceedings of the 5th Brazilian Workshop on Formal Methods, 2002. To appear.
• Refinement in Circus. ACA Sampaio, JCP Woodcock, and ALC Cavalcanti. In L Eriksson and PA Lindsay, editors, FME 2002: Formal Methods - Getting IT Right, volume 2391 of Lecture Notes in Computer Science, pages 451-470. Springer-Verlag, 2002.
• An Action Semantics for Timed CSPm. A Sheriff, ALC Cavalcanti, and H Moura. In Proceedings of the 6th Brazilian Symposium on Programming Languages, pages 100-113, 2002.
• Two Variables per Linear Inequality as an Abstract Domain. Axel Simon, Andy King, and Jacob M. Howe. In M. Leuschel, editor, Proceedings of Logic Based Program Development and Transformation, volume 2664 of Lecture Notes in Computer Science, pages 71-89. Springer-Verlag, 2002. see http://www.springer.de./comp/lncs/index.html.
• The Semantics of Circus. JCP Woodcock and ALC Cavalcanti. In ZB 2002: Formal Specification and Development in Z and B, volume 2272 of Lecture Notes in Computer Science, pages 184-203. Springer-Verlag, 2002.
• Inconsistency and underdefinedness in z specifications. Ralph Miarka. Ph.D. Thesis, University of Kent, Canterbury, Kent CT2 7NF, UK, December 2002.
• Arcangel: a tactic language for refinement and its tool support. M. V. M. Oliveira. Master's thesis, Centro de Informatica, Universidade Federal de Pernambuco, Brazil, http://www.cin.ufpe.br, December 2002.
• A UML approach to the design of open distributed systems. Behzad Bordbar, John Derrick, and Gill Waters. In Chris George and Huaikou Miao, editors, Formal Methods and Software Engineering, volume 2495 of Lecture Notes in Computer Science, pages 561-572. Springer, November 2002.
• Removing GC synchronisation. Andy C. King. In OOPSLA'02 ACM Conference on Object-Oriented Systems, Languages and Applications (Companion)R, SIGPLAN, pages 112-113, Seattle, WA, November 2002. ACM. Winner of the ACM SIGPLAN Student Research Competition 2002.
• GCspy: An adaptable heap visualisation framework. Tony Printezis and Richard Jones. In Proceedings of OOPSLA'02 ACM Conference on Object-Oriented Systems, Languages and Applications, SIGPLAN Notices, pages 343-358, Seattle, WA., November 2002. ACM Press.
• Abstract Specification in Object-Z and CSP. Graeme Smith and John Derrick. In Chris George and Huaikou Miao, editors, Formal Methods and Software Engineering, volume 2495 of Lecture Notes in Computer Science, pages 108-119. Springer, November 2002.
• Design Support for Distributed Systems: DSE4DS. D.H. Akehurst, B. Bordbar, J. Derrick, and A.G. Waters. In J. Finney, M. Haahr, and A. Montressor, editors, Procedings of the 7th Cabernet Radicals Workshop, October 2002.
• Using UML to specify QoS constraints in ODP. Behzad Bordbar, John Derrick, and Gill Waters. Computer Networks, pages 279-304, October 2002.
• A framework for UML consistency. John Derrick, David Akehurst, and Eerke Boiten. In L. Kuzniarz, G. Reggio, J. L. Sourrouille, and Z. Huzar, editors, <<UML>> 2002 Workshop on Consistency Problems in UML-based Software Development, pages 30-45, October 2002.
• JACK: A Framework for Process Algebra Implementation in Java. Leonardo Freitas, ALC Cavalcanti, and Augusto Sampaio. In Proceedings of XVI Simpósio Brasileiro de Engenharia de Software, page 16, http://www.sbc.org.br/sbes, October 2002. Sociedade Brasileira de Computacao.
• Interactive Visual Functional Programming. Keith Hanna. In S Peyton Jones, editor, Proc. Intnl Conf. on Functional Programming, pages 100-112. ACM, October 2002.
• Functional and Declarative Programming in Education 2002. Michael Hanus, Shriram Krishnamurthy, and Simon Thompson, editors, volume 0210. Christian-Albrechts-Universitat, Kiel, October 2002.
• Computing Convex Hulls with a Linear Solver. F. Benoy, A. King, and F. Mesnard. Technical Report 11-02, University of Kent, Computing Laboratory, September 2002. This paper is under revision as it is accepted conditionally for publication in Theory and Practise of Logic Programming.
• A formal framework for viewpoint consistency. H. Bowman, M.W.A. Steen, E.A. Boiten, and J. Derrick. Formal Methods in System Design, 21(2):111-166, September 2002.
• Transforming Haskell for tracing. Olaf Chitil, Colin Runciman, and Malcolm Wallace. In Draft Proceedings of the 14th International Workshop on Implementation of Functional Languages, IFL 2002, pages 96-112, Madrid, Spain, September 2002. technical report 127-02, Departamento de Sistemas Informáticos y Programación, Universidad Complutense de Madrid.
• Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. S. Genaim and A. King. Technical Report 10-02, University of Kent, Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK., September 2002.
• Backward Type Inference Generalises Type Checking. L. Lu and A. King. In M. Hermenegildo and G. Puebla, editors, Ninth International Static Analysis Symposium, volume 2477 of Lecture Notes in Computer Science, pages 85-101. Springer-Verlag, September 2002. Also see http://www.springer.de/comp/lncs/index.html.
• Transcending Static Deployment of Circuits: Dynamic Run-Time Systems and Mobile Hardware Processes for FPGAs. Ralph Moseley. PhD thesis, Computing Laboratory, University of Kent, Canterbury, Kent, UK, September 2002.
• Analyzing String Buffers in C. A. Simon and A. King. In H. Kirchner and C. Ringeissen, editors, International Conference on Algebraic Methodology and Software Technology, volume 2422 of Lecture Notes in Computer Science, pages 365-379. Springer, September 2002. Also see http://www.springer.de/comp/lncs/index.html.
• Towards a formalization of viewpoints testing. Marius C. Bujorianu, Savi Maharaj, and Manuela Bujorianu. In Robert M. Hierons and Thierry Jéron, editors, Formal Approaches To Testing of Software 2002 (FATES'02), Research Report, 35042 Rennes, France, August 2002. INRIA. A satellite workshop of CONCUR'02.
• Demonstration of a Preprocessor for the Spring Embedder. Paul Mutton and Peter Rodgers. In GD 2002, LNCS 2528, pages 374-375, August 2002.
• Verifying Erlang code: a resource locker case-study. Thomas Arts, Clara Benac Earle, and John Derrick. In Lars-Henrik Eriksson and Peter Alexander Lindsay, editors, In Proc. Formal Methods Europe: Getting IT Right, Copenhagen, Denmark, volume 2391 of LNCS, pages 184-203. Springer-Verlag, July 2002.
• Unifying concurrent and relational refinement. Eerke Boiten and John Derrick. In John Derrick, Eerke Boiten, Jim Woodcock, and Joakim von Wright, editors, REFINE 02: The BCS FACS Refinement Workshop, volume 70(3) of Electronic Notes in Theoretical Computer Science, page 38. Elsevier Science Publishers, July 2002.
• Mathematics of program construction: Sixth international conference. Eerke A. Boiten and Bernhard M"oller, editors, volume 2386 of Lecture Notes in Computer Science. Springer, July 2002.
• REFINE 2002: The BCS FACS Refinement Workshop. John Derrick, Eerke Boiten, Jim Woodcock, and Joakim von Wright, editors, volume 70(3) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, July 2002.
• A Backward Analysis for Constraint Logic Programs. A. King and L. Lu. Theory and Practice of Logic Programming, page 32, July 2002. (Theory and Practice of Logic Programming was formally known as The Journal of Logic Programming, see http://www.cwi.nl/projects/alp/Welcome/appeal.html).
• Spring Embedder Preprocessing for WWW Visualization. Paul Mutton and Peter Rodgers. In Proceedings Information Visualization 2002. IVS, IEEE, July 2002.
• Multiform Glyph Based Search Result Visualization. Jonathan Roberts, Nadia Boukhelifa, and Peter Rodgers. In Proceeding Information Visualization 2002, pages 549-554. IVS, IEEE, July 2002.
• Beltway: Getting around garbage collection gridlock. Stephen M. Blackburn, Richard Jones, Kathryn S. McKinley, and J. Eliot B. Moss. In Laurie J. Hendren, editor, Proceedings of PLDI'02 Programming Language Design and Implementation, pages 153-164, Berlin, June 2002. ACM Press.
• Integration of specifications through development relations. Eerke Boiten and John Derrick. In H. Ehrig, B.J. Kr"amer, and A. Ertas, editors, Proceedings of IDPT: the Sixth Biennial World Conference on Integrated Design and Process Technology, page 8. SDPS, June 2002.
• Constructive potential theory: A linear logic approach. Marius Constantin Bujorianu and Manuela Luminita Bujorianu. In A. Berarducci and N.J. Cutland, editors, NS 2002 Non-standard Methods and Applications in Mathematics, page 14, Pisa, Italy, June 2002. AMS-UMI, University of Pisa. Mini-symposion "Reuniting the Antipodes II: Constructive and Nonstandard Views of the Continuum".
• Constructive potential theory: Foundations and applications.. Marius Constantin Bujorianu and Manuela Luminita Bujorianu. Research Report 06-02, University of Kent, Computing Laboratory, Canterbury CT2 7NF, Kent, UK, June 2002.
• Combining Component specifications in Object-Z and CSP. J Derrick and E Boiten. Formal Aspects of Computing, 13:111-127, May 2002.
• Integrating specifications: Development relations and correspondences. Eerke Boiten. In Hartmut Ehrig and Martin Grosse-Rhode, editors, INT'02: Integration of Software Specification Techniques, ETAPS 2002 Satellite Workshop, page 1, April 2002. Invited Lecture.
• Linear logic: from stochastic analysis to software testing. Marius Constantin Bujorianu and Manuela Luminita Bujorianu. British colloquium on theoretical computer science 18 , HP laboratories Bristol 7-10 April 2002, April 2002.
• JACK: A process algebra implementation in Java. Leonardo Freitas. Master's thesis, Centro de Informatica, Universidade Federal de Pernambuco, April 2002. http://www.cin.ufpe.br/ lf25.
• ODP computational-to-information viewpoint mappings: a translation of CORBA IDL to Z. C.N. Taylor, E.A. Boiten, and J. Derrick. IEE Proceedings Software, 149(2):57-63, April 2002.
• Correctness of Set-Sharing with Linearity. Jacob M. Howe and Andy King. Technical Report 3-02, University of Kent, Computing Laboratory, March 2002.
• GCspy: An adaptable heap visualisation framework. Tony Printezis and Richard Jones. Technical Report 5-02, University of Kent, Computing Laboratory, March 2002.
• Interpreting ODP viewpoint specifications: Observations from a Case Study. Chris Taylor, Eerke Boiten, and John Derrick. In Bart Jacobs and Arend Rensink, editors, Formal Methods for Open Object-Based Distributed Systems V, pages 61-76. Kluwer Academic Publishers, March 2002.
• Analyzing String Buffers in C. Axel Simon and Andy King. Technical Report 2-02, University of Kent, Computing Laboratory, February 2002.
• Loose specification and refinement in Z. Eerke Boiten. In D. Bert, J.P. Bowen, M.C. Henson, and K. Robinson, editors, ZB 2002: Formal Specification and Development in Z and B, volume 2272 of Lecture Notes in Computer Science, pages 226-241, Grenoble, France, January 2002. Springer.
• Handling inconsistencies in z using quasi-classical logic. Ralph Miarka, John Derrick, and Eerke Boiten. In Didier Bert, Jonathan P. Bowen, Martin C. Henson, and Ken Robinson, editors, ZB2002: Formal Specification and Development in Z and B / Second International Conference of B and Z Users, volume 2272 of Lecture Notes in Computer Science, pages 204-225, Grenoble, France, January 2002. Springer-Verlag Berlin Heidelberg.
• Class Refinement for Sequential Java. ALC Cavalcanti and DA Naumann. In ECOOP 2001 Workshop on Formal Techniques for Java Programs, 2001.
• Formal Bytecode Generation for a ROOL Virtual Machine. A Duran, ACA Sampaio, and ALC Cavalcanti. In 4th Brazilian Workshop on Formal Methods, 2001.
• Animating CSP(M) Using Action Semantics. L Freitas, ALC Cavalcanti, and H Moura. In 4th Brazilian Workshop on Formal Methods, 2001.
• A Concurrent Language for Refinement. JCP Woodcock and ALC Cavalcanti. In 5th Irish Workshop on Formal Methods, 2001.
• The Steam Boiler in a Unified Theory of Z and CSP. JCP Woodcock and ALC Cavalcanti. In 8th Asia-Pacific Software Engineering Conference. IEEE Press, 2001.
• Efficient Groundness Analysis in Prolog. J. M. Howe and A. King. Technical Report 15-01, University of Kent, Computing Laboratory, December 2001. To appear in Theory and Practice of Logic Programming.
• A Backward Analysis for Constraint Logic Programs. A. King and L. Lu. Technical Report 4-01, University of Kent, Computing Laboratory, University of Kent at Canterbury, Kent, CT2 7NF, UK, December 2001. To appear in Theory and Practice of Logic Programming.
• Positive Boolean Functions as Multiheaded Clauses. J. M. Howe and A. King. In P Codognet, editor, International Conference on Logic Programming, Lecture Notes in Computer Science 2237, pages 120-134. Springer-Verlag, November 2001. see http://www.springer.de./comp/lncs/index.html.
• Animating CSPm using Action Semantics. Leonardo Freitas, ALC Cavalcanti, and Hermano Moura. In Proceedings of IV Workshop em Metodos Formais, page 12. Sociedade Brasileira de Computacao, October 2001. http://www.cin.ufpe.br/ lfsf.
• Refactoring Functional Programs. Simon Thompson and Claus Reinke. Technical Report 16-01, University of Kent, Computing Laboratory, October 2001.
• Computational modelling of distributed executive control. H. Bowman and P.J. Barnard. technical report 12-01, University of Kent, Computing Laboratory, Canterbury, Kent, UK, September 2001.
• Formal methods for distributed processing, a survey of object-oriented approaches. H. Bowman and J. Derrick, editors. Cambridge University Press, Cambridge, UK, September 2001.
• Issues in formal methods (chapter 3). H. Bowman and J. Derrick. In H. Bowman and J. Derrick, editors, Formal Methods for Distributed Processing, A Survey of Object-oriented Approaches, pages 18-35. Cambridge University Press, Cambridge, UK, September 2001.
• Viewpoints modelling. H. Bowman and J. Derrick. In H. Bowman and J. Derrick, editors, Formal Methods for Distributed Processing, A Survey of Object-oriented Approaches, pages 451-475. Cambridge University Press, Cambridge, UK, September 2001.
• On the Hilbert Machines Quantitative Computational Model. Marius C. Bujorianu and Manuela L. Bujorianu. In Firenze University, editor, QAPL'01 Workshop on Quantitative Aspects of Programming Laguages. ACM, September 2001.
• Compositional explanation of types and algorithmic debugging of type errors. Olaf Chitil. In Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP'01), pages 193-204, Firenze, Italy, September 2001. ACM.
• Pretty printing with lazy dequeues. Olaf Chitil. In Ralf Hinze, editor, Preliminary Proceedings of the 2001 ACM SIGPLAN Haskell Workshop, pages 183-201, Firenze, Italy, September 2001. Universiteit Utrecht UU-CS-2001-23. Final Proceedings to appear in ENTCS 59(2).
• A semantics for tracing. Olaf Chitil. In Thomas Arts and Markus Mohnen, editors, Draft Proceedings of the 13th International Workshop on Implementation of Functional Languages, IFL 2001, pages 249-254, Älvsjö, Sweden, September 2001. Ericsson Computer Science Laboratory.
• GHood - Graphical Visualisation and Animation of Haskell Object Observations. Claus Reinke. In Ralf Hinze, editor, ACM SIGPLAN Haskell Workshop, Firenze, Italy, volume 59 of Electronic Notes in Theoretical Computer Science, page 29. Elsevier Science, September 2001. Preliminary Proceedings have appeared as Technical Report UU-CS-2001-23, Institute of Information and Computing Sciences, Utrecht University. Final proceedings to appear in ENTCS.
• Interpreting ODP Viewpoint Specification: Observations from a Case Study. C Taylor, E Boiten, and J Derrick. Technical Report 9-01, University of Kent, Computing Laboratory, University of Kent at Canterbury, UK, September 2001.
• Multiple-view tracing for Haskell: a new Hat. Malcolm Wallace, Olaf Chitil, Thorsten Brehm, and Colin Runciman. In Ralf Hinze, editor, Preliminary Proceedings of the 2001 ACM SIGPLAN Haskell Workshop, pages 151-170, Firenze, Italy, September 2001. Universiteit Utrecht UU-CS-2001-23. Final proceedings to appear in ENTCS 59(2).
• Time and action lock freedom properties of timed automata. Howard Bowman. In M. Kim, B. Chin, S. Kang, and D. Lee, editors, Formal Techniques for Networked and Distributed Systems, pages 119-134. Kluwer Academic Publishers, August 2001.
• Visual tools for natural language processing. R. Gaizauskas, P.J. Rodgers, and K. Humphreys. Journal of Visual Languages & Computing, 12(4):375-412, August 2001.
• Three Optimisations for Sharing. Jacob Howe and Andy King. Technical Report 11-01, University of Kent, Computing Laboratory, University of Kent at Canterbury, August 2001. Accepted to appear in Theory and Practice of Logic Programming subject minor corrections.
• Proof Search in Lax Logic. Jacob M. Howe. Mathematical Structures in Computer Science, 11(4):573-588, August 2001.
• Logics, viewpoints and tests: Towards a trinity. Marius C. Bujorianu and Manuela L. Bujorianu. NATO ASI Doctoral Symposium, in conjunction with Proof and System Reliability, International Summer School), July 2001.
• Red-black trees with types. Stefan Kahrs. Journal of Functional Programming, 11(4):425-432, July 2001.
• Verifying termination and error-freedom of logic programs with block declarations. Jan-Georg Smaus, Pat M. Hill, and Andy King. Theory and Practice of Logic Programming, 1(4):447-486, July 2001. (Theory and Practice of Logic Programming was formally known as The Journal of Logic Programming, see http://www.cwi.nl/projects/alp/Welcome/appeal.html.
• Formal Methods Elsewhere. Howard Bowman, editor, volume 43 of Electronic Notes in Theoretical Computer Science. Elsevier Science, June 2001. A Satellite Workshop of FORTE-PSTV-2000 devoted to applications of formal methods to areas other than communication protocols and software engineering.
• Order theoretic topologies and hybrid systems. Marius C. Bujorianu and Manuela L. Bujorianu. In University of Hull, editor, 5th Galway Colloquium on General Topology. LMS, University of Hull, June 2001.
• Iguana: A management support tool using Haskell and LDAP. Chris Ryder. Technical Report 6-01, University of Kent, Computing Laboratory, University of Kent at Canterbury, June 2001.
• Refinement in z and object-z: Foundations and advanced applications. John Derrick and Eerke Boiten. Formal Approaches to Computing and Information Technology. Springer, May 2001.
• Widening BDDs. Jacob M. Howe and Andy King. Technical Report 5-01, University of Kent, Computing Laboratory, May 2001.
• Specification, refinement and verification of concurrent systems - an integration of Object-Z and CSP. G. Smith and J. Derrick. Formal Methods in Systems Design, 18:249-284, May 2001.
• Analysis of a multimedia stream using stochastic process algebra. H. Bowman, J.W. Bryans, and J. Derrick. The Computer Journal, 44(4):230-245, April 2001.
• Constructive foundations of stochastic analysis in linear logic. Manuela L. Bujorianu and Marius C. Bujorianu. In EATCS Bulletin, editor, BCTCS 17 British Colloquium for Theoretical Computer Science, volume 74. EATCS, April 2001.
• An abstract domain for probabilistic hybrid systems. Marius C. Bujorianu and Manuela L. Bujorianu. BULLETIN of the European Association for Theoretical Computer Science EATCS, N. 74, June 2001, April 2001.
• Freja, Hat and Hood - a comparative evaluation of three systems for tracing and debugging lazy functional programs. Olaf Chitil, Colin Runciman, and Malcolm Wallace. In Markus Mohnen and Pieter Koopman, editors, Proceedings of the 12th International Workshop on Implementation of Functional Languages (IFL 2000), LNCS 2011, pages 176-193, Aachen, Germany, March 2001. Springer.
• Analysing Failure Behaviours in Component Interaction. R de Lemos. Technical Report 2-01, University of Kent, Computing Laboratory, University of Kent at Canterbury, March 2001.
• Describing Evolving Dependable Systems using Co-operative Software Architectures. R de Lemos. Technical Report 1-01, University of Kent, Computing Laboratory, University of Kent at Canterbury, March 2001.
• Author Obliged to Submit Paper before 4 July: Policies in an Enterprise Specification. James Cole, John Derrick, Zoran Milosevic, and Kerry Raymond. In Morris Sloman, Jorge Lobo, and Emil Lupu, editors, Policies for Distributed Systems and Networks, volume 1995 of Lecture Notes in Computer Science, pages 1-17. Springer-Verlag, January 2001.
• Animating Object Oriented Conceptual Models. Ian Oliver. PhD thesis, Computing Laboratory, University of Kent, Canterbury, Kent, UK, January 2001.
• FAD: A Functional Analysis and Design Methodology. Dan Russell. Phd thesis, Computing Laboratory, University of Kent at Canterbury, January 2001.
• Verifying termination and error-freedom of logic programs with block declarations. Jan-Georg Smaus, Patricia Hill, and Andy King. Theory and Practise of Logic Programming, January 2001.
• Logic and Dependent Types in the Aldor Computer Algebra System. Simon Thompson. In Manfred Kerber and Michael Kohlhase, editors, Symbolic Computation and Automated Reasoning, pages 205-219. A K Peters, January 2001.
• Simulation and Class Refinement for Java. ALC Cavalcanti and DA Naumann. In S Drossopoulou and S Eisenback et al, editors, ECOOP 2000 Workshop on Formal Techniques for Java Programs, Technical Report 269. Fernuniversitat Hagen, 2000.
• Type-Inference Based Short Cut Deforestation (nearly) without Inlining. Olaf Chitil. In Chris Clack and Pieter Koopman, editors, Proceedings of 11th International Workshop on Implementation of Functional Languages (1999), number 1868 in LNCS, pages 19-36, Netherlands, 2000. Springer.
• A Framework for Defining Object-oriented Languages using Action Semantics. LCS Meneses, S Soares, JB Meneses, H Moura, and ALC Cavalcanti. In 4th Brazilian Symposium on Programming Languages, pages 172-185, 2000.
• Tactics of Refinement. M Oliveira and ALC Cavalcanti. In 14th Brazilian Symposium on Software Engineering, pages 117-132, 2000.
• A Demonstration of the Grrr Graph Rewriting Programming Language. Peter Rodgers and Natalia Vidal. In Agtive99: Applications of Graph Transformations with Industrial Relevance, LNCS, pages 473-480. Springer-Verlag, 2000.
• Graph Algorithm Animation with Grrr. Peter J. Rodgers and Natalia Vidal. In Agtive99: Applications of Graph Transformations with Industrial Relevance, LNCS, pages 379-394. Springer-Verlag, 2000.
• A Manual for a ModelChecker for Stochastic Automata. David Akehurst, Howard Bowman, Jeremy Bryans, and John Derrick. Technical Report 9-00, Computing Laboratory, University of Kent, December 2000.
• Hybrid Sliding Mode Control for a Set of Interconnected Nonlinear. L. Giacomini, B. Bordbar, and D. J. Holding. In 39th IEEE Conference on Decision and Control, Sydney Convention & Exhibition Centre, December 2000. To appear.
• Editorial: Special Issue on specification-based testing. Robert Hierons and John Derrick. Software Testing, Verification and Reliability, 10(4):201-202, December 2000.
• FAD: A Functional Analysis and Design Methodology. Daniel Russell. PhD thesis, Computing Laboratory, University of Kent, Canterbury, Kent, UK, December 2000.
• Towards stochastic model checking with generalised distributions. H. Bowman, J.W. Bryans, and J. Derrick. In UKPEW 2000, 16th United Kingdom Performance Engineering Workshop, November 2000.
• Behavioural subtyping in process algebra. Charles Peter Briscoe-Smith. PhD thesis, University of Kent at Canterbury, Canterbury, UK, November 2000.
• Specification and analysis of automata-based designs. Jeremy Bryans, Lynne Blair, Howard Bowman, and John Derrick. In W. Grieskamp, T. Stanten, and B. Stoddart, editors, Integrated Formal Methods (IFM 2000), volume 1945 of Lecture Notes in Comuter Science, pages 176-193. Springer, November 2000.
• Structural refinement in Object-Z / CSP. John Derrick and Graeme Smith. In W. Grieskamp, T. Stanten, and B. Stoddart, editors, Integrated Formal Methods (IFM 2000), volume 1945 of Lecture Notes in Computer Science, pages 194-213. Springer, November 2000.
• Pair-sharing over rational trees. Andy King. Journal of Logic Programming, 46(1-2):139-155, November 2000.
• Towards integrated cognitive and interface analysis. H. Bowman, G. Faconti, and M. Massink. In Howard Bowman, editor, Proceedings of Formal Methods Elsewhere 2000, Pisa, Italy, volume 43 of Electronic Notes in Theoretical Computer Science, page 16. Elsevier Science, October 2000. Available at http://www.elsevier.nl/gej-ng/31/29/23/72/23/show/Products/notes/index.htt.
• Type-inference based deforestation of functional programs. Olaf Chitil. PhD thesis, RWTH Aachen, October 2000.
• Recursive functions and reactive behaviours: The essence of fran. Anthony C. Daniels. October 2000.
• A single complete refinement rule for Z. J. Derrick. Logic and Computation, 10(5):663-675, October 2000.
• Introduction to memory management and garbage collection. Richard Jones and Eric Jul, October 2000. Tutorial 70, OOPSLA 2000 Conference on Object-Oriented Programming, Systems, Languages and Applications, Minneapolis.
• Tactics of refinement. M. V. M. Oliveira and A. L. C. Cavalcanti. In 14th Brazilian Symposium on Software Engineering, pages 117-132, October 2000.
• Hybrid Control Systems: a Design Case Study. B. Bordbar, L. Giacomini, and D. J. Holding. In IEEE CCA/CACSD, Alaska, USA, September 2000.
• UML and Petri Nets for Design and Analysis of Distributed Systems. B. Bordbar, L. Giacomini, and D. J. Holding. In IEEE CCA/CACSD, Alaska, USA, September 2000.
• Tracing and Debugging of Lazy Functional Programs - A Comparative Evaluation of Three Systems. Olaf Chitil, Colin Runciman, and Malcolm Wallace. In Markus Mohnen and Pieter Koopman, editors, Draft Proceedings of the 12th International Workshop on Implementation of Functional Languages, pages 47-62, Aachen, Germany, September 2000. Aachener Informatik-Bericht 00-7, RWTH Aachen.
• Refinement of objects and operations in Object-Z. John Derrick and Eerke Boiten. In Scott F. Smith and Carolyn L. Talcott, editors, Formal Methods for Open Object-based Distributed Systems IV, pages 257-277. Kluwer Academic Publishers, September 2000.
• A Simple Polynomial Groundness Analysis for Logic Programs. A. Heaton, M. Abo-Zaed, M. Codish, and A. King. Journal of Logic Programming, 45:143-156, September 2000.
• Memeory management session overview. Richard Jones. In Graham N.C. Kirby, Alan Dearle, and Dag I.K. Sjoberg, editors, Persistent Object Systems: Design, Implementation, and Use, volume 2135 of Lecture Notes in Computer Science, pages 84-86, Lillehammer, Norway, September 2000. Springer.
• An XML Specification for Grrr Programs. Peter Rodgers. In University of Paderborn GT Exchange Formats, page 7, September 2000.
• Typeview: A Tool for Understanding Type Errors. Axel Simon, Olaf Chitil, and Frank Huch. In Markus Mohnen and Pieter Koopman, editors, Draft Proceedings of the 12th International Workshop on Implementation of Functional Languages, pages 63-69, Aachen, Germany, September 2000. Aachener Informatik-Bericht 00-7, RWTH Aachen.
• Mode Analysis Domains for Typed Logic Programs. Jan-Georg Smaus, Pat Hill, and Andy King. In A Bossi, editor, Logic Programming, Synthesis and Transformation (Selected Papers), volume 1817 of Lecture Notes in Computer Science, pages 82-101, September 2000. Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.
• ODP Enterprise Viewpoint Specification. M.W.A. Steen and J. Derrick. Computer Standards and Interfaces, 22:165-189, September 2000.
• A Case Study in Partial Specification: Consistency and Refinement for Object-Z. Chris Taylor, John Derrick, and Eerke Boiten. In Proc. of ICFEM 2000, pages 177-185. IEEE, September 2000.
• A Semantics of Simultaneous Events (SSE) for State-Based Formal Specification. Chris Taylor and David Till. Formal Aspects of Computing, September 2000. (Submitted to journal, currently being refereed.).
• Viewpoint consistency in ODP. E.A. Boiten, H. Bowman, J. Derrick, P.F. Linington, and M.W.A. Steen. Computer Networks, 34(3):503-537, August 2000.
• Verification of a Hybrid Model of a Manufacturing System using Rectangular Petri Nets. B. Bordbar, L. Giacomini, and D. J. Holding. In Proceedings of the 6th International Workshop on Discrete Event Systems, Ghent, Belgium, August 2000. To appear.
• A Weakest Precondition Semantics for Refinement of Object-oriented Programs. ALC Cavalcanti and DA Naumann. IEEE Transactions on Software Engineering, 26(8):713-728, August 2000.
• Guards, Preconditions, and Refinement in Z. Ralph Miarka, Eerke Boiten, and John Derrick. In Jonathan P. Bowen, Steve Dunne, Andy Galloway, and Steve King, editors, ZB2000: Formal Specification and Development in Z and B / First International Conference of B and Z Users, volume 1878 of Lecture Notes in Computer Science, pages 286-303. Springer-Verlag Berlin, August 2000.
• Liberating data refinement. E.A. Boiten and J. Derrick. In R.C. Backhouse and J.N. Oliveira, editors, Mathematics of Program Construction, 5th International Conference, Ponte de Lima, volume 1837 of Lecture Notes in Computer Science, pages 144-166. Springer, July 2000.
• Guest editors introduction: Formal methods for object oriented distributed systems. H Bowman, J Derrick, and E Brinksma. IEEE Transactions on Software Engineering, 26(7):577-578, July 2000.
• Deforestation of Functional Programs through Type Inference. Olaf Chitil. In Wolfgang Goerigk, editor, 17 Workshops der GI-Fachgruppe 2.1.4. Programmiersprachen und Rechenkonzepte mit Schwerpunkt Softwarecomponenten, pages 121-130. Bad Honnef, Bericht Nr. 2007 des Instituts fur Informatik und Praktische Mathematik der Christian-Albrechts-Universitat zu Kiel, July 2000.
• Abstracting Numeric Constraints with Boolean Functions. J. M. Howe and A. King. Information Processing Letters, 75(1-2):17-23, July 2000.
• Design of Distributed Manufacturing Systems using UML and Petri Nets. B. Bordbar, L. Giacomini, and D. J. Holding. In Proceedings of 6th International Federation of Automatic Control (IFAC), Workshop on Algorithms and Architectures for Real-Time Control, pages 91-96, Palma de Mallorca, Spain, May 2000.
• Review of Ambainis A. et al, `Ordinal mind change complexity of language identification'. P. Watson. Mathematical Reviews, (2000e:68079), May 2000.
• Review of Case J., `The power of vacillation in language learning'. P. Watson. Mathematical Reviews, (2000e:68081), May 2000.
• A UML-based Approach to the Modelling and Supervisory Control of Manufacturing Machinery. B. Bordbar, L. Giacomini, and D. J. Holding. In IEE Control Seminars on Model Validation for Plant Control and Condition Monitoring, pages 31-33, London, March 2000.
• Reasoning About Analog-Level Implementations of Digital Systems. Keith Hanna. Formal Methods in System Design, 16(2):123-158, March 2000.
• Abstract Domains for Universal and Existential Properties. A. Heaton, P. Hill, and A. King. In G. Smolka, editor, European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 150-164. Springer-Verlag, March 2000. see http://www.springer.de./comp/lncs/index.html.
• Implementing Groundness Analysis with Definite Boolean Functions. J. M. Howe and A. King. In G. Smolka, editor, European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 200-214. Springer-Verlag, March 2000. Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.
• Specialising Finite Domain Programs using Polyhedra. J.M. Howe and A. King. In A. Bossi, editor, Logic Programming, Synthesis and Transformation (Selected Papers), volume 1817 of Lecture Notes in Computer Science, pages 118-135. Springer-Verlag, March 2000. Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.
• Integrating Computer Algebra and Reasoning through the Type System of Aldor. Erik Poll and Simon Thompson. In Helene Kirchner and Christophe Ringeissen, editors, Frontiers of Combining Systems: Frocos 2000, volume 1794 of Lecture Notes in Computer Science, pages 136-150. Springer, March 2000.
• Constructs for Programming with Graph Rewrites. Peter Rodgers. In H Ehrig and G Taentzer, editors, GRATRA 2000: Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems, pages 59-66, March 2000.
• Comparison of ODP Viewpoint Specifications: A Case Study. Chris Taylor. Technical Report 7-00, University of Kent, March 2000.
• The set of idempotents in the weakly almost periodic compactification of the integers is not closed. B. Bordbar and J. S. Pym. Trans Amer Math Soc, (2):823-842, February 2000. (Featured Review in Mathematical Reviews 2000 c43007).
• A hierarchy of languages with strong termination properties. Alastair Telford and David Turner. Technical Report TR 2-00, Computing Lab, University of Kent at Canterbury, The Computing Laboratory, The University, Canterbury, Kent, CT2 7NF, February 2000. Paper currently under revision.
• Review of Schaefer M., `A guided tour of minimal indices and shortest descriptions'. P. Watson. Mathematical Reviews, (2000b:03156), February 2000.
• A Complete Axiomatization of Interval Temporal Logic with Projection. Howard Bowman and Simon Thompson. Technical Report 6-00, Computing Laboratory, University of Kent, January 2000.
• A model checking algorithm for stochastic systems. Jeremy Bryans, Howard Bowman, and John Derrick. Technical Report 4-00, University of Kent at Canterbury, Canterbury, Kent, January 2000.
• Abstracting Builtins for Groundness Analysis. A. Heaton and A. King. Technical Report 3-00, University of Kent at Canterbury, Computing Laboratory, January 2000.
• Mode analysis domains for typed logic programs. J.-G. Smaus, P. Hill, and A. King. In A. Bossi, editor, LOPSTR. Springer-Verlag, January 2000.
• Regular Expressions and Automata using Haskell. Simon Thompson. Technical Report 5-00, Computing Laboratory, University of Kent, January 2000.
• Review of Aizenstein, H. et al, `On learning read-k-satisfy-j DNF'. P. Watson. Mathematical Reviews, (2000a:68060), January 2000.
• An Inconsistency in Procedures, Parameters and Substitution in the Refinement Calculus. ALC Cavalcanti, A Sampaio, and JCP Woodcock. Science of Computer Programming, 33(1):87-96, 1999.
• A Weakest Precondition Semantics for an Object-oriented Language of Refinement. ALC Cavalcanti and D Naumann. In FM'99: World Congress on Formal Methods, volume 1709 of Lecture Notes in Computer Science, pages 1439-1459. Springer-Verlag, 1999.
• ZRC - A Refinement Calculus for Z. ALC Cavalcanti and JCP Woodcock. Formal Aspects of Computing, 10:267-289, 1999.
• Denotational Semantics for Teaching Lazy Functional Programming. Olaf Chitil. In Proceedings of the Workshop on Functional and Declarative Programming in Education, Technical Report TR99-346, page 27. Rice University Compter Science, 1999.
• Type-inference based short cut deforestation (nearly) without inlining. Olaf Chitil. In Chris Clack and Pieter Koopman, editors, Draft Proceedings of the 11th International Workshop on Implementation of Functional Languages, pages 17-32, 1999. Lochem, Netherlands, September 7th-10th 1999.
• Type Inference Builds a Short Cut to Deforestation. Olaf Chitil. In Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming (ICFP '99), pages 249-260. ACM Sigplan Notices, 34(9), 1999.
• A Tool for Teaching Refinement. SL Coutinho, TPC Reis, and ALC Cavalcanti. In 13th Brazilian Symposium on Software Engineering - Tools Session, pages 61-64, 1999. (In Portuguese).
• Cyber Rally: An Experience of Democratic Use of the Internet. G Ramalho, F Barros, S Cavalcante, and ALC Cavalcanti. In Human-Computer Interaction: Communication, Cooperation, and Application Design, volume 2, pages 402-406. Lawrence Erlbaum Associates, 1999.
• A formal framework for viewpoint consistency (full version). H. Bowman, M.W.A. Steen, E.A. Boiten, and J. Derrick. Computing Laboratory Technical Report 22-99, University of Kent at Canterbury, Canterbury, Kent, CT2 7NZ, December 1999.
• On time and action lock free description of timed systems. H. Bowman. Technical Report 16-99, Computing Laboratory, University of Kent at Canterbury, December 1999.
• A semantics for functions and behaviours. Anthony C. Daniels. PhD thesis, The University of Nottingham, The University of Nottingham, , University Park, Nottingham NG7 2RD, December 1999.
• Modes and Types in Logic Programming. Jan-Georg Smaus. PhD thesis, University of Kent at Canterbury, December 1999.
• Inductive Learning with Corroboration. P. Watson. In O. Watanabe and T. Yokomori, editors, Algorithmic Learning Theory, Proceedings of the 10th International Conference, volume 1720 of Lecture Notes in Artificial Intelligence, pages 145-156. Springer Verlag, December 1999.
• Book Review in Mathematical Reviews. Phil Watson. Jain S and Sharma A, Generalization and specialization strategies for learning r.e. languages, (99m:68167), December 1999.
• Book Review in Mathematical Reviews. Phil Watson. Jain S, Learning with refutation, (99m:68166), December 1999.
• Analysing cognitive behaviour using lotos and mexitl. H. Bowman and G. Faconti. Formal Aspects of Computing, 11:132-159, November 1999.
• A Semantic Basis for Specialising Domain Constraints. J. M. Howe and A. King. Technical Report 21-99, University of Kent, Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK, November 1999. Presented at the International Workshop for Object-oriented and Constraint Programming for Time Critical Applications, Lisbon, Portugal.
• Garbage collection. Richard Jones and Eric Jul. ACM SIGPLAN, November 1999. Tutorial 28, OOPSLA'99 Conference on Object-Oriented Programming, Systems, Languages and Applications, Denver.
• Proving termination of input-consuming logic programs. Jan-Georg Smaus. In Danny De Schreye, editor, Proceedings for the International Conference on Logic Programming 1999, page 15. MIT Press, November 1999.
• Proof. Simon Thompson. In Kevin Hammond and Greg Michaelson, editors, Research Directions in Parallel Functional Programming, pages 93-119. Springer Verlag, November 1999.
• Book Review in Mathematical Reviews. Phil Watson. Jain S and Sharma A, The structure of intrinsic complexity of learning, (99k:03035), November 1999.
• Computing with Exact Real Numbers in a Radix-r System. Kaganovsky Alexander. Technical Report 19-99, Computing Laboratory, University of Kent at Canterbury, October 1999.
• Modelling concurrent cognitive architectures using process calculi. H. Bowman. In Sebastiano Bagnara, editor, European Conference on Cognitive Science 1999, pages 161-166. Istituto di Psicologia, CNR, October 1999.
• Aldor meets Haskell. Chris Ryder and Simon Thompson. Technical Report 15-99, Computing Laboratory, University of Kent, October 1999.
• Constructive consistency checking for partial specification in Z. E.A. Boiten, J. Derrick, H. Bowman, and M.W.A. Steen. Science of Computer Programming, 35(1):29-75, September 1999.
• Non-atomic refinement in Z. J. Derrick and E.A. Boiten. In J.M. Wing, J.C.P. Woodcock, and J. Davies, editors, FM'99 World Congress on Formal Methods in the Development of Computing Systems, volume 1708 of Lecture Notes in Computer Science, pages 1477-1496, Berlin, September 1999. Springer.
• Pragmatic graph rewriting modifications. Peter J. Rodgers and Natalia Vidal. In Proceedings of the 1999 IEEE Symposium on Visual Languages, pages 206-207. IEEE Computer Society, September 1999.
• Proving Termination of Input-Consuming Logic Programs. Jan-Georg Smaus. Technical Report 10-99, Computing Laboratory, University of Kent at Canterbury, Kent, CT2 7NF, UK, September 1999. Long version of paper with same title at ICLP'99.
• Formalising ODP Enterprise Policies. M. W. A. Steen and J. Derrick. In 3rd International Enterprise Distributed Object Computing Conference (EDOC '99), University of Mannheim, Germany, September 1999. IEEE Publishing.
• Viewpoints and consistency: translating LOTOS to Object-Z. John Derrick, Eerke Boiten, Howard Bowman, and Maarten Steen. Computer Standards and Interfaces, 21:251-272, August 1999.
• Proceedings of the 1999 Workshop on Functional and Declarative Programming in Education. Matthias Felleisen, Michael Hanus, and Simon Thompson. Technical Report COMP TR99-346, Department of Computer Science, Rice University, August 1999.
• Stochastic specification and verification. Jeremy Bryans and John Derrick. In 3rd Irish Workshop in Formal Methods, Electronic Workshops in Computing, page 20. Springer, July 1999.
• Calculating upward and downward simulations of state-based specifications. John Derrick and Eerke Boiten. Information and Software Technology, 41:917-923, July 1999.
• Separating component and context specification using promotion. John Derrick and Eerke Boiten. In K. Araki, A. Galloway, and K. Taguchi, editors, International conference on Integrated Formal Methods 1999 (IFM'99), pages 293-312. Springer, July 1999.
• Testing refinements of state-based formal specifications. John Derrick and Eerke Boiten. Software Testing, Verification and Reliability, (9):27-50, July 1999.
• Proof Search in Lax Logic. Jacob M. Howe. Technical Report 14-99, University of Kent, July 1999.
• Exact Complex Arithmetic in an Imaginary Radix System. Alexander Kaganovsky. Technical Report 9-99, Computing Laboratory, University of Kent at Canterbury, July 1999.
• The Type System of Aldor. Erik Poll and Simon Thompson. Technical Report 11-99, Computing Laboratory, University of Kent at Canterbury, Kent CT2 7NF, UK, July 1999.
• Book Review in Mathematical Reviews. Phil Watson. Moser WR, Approximation methods in inductive inference, (99g:68174), July 1999.
• Book Review in Mathematical Reviews. Phil Watson. Stephan F, Learning via queries and oracles, (99f:03056), June 1999.
• Modelling timeouts without timelocks. Howard Bowman. In ARTS'99, 5th International AMAST Workshop on Real-time and Probabilistic Systems, volume 1601 of Lecture Notes in Computer Science, pages 334-354. Springer-Verlag, May 1999.
• Applying the UML to the ODP enterprise viewpoint. M.W.A. Steen and J. Derrick. Technical Report 8-99, Computing Laboratory, University of Kent at Canterbury, May 1999.
• Inductive learning with corroboration. P. Watson. Technical Report 6-99, Computing Laboratory, UKC, May 1999.
• Strategies for consistency checking based on unification. H. Bowman, E. A. Boiten, J. Derrick, and M. W. A. Steen. Science of Computer Programming, 33:261-298, April 1999.
• Quotienting Share for Dependency Analysis. Andy King, Jan-Georg Smaus, and Pat Hill. In Doaitse Swierstra, editor, European Symposium on Programming, volume 1576 of Lecture Notes in Computer Science, pages 59-73. Springer-Verlag, April 1999. (c) Springer-Verlag, see also http://www.springer.de/comp/lncs/index.html.
• A logic for abstract data types as existential types. Erik Poll and Jan Zwanenburg. In Typed Lambda Calculi and Applications (TLCA'99), LNCS. Spinger-Verlag, April 1999.
• Distance: a New Metric for Controlling Granularity for Parallel Execution. Kish Shen, V'itor Santos Costa, and Andy King. Journal of Functional and Logic Programming, April 1999.
• Ensuring Termination in ESFP. A. J. Telford and D. A. Turner. In 15th British Colloquium in Theoretical Computer Science, page 14, Keele, April 1999.
• An Isomorphism between Abstract Polyhedral Cones and Definite Boolean Functions. F. Benoy and A. King. Technical Report 3-99, Computing Laboratory, University of Kent, March 1999.
• Implementing Theorem Provers in a Purely Functional Style. Keith Hanna. Journal of Functional Programming, 9(2):147-166, March 1999.
• Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations. Jan-Georg Smaus, Pat Hill, and Andy King. In P Flener, editor, Logic Programming, Synthesis and Transformation (Selected Papers), volume 1559 of Lecture Notes in Computer Science, pages 289-307. Springer-Verlag, March 1999. Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.
• Haskell: the Craft of Functional Programming. Simon Thompson. International Computer Science Series. Addison-Wesley, Harlow, UK, second edition, March 1999. More details at <a href="http://www.cs.ukc.ac.uk/people/staff/sjt/craft2e">the home page for the book</a>.
• Book Review in Mathematical Reviews. Phil Watson. Fortnow L et al, On the relative sizes of learable sets, (99c:68210), March 1999.
• On the Readability of Machine Checkable Formal Proofs. Vincent Zammit. PhD thesis, University of Kent, March 1999.
• A junction between state based and behavioural specification. H. Bowman and J. Derrick. In A. Fantechi P. Ciancarini and R. Gorrieri, editors, Formal Methods for Open Object-based Distributed Systems, pages 213-239. Kluwer, February 1999. Invited Paper.
• Specialising Finite Domain Programs using Polyhedra (Abstract). J. M. Howe and A. King. In ECOOP Workshops, volume 1743 of Lecture Notes in Computer Science, pages 258-9. Springer-Verlag, February 1999.
• Towards integrated cognitive and interface analysis. H. Bowman, G. Faconti, and M. Massink. Technical Report 1-99, University of Kent at Canterbury, January 1999.
• Fran poster. Anthony C. Daniels. An A1 sized poster describing Fran, January 1999.
• Consistency of partial process specifications. Maarten Steen, John Derrick, Eerke Boiten, and Howard Bowman. In Armando Haeberer, editor, AMAST'98, page 15. Springer Verlag, January 1999.
• Procedures and Recursion in the Refinement Calculus. ALC Cavalcanti, A Sampaio, and JCP Woodcock. Journal of the Brazilian Computer Society, 5(1):1-15, 1998.
• A Weakest Precondition Semantics for Z. AC Cavalcanti and JCP Woodcock. The Computer Journal, 41(1):1-15, 1998.
• Common Subexpressions are Uncommon in Lazy Functional Languages. Olaf Chitil. In Chris Clack, Tony Davie, and Kevin Hammond, editors, Proceedings of the 9th International Workshop on Implementation of Functional Languages (September 1997), pages 53-71. St Andrews, Scotland, Springer, 1998.
• Specifying and Refining Internal Operations in Z. John Derrick, Eerke Boiten, Howard Bowman, and Maarten Steen. Formal Aspects of Computing, 10:125-159, December 1998.
• Automatic Verification of Mixed-Level Logic Circuits. Keith Hanna. In O. Gopalakrishna and P. Windley, editors, Formal Methods in Computer-Aided Design, volume 1522 of Lecture Notes in Computer Science, pages 133-148, Proceedings FMCAS 98, December 1998. Springer-Verlag, Berlin.
• Reasoning about Imperfect Digital Systems. Keith Hanna. In B. Moller and J. V. Tucker, editors, Prospects for Hardware Foundations, pages 333-355. Springer-verlag, Berlin, December 1998.
• Well-terminating, input-driven logic programs. Jan-Georg Smaus. Technical Report 16-98, University of Kent at Canterbury, November 1998.
• Controlled Timed Petri Nets: Equivalence Relations, Model Reduction. R. K. Boel, B. Bordbar, and G. Stremersch. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pages 674-679, San Diego, California, USA, October 1998.
• An interpretation of cognitive theory in concurrency theory. Howard Bowman. Technical Report 8-98, Computing Laboratory, University of Kent at Canterbury, October 1998.
• Representing space: A hybrid genetic algorithm for aesthetic graph layout. M.H.W. Hobbs and P.J. Rodgers. In FEA'98 Frontiers in Evolutionary Algorithms in Proceedings of JCIS'98 The Fourth Joint Conference on Information Sciences, volume 2, pages 415-418, October 1998.
• Proceedings of the First International Symposium on Memory Management. Richard Jones, editor, Vancouver, Canada, October 1998. ACM. ISMM is the successor to the IWMM series of workshops.
• Grey box data refinement. E.A. Boiten and J. Derrick. In J. Grundy, M. Schwenke, and T. Vickers, editors, International Refinement Workshop & Formal Methods Pacific '98, Discrete Mathematics and Theoretical Computer Science, pages 45-59, Canberra, September 1998. Springer-Verlag.
• IO - refinement in Z. E.A. Boiten and J. Derrick. In A Evans, D Duke, and T Clark, editors, 3rd BCS-FACS Northern Formal Methods Workshop, Electronic Workshops in Computing. Springer Verlag, September 1998.
• Analysis of a multimedia stream using stochastic process algebra. Howard Bowman, Jeremy Bryans, and John Derrick. In Corrado Priami, editor, Sixth International Workshop on Process Algebras and Performance Modelling, pages 51-69, Nice, September 1998.
• Testing refinements by refining tests. J. Derrick and E. A. Boiten. In J. P. Bowen, A. Fett, and M. G. Hinchey, editors, ZUM'98: The Z Formal Specification Notation, volume 1493 of Lecture Notes in Computer Science, pages 265-283. Springer-Verlag, September 1998.
• A Min-plus Polynomial Approach to Forbidden State Control for General Petri Nets. R. K. Boel, B. Bordbar, and G. Stremersch. In Proceedings of the 4th International Workshop on Discrete Event Systems, pages 79-84, Cagliari, Italy, August 1998.
• Automatic verification of a lip synchronisation protocol using UPPAAL. H. Bowman, G. Faconti, J.-P. Katoen, D. Latella, and M. Massink. Formal Aspects of Computing, 10(5-6):550-575, August 1998. Special Issue on Formal Methods for Industrial Critical Systems.
• Specification and verification of media constraints using UPPAAL. H. Bowman, G. Faconti, and M. Massink. In 5th Eurographics Workshop on the Design, Specification and Verification of Interactive Systems, DSV-IS 98, Eurographics Series. Springer-Verlag, August 1998.
• A lotos based tutorial on formal methods for object oriented distributed systems. Howard Bowman. New Generation Computing, 16(4):30, August 1998. Invited Tutorial Paper.
• Using Probability to Reason about Soft Deadlines. Andy King and Jeremy Bryans. Technical Report 13-98, Computing Laboratory, August 1998. Presented at the International Workshop on Constraint Programming for Time Critical Applications and Multi-Agent Systems, Nice, France.
• Analysis of Logic Programs with Delay. Andrew Heaton, Pat Hill, and Andy King. In N E Fuchs, editor, Logic Programming, Synthesis and Transformation (Selected Papers), volume 1463 of Lecture Notes in Computer Science, pages 148-167. Springer-Verlag, July 1998. Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.
• Constraint oriented specification with CSP and real time temporal logic. Justin Pearson and Jeremy Bryans. Technical Report 3-98, University of Kent at Canterbury, July 1998.
• Cyclic distributed garbage collection with group merger. Helena Rodrigues and Richard Jones. In Eric Jul, editor, Proceedings of 12th European Conference on Object-Oriented Programming, ECOOP98, Lecture Notes in Computer Science, pages 249-273, Brussels, July 1998. Springer.
• Distance: a New Metric for Controlling Granularity for Parallel Execution. K. Shen, V. Santos Costa, and A. King. In Joint International Conference and Symposium on Logic Programming, pages 85-99. MIT Press, July 1998.
• Verification of logic programs with block declarations running in several modes. Jan-Georg Smaus, Pat Hill, and Andy King. Technical Report 7-98, University of Kent at Canterbury, Canterbury, CT2 7NF, United Kingdom, July 1998.
• Weakly almost period functions on N with a negative base. B. Bordbar. J Lond Math Soc, (57):706-720, June 1998.
• Preventing instantiation errors and loops for logic programs with several modes using t block declarations. Jan-Georg Smaus, Pat Hill, and Andy King. Technical Report UMCS-98-6-1 (University of Manchester), June 1998. Extended abstract. Accepted for presentation at the LOPSTR 98 workshop.
• Termination of Logic Programs with block Declarations Running in Several Modes. Jan-Georg Smaus, Pat Hill, and Andy King. In Catuscia Palamidessi, editor, International Symposium on Programming Languages: Implementations, Logics and Programs, jointly held with Algebraic and Logic Programming, volume 1490 of Lecture Notes in Computer Science, pages 73-88. Springer-Verlag, see also http://www.springer.de/comp/lncs/index.html, June 1998.
• Automatic verification of a lip-synchronisation algorithm using uppaal - extended version. H. Bowman, G. Faconti, J-P. Katoen, D. Latella, and M. Massink. In Bas Luttick Jan Friso Groote and Jos Van Wamel, editors, FMICS'98, Third Internatinoal Workshop on Formal Methods for Industrial Crtical Systems, pages 97-124. CWI, May 1998. Also available as: H. Bowman, G. Faconti, J-P Katoen, D. Latella and M. Massink `Using UPPAAL for the Specification and Verification of a Lip-Sync Protocol' ERCIM Research Report 07/98-R054, July 1998.
• A tableaux method for interval temporal logic with projection. Howard Bowman and Simon J. Thompson. In TABLEAUX'98, International Conference on Analytic Tableaux and Related Methods, volume 1397 of Lecture Notes in AI, pages 108-123. Springer-Verlag, May 1998.
• Synchronization in Multimedia Documents. Helen Cameron, Peter King, Howard Bowman, and Simon Thompson. In Jacques Andre, editor, Electronic Publishing 98. Springer, May 1998.
• Widening Positive Boolean functions for Goal-dependent Groundness Analysis. Michael Codish, Andy Heaton, Andy King, Muhamed Abo-Zaed, and Pat Hill. Technical Report 12-98, Computing Laboratory, May 1998.
• Adding the axioms to Axiom: Towards a system of automated reasoning in Aldor. Erik Poll and Simon Thompson. Technical Report 6-98, Computing Laboratory, University of Kent, May 1998. Presented at the workshop Calculemus and Types, Eindhoven, Netherlands, July 1998. <a href="http://www.win.tue.nl/math/dw/pp/calc/">Workshop website</a>.
• Consistency and composition of process specifications. Maarten W. A. Steen. PhD thesis, University of Kent at Canterbury, United Kingdom, May 1998.
• A Functional Reactive Animation of a Lift using Fran. Simon Thompson. Technical Report 5-98, Computing Laboratory, University of Kent, May 1998.
• Constraint-oriented style for object-oriented formal specification. Tommaso Bolognesi and John Derrick. IEE Proceedings Software, 145(2-3):61-69, April 1998.
• Reflections on the design of a specification language. Stefan Kahrs and Donald Sannella. In Egidio Astesiano, editor, Fundamental Aspects of Software Engineering, volume 1382 of Lecture Notes in Computer Science, pages 154-170. Springer, April 1998.
• A true concurrency semantics for ET-LOTOS. Howard Bowman and Joost-Pieter Katoen. In CSD'98 International Conference on Application of Concurrency to System Design, IEEE Computer Society. IEEE Computer Society Press, March 1998.
• The weakly almost periodic compactification of a direct sum of finite groups. B. Bordbar and J. S. Pym. Proc Cambridge Phil Soc, (124):421-449, January 1998.
• Detecting and Exploiting Determinacy in Logic Programs. P Hill and A King. Computational Logic Newsletter, 4(1):100-101, January 1998.
• Behavioural subtyping for a type-theoretic model of objects. Erik Poll. In FOOL5: Fifth International Workshop on Foundations of Object-Oriented Languages, January 1998.
• Expansion Postponement for Normalising Pure Type Systems. Erik Poll. Journal of Functional Programming, 8(1):89-96, January 1998.
• Subtyping and Inheritance for Categorical Datatypes. Erik Poll. In Theories of Types and Proofs (TTP) - Kyoto, RIMS Lecture Notes 1023. Kyoto University Research Insitute for Mathematical Sciences, January 1998.
• The Sigma-Semantics: A Comprehensive Semantics for Functional Programs. Olaf Chitil. Fundamenta Informaticae, 31:253-294, 1997.
• Widening pos for efficient and scalable groundness analysis of logic programs. Mike Codish, Andy Heaton, and Andy King. Technical Report 16-97, University of Kent at Canterbury, December 1997.
• Determinacy and determinacy analysis. P.M. Hill and A. King. Journal of Programming Languages, 5(1):135-171, December 1997.
• A Graph Rewriting Visual Language for Database Programming. P.J. Rodgers and P.J.H. King. The Journal of Visual Languages and Computing, 8(6):641-674, December 1997.
• Cyclic distributed garbage collection with group merger. Helena C.C.D. Rodrigues and Richard E. Jones. Technical Report 17-97, Computing Laboratory, University of Kent at Canterbury, December 1997.
• Distance: a new metric for controlling granularity for parallel execution. Kish Shen, Vitor Santos Costa, and Andy King. Technical Report 15-97, University of Kent at Canterbury, December 1997.
• Ensuring Streams Flow. Alastair Telford and David Turner. In Michael Johnson, editor, Algebraic Methodology and Software Technology, 6th International Conference, AMAST '97, Sydney Australia, December 1997, volume 1349 of Lecture Notes in Computer Science, pages 509-523. AMAST, Springer-Verlag, December 1997.
• Embeddings in the strong reducibilities between 1 and npm. P. Watson. Mathematical Logic Quarterly, 43(4):559-568, December 1997.
• A Tableau Method for Interval Temporal Logic. Howard Bowman and Simon Thompson. Technical Report 12-97, Computing Laboratory, University of Kent, November 1997.
• Adding an Optimisation Pass to the Glasgow Haskell Compiler. Olaf Chitil. November 1997.
• Lecture notes on formal program development. Stefan Kahrs. LFCS Report ECS-LFCS-97-372, University of Edinburgh, November 1997.
• Lower-bound time-complexity analysis of logic programs. Andy King, Kish Shen, and Florence Benoy. In Jan Maluszynski, editor, International Symposium on Logic Programming, pages 261 - 276. MIT Press, November 1997.
• Disjunction of LOTOS specifications. M.W.A. Steen, H. Bowman, J. Derrick, and E.A. Boiten. In T. Mizuno, N. Shiratori, T. Higashino, and A. Togashi, editors, Formal Description Techniques and Protocol Specification, Testing and Verification: FORTE X / PSTV XVII '97, pages 177-192, Osaka, Japan, November 1997. Chapman & Hall.
• Formal specification of distributed multimedia systems. G.S. Blair, L. Blair, H. Bowman, and A. Chetwynd. University College London Press, September 1997.
• Viewpoint consistency in Z and LOTOS: A case study. E. Boiten, H. Bowman, J. Derrick, and M. Steen. In J. Fitzgerald, C.B. Jones, and P. Lucas, editors, FME'97: Industrial Applications and Strengthened Foundations of Formal Methods, volume 1313 of Lecture Notes in Computer Science, pages 644-664. Springer-Verlag, September 1997.
• Common Subexpression Elimination in a Lazy Functional Language. Olaf Chitil. In Chris Clack, Tony Davie, and Kevin Hammond, editors, Draft Proceedings of the 9th International Workshop on Implementation of Functional Languages, pages 501-516. St Andrews, Scotland, September 1997.
• Subtyping and Inheritance for Inductive Types. Erik Poll. In Proceedings of TYPES'97 Workshop on Subtyping, inheritance and modular development of proofs, Durham, UK, September 1997.
• System F with Width-subtyping and Record Updating. Erik Poll. In Theoretical Aspects of Computer Software (TACS'97), Sendai, Japan, pages 439-457. Springer LNCS, September 1997.
• Visual Execution and Data Visualisation in Natural Language Processing. P.J. Rodgers, R. Gaizauskas, K. Humphreys, and H. Cunningham. In VL'97 IEEE Symposium on Visual Languages, pages 342-347. IEEE Computer Society, September 1997.
• Ensuring the Productivity of Infinite Structures. Alastair Telford and David Turner. Technical Report 14-97, The Computing Laboratory, University of Kent at Canterbury, Canterbury, Kent, CT2 7NF, UK, September 1997. This technical report has been revised (March 1998). A shorter version of this paper was presented at AMAST '97.
• em Where do I begin? A problem solving approach to teaching functional programming. Simon Thompson. In Krzysztof Apt, Pieter Hartel, and Paul Klint, editors, First International Conference on Declarative Programming Languages in Education. Springer-Verlag, September 1997.
• Inferring Argument Size Relationships with CLP(R). Florence Benoy and Andy King. In Logic Program Synthesis and Transformation, volume 1207 of Lecture Notes in Computer Science, pages 204-223. Springer-Verlag, August 1997.
• Introductory Problem Solving in Computer Science. David J. Barnes, Sally Fincher, and Simon Thompson. In Goretti Daughton and Patricia Magee, editors, 5th Annual Conference on the Teaching of Computing, pages 36-39, Centre for Teaching Computing, Dublin City University, Dublin 9, Ireland, August 1997.
• Typed Norms for Typed Logic Programs. Jon Martin and Andy King. In J. Gallagher, editor, Logic Program Synthesis and Transformation, volume 1207 of Lecture Notes in Computer Science, pages 224-238. Springer-Verlag, August 1997.
• A comparative study of Coq and HOL. Vincent Zammit. In Elsa L. Gunter and Amy Felty, editors, Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs'97, Murray Hill, NJ, USA, volume 1275 of Lecture Notes in Computer Science, pages 323-337. Springer, August 1997.
• Coupling schemas: data refinement and view(point) composition. E.A. Boiten, J. Derrick, H. Bowman, and M. Steen. In D.J. Duke and A.S. Evans, editors, 2nd BCS-FACS Northern Formal Methods Workshop, Workshops in Computing, page 18. Springer-Verlag, July 1997.
• On Behavioural Subtyping in LOTOS. H. Bowman, C. Briscoe-Smith, J. Derrick, and B. Strulo. In H. Bowman and J. Derrick, editors, FMOODS'97, Second IFIP International Conference on Formal Methods for Open Object-based Distributed Systems. Chapman and Hall, July 1997.
• Specification and Prototyping of Structured Multimedia Documents using Interval Temporal Logic. Howard Bowman, Helen Cameron, Peter King, and Simon Thompson. In International Conference on Temporal Logic, Applied Logic Series. Kluwer, July 1997.
• FMOODS'97, IFIP TC6 WG6.1 International Conference on Formal Methods for Open Object-based Distributed Systems. Howard Bowman and John Derrick, editors, volume 2, Canterbury, UK, July 1997. Chapman and Hall.
• Fran in action!. Anthony C. Daniels. This is a Fran tutorial that develops an animation of crew rowing., July 1997.
• Translating LOTOS to Object-Z. J. Derrick, E.A. Boiten, H. Bowman, and M. Steen. In D.J. Duke and A.S. Evans, editors, Northern Formal Methods Workshop, volume 2nd BCS-FACS Northern Formal Methods Workshop of Workshops in Computing. Springer-Verlag, July 1997.
• Inferring numeric relationships for logic program transformation. Jon Martin and Andy King. In Pre-conference proceedings of Logic Program Synthesis and Transformation, page 12, July 1997.
• NL Module Evaluation in GATE. R.G. Gaizauskas and P.J. Rodgers. In SALT '97 Workshop on Evaluation in Speech and Language Technology. Sheffield University, June 1997.
• Mexitl: Multimedia in Executable Interval Temporal Logic. Howard Bowman, Helen Cameron, Peter King, and Simon Thompson. Technical Report 3-97, Computing Laboratory, University of Kent at Canterbury, May 1997.
• Extending LOTOS with time: True concurrency perspective. Howard Bowman and John Derrick. In Miquel Bertran and Teodor Rus, editors, ARTS'97, AMAST Workshop on Real-Time Systems, Concurrent and Distributed Software, volume 1231 of Lecture Notes in Computer Science, pages 382-399. Springer-Verlag, May 1997.
• From ACT-ONE to Miranda, a Translation Experiment. Nathan Charles, Howard Bowman, and Simon Thompson. Computer Standards and Interfaces, 19(1), May 1997.
• Two Loop Detection Mechanisms: A Comparison. J. M. Howe. In D. Galmiche, editor, TABLEAUX'97, volume 1227 of Lecture Notes in Artificial Intelligence, pages 188-200. Springer-Verlag, May 1997.
• Higher-order + Polymorphic = Reusable. Simon Thompson. May 1997.
• Weak refinement in Z. J. Derrick, E.A. Boiten, H. Bowman, and M. Steen. In J.P. Bowen, M.G. Hinchey, and D.Till, editors, ZUM '97: The Z Formal Specification Notation, volume 1212 of Lecture Notes in Computer Science, pages 369-388, Reading, April 1997. Springer-Verlag.
• Generating efficient, terminating logic programs. J.M. Martin and A.M. King. In Proceedings of the Seventh International Joint Conference on Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, pages 173-184. Springer Verlag, April 1997.
• Z unification tools in Generic Formaliser. E. Boiten. Technical Report 10-97*, Computing Laboratory, University of Kent at Canterbury, March 1997.
• Domain construction for mode analysis of typed logic programs. Jan-Georg Smaus, Pat Hill, and Andy King. Technical Report 8-97, March 1997.
• A proof of the S-m-n theorem in Coq. Vincent Zammit. Technical Report 9-97, The Computing Laboratory, The University of Kent, Canterbury, Kent, UK, March 1997.
• The semantics of Extended ML: A gentle introduction. Stefan Kahrs, Don Sannella, and Andrzej Tarlecki. Theoretical Computer Science, 173(2):445-484, February 1997.
• A comparison of real-time formal specification languages. A.S. Evans, D.R.W. Holton, L.M. Lai, and P. Watson. In D.J. Duke and A.S. Evans, editors, Proceedings of the Northern Formal Methods Workshop, Ilkley, September 1996, Electronic Workshops in Computer Science, http://ewic.springer.co.uk/, January 1997. Springer Verlag.
• A case study in Timed CSP: the railroad crossing problem. L.M. Lai and P. Watson. In O. Maler, editor, Proceedings of the International Workshop on Hybrid and Real-Time Systems (HART 97), volume 1201 of Lecture Notes in Computer Science, pages 69-74. Springer Verlag, January 1997.
• Constructive interval temporal logic in Alf. Simon Thompson. In International Conference on Temporal Logic 1997, Applied Logic. Kluwer, January 1997. These proceedings are to be publised by Kluwer in 1997.
• Nested collections and polytypism. E.A. Boiten and P.F. Hoogendijk. Computing Science Report 96-17, Department of Computing Science, Eindhoven University of Technology, November 1996.
• Modelling robot manipulators in a CAD environment using B-splines. Colin G. Johnson and Duncan Marsh. In Nikolaos G. Bourbakis, editor, Proceedings of the 1996 IEEE Joint Symposia on Intelligence and Systems, pages 194-201. IEEE, IEEE Press, November 1996.
• Extending the application of formal methods to analyse human error and system failure during accident investigations. C.W. Johnson and A.J. Telford. Software Engineering Journal, 11(6):355-365, November 1996.
• Issues in multiparadigm viewpoint specification. E. Boiten, H. Bowman, J. Derrick, and M. Steen. In A. Finkelstein and G. Spanoudakis, editors, SIGSOFT '96 International Workshop on Multiple Perspectives in Software Development (Viewpoints '96), pages 162-166. ACM, October 1996.
• Comparing LOTOS and Z refinement relations. J. Derrick, H. Bowman, E.A. Boiten, and M. Steen. In FORTE/PSTV'96, pages 501-516, Kaiserslautern, Germany, October 1996. Chapman & Hall.
• GATE - an Environment to Support Research and Development in Natural Language Engineering. R.G. Gaizauskas, H. Cunningham, Y. Wilks, P.J. Rodgers, and K. Humphreys. In Proceedings of the 8th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-96), pages 58-66. IEEE Computer Society, October 1996.
• Abstract interpretation of constructive type theory. Alastair Telford and Simon Thompson. Technical Report 19-96*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, October 1996.
• Limits of ML-definability. Stefan Kahrs. In Proceedings of PLILP'96, volume 1140 of Lecture Notes in Computer Science, pages 17-31. Springer, September 1996.
• The specification and conformance of ODP systems. P.F. Linington, J. Derrick, and H. Bowman. In 9th International Workshop on Testing of Communicating Systems, pages 93-114, Darmstadt, Germany, September 1996. IFIP TC6/WG6.1, Chapman & Hall.
• About the completeness of type systems. Stefan Kahrs. In Maarten de Rijke, editor, Observational Equivalence and Logical Equivalence, page 17. ESSLLI, August 1996.
• Cross-viewpoint consistency in accident investigations. A.J. Telford and C.W. Johnson. Technical Report TR-1996-38, Department of Computer Science, University of Glasgow, 17, Lilybank Gardens, Glasgow, G12 8QQ, August 1996. An abridged version of this TR was submitted to Formal Aspects of Computing.
• A mechanisation of computability theory in HOL. Vincent Zammit. In J. von Wright, J. Grundy, and J. Harrison, editors, Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics, volume 1125 of Lecture Notes in Computer Science, pages 431-446, Turku, Finland, August 1996. Springer-Verlag.
• Benchmarking implementations of functional languages with `Pseudoknot', a float-intensive benchmark. Pieter H. Hartel, Marc Feeley, Richard Jones, and Stephen Thomas. Journal of Functional Programming, 6(4):621-655, July 1996.
• Garbage collection: Algorithms for automatic dynamic memory management. Richard Jones. John Wiley and Sons, July 1996. With a chapter on Distributed Garbage Collection by Rafael Lins. Reprinted 1997 (twice), 1999, 2000.
• Haskell: The Craft of Functional Programming. Simon Thompson. Addison Wesley, July 1996. Further details <a href="http://www.ukc.ac.uk/computer_science/Haskell_craft/">here</a>.
• The sigma-semantics: A comprehensive semantics for functional programs. Olaf Chitil. AIB 96-07, RWTH Aachen, May 1996. Pre-version of the Fundamenta Informaticae paper.
• Real-time LOSTOS and Timed Observations. J.W. Davies, J.W. Bryans, and S.A. Schneider. IFIP. Presented at FORTE'95, Chapman and Hall, April 1996.
• Consistency and refinement for partial specification in Z. E. Boiten, J. Derrick, H. Bowman, and M. Steen. In M.-C. Gaudel and J. Woodcock, editors, FME'96: Industrial Benefit of Formal Methods, Third International Symposium of Formal Methods Europe, volume 1051 of Lecture Notes in Computer Science, pages 287-306. Springer-Verlag, March 1996.
• Viewpoint consistency in ODP, a general interpretation. H. Bowman, E. Boiten, J. Derrick, and M. Steen. In E. Najm and J.-B. Stefani, editors, First IFIP International Workshop on Formal Methods for Open Object-Based Distributed Systems, pages 189-204. Chapman & Hall, March 1996.
• Supporting ODP - translating LOTOS into Z. J. Derrick, E. Boiten, H. Bowman, and M. Steen. In E. Najm and J.-B. Stefani, editors, First IFIP International Workshop on Formal Methods for Open Object-Based Distributed Systems, pages 399-406, Paris, March 1996. Chapman & Hall.
• Strategies for consistency checking, the choice of unification. Howard Bowman, Eerke Boiten, John Derrick, and Maarten Steen. Technical Report 5-96*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, February 1996.
• Resolution K-Transformations. Jan-Georg Smaus. Master's thesis, Universitaet des Saarlandes (Max-Planck-Institut fuer Informatik), Saarbruecken, Germany, February 1996.
• Cross viewpoint consistency in Open Distributed Processing. H. Bowman, J. Derrick, P. Linington, and M. Steen. Software Engineering Journal, 11(1):44-57, January 1996.
• Formal description of distributed multimedia systems: an assessment of potential techniques. H. Bowman, L. Blair, G.S. Blair, and A. Chetwynd. Computer Communications, 18(12):964-977, December 1995.
• Functional programming through the curriculum. Simon Thompson and Steve Hill. In Pieter H. Hartel and Rinus Plasmeijer, editors, Functional Programming Languages in Education, number 1022 in Lecture Notes in Computer Science, pages 85-102. Springer-Verlag, December 1995.
• Unification and multiple views of data in Z. E. Boiten, J. Derrick, H. Bowman, and M. Steen. In J.C. van Vliet, editor, Computing Science in the Netherlands, pages 73-85, Amsterdam, November 1995. Stichting Mathematisch Centrum.
• Strategies for consistency checking. Howard Bowman, Eerke Boiten, John Derrick, and Maarten Steen. Technical Report 12-95*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, November 1995.
• Towards a Denotational Semantics for Timed LOTOS. J.W. Bryans, J.W. Davies, and S.A. Schneider. In Lecture Notes in Computer Science 962. CONCUR'95, October 1995.
• Formal specification and verification of multimedia systems in open distributed processing. L. Blair, G.S. Blair, H. Bowman, and A. Chetwynd. Computer Standards and Interfaces, 17(5-6):413-436, September 1995.
• FDTs for ODP. H. Bowman, J. Derrick, P. Linington, and M. Steen. Computer Standards and Interfaces, 17:457-479, September 1995.
• A true concurrency semantics for quality of service specification and validation. H. Bowman and J. Derrick. In Behcet Sarikaya and Senro Saito, editors, MMNet'95, International Conference on Multimedia and Networking, pages 173-182. IEEE Computer Society Press, September 1995.
• Viewpoints and Objects. J. Derrick, H. Bowman, and M. Steen. In J. P. Bowen and M. G. Hinchey, editors, Ninth Annual Z User Workshop, volume 967 of Lecture Notes in Computer Science, pages 449-468, Limerick, September 1995. Springer-Verlag.
• Miranda in Isabelle. Steve Hill and Simon Thompson. In Lawrence C. Paulson, editor, Preceedings of the first Isabelle Users Workshop, number 397 in University Of Cambridge Computer Laboratory Technical Reports Series, pages 122-135, September 1995.
• The variable containment problem. Stefan Kahrs. In Gilles Dowek, Jan Heering, Karl Meinke, and Bernhard M"oller, editors, Higher-Order Algebra, Logic, and Term Rewriting, volume 1074 of Lecture Notes in Computer Science, pages 109-123. Springer, September 1995.
• Static analysis of martin-l"of's intuitionistic type theory. Alastair Telford. PhD thesis, The Computing Laboratory, University of Kent at Canterbury, Canterbury, Kent, CT2 7NF, UK, September 1995.
• Confluence of curried term-rewriting systems. Stefan Kahrs. Journal of Symbolic Computation, 19:601-623, August 1995.
• Miranda: The Craft of Functional Programming. Simon Thompson. Addison Wesley, July 1995. Further details can be found <a href="http://www.ukc.ac.uk/computer_science/Miranda_craft">here</a>.
• Cross viewpoint consistency in open distributed processing (intra language consistency). Eerke Boiten, Howard Bowman, John Derrick, and Maarten Steen. Technical Report 8-95*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, June 1995.
• Zed - a Z specification language font for PostScript Type 1 and TrueType. Richard E. Jones. BBS in a BOX CD-ROM, AMUG CD, Inc., 4131 N. 24th Street A-120,Phoenix, AZ 85016, June 1995. Available for Macintosh and Windows from the Oxford Z archive, Info-mac archive at Stanford University and mirrors.
• Programming Language Semantics using Miranda. Simon Thompson. Technical Report 9-95*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, May 1995.
• Regular Expressions and Automata using Miranda. Simon Thompson. May 1995.
• Towards a domain theory for termination proofs. Stefan Kahrs. In Jieh Hsiang, editor, Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 241-255. Springer, April 1995.
• Abstract matching can improve on abstract unification. Andy King and Mark Longley. Technical Report 4-95*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, March 1995.
• A Logic for Miranda, Revisited. Simon Thompson. Formal Aspects of Computing, (7), March 1995.
• Some results on cross viewpoint consistency checking. H. Bowman, J. Derrick, and M. Steen. In K. Raymond and L. Armstrong, editors, IFIP TC6 International Conference on Open Distributed Processing, pages 399-412, Brisbane, Australia, February 1995. Chapman and Hall.
• Modelling distributed systems using Z. H. Bowman and J. Derrick. In K. M. George, editor, ACM Symposium on Applied Computing, pages 147-151, Nashville, February 1995. ACM Press.
• Denotationelle und operationelle Semantiken für konstruktorbasierte funktionale Programmiersprachen erster Ordnung. Olaf Chitil. Master's thesis, RWTH Aachen, February 1995. In German.
• Maintaining cross viewpoint consistency using Z. J. Derrick, H. Bowman, and M. Steen. In K. Raymond and L. Armstrong, editors, IFIP TC6 International Conference on Open Distributed Processing, pages 413-424, Brisbane, Australia, February 1995. Chapman and Hall.
• Fixed-point calculus. Mathematics of Program Construction group. Information Processing Letters, 53(3):131-136, February 1995. Special Issue on The Calculational Method. Authors: C. Aarts, R. Backhouse, E. Boiten, H. Doornbos, N. van Gasteren, R. van Geldrop, P. Hoogendijk, E. Voermans and J. van der Woude.
• Share x free revisited. Andy King. Technical Report 3-95*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, January 1995.
• Composition of LOTOS specifications. M. W. A. Steen, H. Bowman, and J. Derrick. In P. Dembinski and M. Sredniawa, editors, Protocol Specification, Testing and Verification, XV, pages 73-88, Warsaw, Poland, January 1995. Chapman & Hall.
• Inductive learning of recurrence-term languages from positive data. P. Watson. In K.P. Jantke and S. Lange, editors, Algorithmic learning for knowledge-based systems, volume 961 of Lecture Notes in Artificial Intelligence, pages 292-315. Springer Verlag, January 1995.
• Parallel Theorem Proving. F. K. Hanna and W. G. J. Howells. In C. Runciman and D. Wakeling, editors, Applications of Functional Programming, chapter 12, pages 221- 235. UCL Press, 1994.
• The Veritas Proof Assistant. F. K. Hanna and W. G. J. Howells. In C. Runciman and D. Wakeling, editors, Applications of Functional Programming, chapter 8, pages 125-204. UCL Press, 1994.
• Reasoning about Real Digital Circuits. Keith Hanna. In Proc Higher Order Logic Theorem Proving and its Applications. Springer-Verlag, 1994.
• A Framework for Freeness Analysis. A King, pages 137-149. Implementations of Logic Programming Systems. Kluwer Academic Publishers, Dordrecht, 1994.
• High Precision Sharing Analysis. A King. Journal of Programming Languages, 2(1):149-191, 1994.
• The Unix Filing System: A MooZ Specification. SRL Meira, ALC Cavalcanti, and CS Santos. In K Lano and H Haughton, editors, Object Oriented Specification Case Studies, chapter 4, pages 80-109. Prentice-Hall, 1994.
• Partial categorical multi-combinators and church-rosser theorems. Raphael D Lins. Technical report, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, December 1994.
• Garbage collecting shared environment closure reducers. Stephen Thomas and Richard Jones. Technical Report 31-94, Computing Laboratory, University of Kent at Canterbury, December 1994.
• A formal description technique supporting expression of quality of service and media synchronisation. H. Bowman, L. Blair, G.S. Blair, and A.G. Chetwynd. In D. Hutchison, A. Danthine, H. Leopold, and G. Coulson, editors, Multimedia Transport and Teleservices, International COST 237 Workshop, volume 882 of Lecture Notes in Computer Science, pages 145-167. Springer-Verlag, November 1994.
• Continuation passing combinators for parsing precedence grammars. Steve Hill. Technical Report 24-94*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, November 1994.
• On the Equivalence Between CMC and TIM. Raphael Lins, Simon Thompson, and Simon Peyton Jones. Journal of Functional Programming, 1(4), November 1994.
• Interfaces and Extended ML. Don Sannella, Andrzej Tarlecki, and Stefan Kahrs. SIGPLAN Notices, 29(8):111-118, November 1994.
• Continuation Compilation for Concurrent Logic Programming. B Kemp, A King, and P Soper. In A Crespo, editor, Proceedings of the Symposium on Artificial Intelligence in Real-time Control, pages 299-306. Pergamon, October 1994.
• Machine discovery in the presence of incomplete or ambiguous data. S. Lange and P. Watson. In K.P. Jantke, editor, Algorithmic Learning Theory, Proceedings of the 5th International Workshop, Rheinhardsbrunn, Germany, 1994, volume 872 of Lecture Notes in Artificial Intelligence, pages 438-452. Springer Verlag, October 1994.
• The functional simulation of a simple microprocessor. Steve Hill. Technical Report 17-94*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, September 1994.
• The lazy z-buffer. Steve Hill. Technical Report 16-94*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, September 1994.
• Real-time CSP and ET-LOTOS. J.W. Bryans, J.W. Davies, and S.A. Schneider. Technical report, Reading University, Presented at the COST 247 WG 6.1 working group meeting in Brighton, July 1994.
• A Failures Semantics for ET-LOTOS. S.A. Schneider, J.W. Bryans, and J.W. Davies. Technical report, Reading University, Presented at the COST 247 - WG 6.1 working group meeting in Brighton, July 1994.
• First-class polymorphism for ML. Stefan Kahrs. In Donald Sannella, editor, Programming Languages and Systems - ESOP'94, volume 788 of Lecture Notes in Computer Science, pages 333-347. Springer, April 1994.
• Towards a formal model of consistency in odp. Howard Bowman and John Derrick. Technical Report 3-94*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, March 1994.
• Modelling garbage collection algorithms. Howard Bowman, John Derrick, and Richard E. Jones. In Proceedings of International Computing Symposium, January 1994. Also in ALP-UK International Workshop on Concurrency in Computational Logic.
• Modelling garbage collection algorithms - extend abstract. Howard Bowman, John Derrick, and Richard E. Jones. In Proceedings of Principles of Distributed Computing'94, January 1994. Extended abstract of CCS94.
• The definition of Extended ML. Stefan Kahrs, Don Sannella, and Andrzej Tarlecki. LFCS Report ECS-LFCS-94-300, University of Edinburgh, January 1994.
• Depth-k Sharing and Freeness. A. King and P. Soper. In P. Van Hentenryck, editor, International Conference on Logic Programming, pages 553-568. MIT Press, January 1994.
• A Synergistic Analysis for Sharing and Groundness which traces Linearity. Andy King. In D.Sannella, editor, European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 363-378. Springer-Verlag, January 1994.
• Reasoning about Array Structures using a Dependently Typed Logic. Alan Dent and Keith Hanna. In Proc Computer Hardware Description Languages (CHDL-93), pages 195-212. Elsevier Science Publishers, 1993.
• Strongly-Typed Theory of Structures and Behaviours. Keith Hanna and Neil Daeche. In Correct Hardware Design and Verification Methods, pages 39-54. Springer-Verlag, 1993.
• Transformational derivation of (parallel) programs using skeletons. E.A. Boiten, A.M. Geerling, and H.A. Partsch. In H. Wijshoff, editor, Computing Science in the Netherlands 1993, pages 97-108, Amsterdam, November 1993. Stichting Mathematisch Centrum.
• The specification in z of the rex protocol. John Derrick and Robert Sultana. Technical Report 10-93*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, November 1993.
• Zed - a Z specification language Type 1 font. Richard E. Jones. Oxford Z archive, Info-mac archive at Stanford University and mirrors, November 1993.
• Time versus abstraction in formal description. H. Bowman, G.S. Blair, L. Blair, and A.G. Chetwynd. In Richard Tenney, Paul D. Amer, and Umit Uyar, editors, IFIP Transactions C_22, Proceedings of FORTE`93, Sixth International Conference on Formal Description Techniques, pages 467-482. North-Holland, October 1993.
• Parallel searching for a first solution. Bozena Bartoszek, Zbigniew Czeck, and Marek Konopka. Technical Report 8-93*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, September 1993.
• Compilation of combinatory reduction systems. Stefan Kahrs. In Jan Heering, Karl Meinke, Bernhard M"oller, and Tobias Nipkow, editors, Higher-Order Algebra, Logic, and Term Rewriting, volume 816 of Lecture Notes in Computer Science, pages 169-188. Springer, September 1993.
• The pragmatics of closure reduction. Stephen P. Thomas. PhD thesis, University of Kent at Canterbury, September 1993.
• A Formal Logical Analysis of Causal Relations. Chris Taylor. DPhil Thesis, University of Sussex, July 1993.
• Parsing in ISBES. E.A. Boiten. In D. Bjorner, M. Broy, and I.V. Pottosin, editors, Formal Methods in Programming and Their Applications, volume 735 of Lecture Notes in Computer Science, pages 423-433, Berlin, June 1993. Springer-Verlag.
• Cyclic weighted reference counting without delay. Richard E. Jones and Rafael D. Lins. In Proceedings of PARLE'93, pages 712-715, June 1993.
• Cyclic weighted reference counting. Rafael D. Lins and Richard E. Jones. In WP & FP'93 Workshop on Parallel and Distributed Processing, Sofia, Bulgaria, pages 369-382, May 1993. Also in UKC Computing Laboratory Technical Report 95, December 1991, revised November 1992.
• Mistakes and ambiguities in the definition of Standard ML. Stefan Kahrs. LFCS Report ECS-LFCS-93-257, University of Edinburgh, April 1993. An update listing further errors can be found at t ftp://ftp.dcs.ed.ac.uk/pub/smk/SML/errors-new.ps.Z.
• Verification techniques for LOTOS: final report. M. Thomas, C. Kirkwood, B. Matthews, and P. Watson. Technical Report FM-1993-8, Department of Computing Science, University of Glasgow, January 1993.
• Solving divergence in Knuth-Bendix completion by enriching signatures. M. Thomas and P. Watson. Theoretical Computer Science, 112:145-185, January 1993.
• Implementation of the Veritas Design Logic. F. K. Hanna, N. Daeche, and W. G. J. Howells. In Proc. Theorem Provers in Circuit Design, pages 77-94. North Holland, 1992.
• The Veritas Design Logic; a User''s View. F. K. Hanna and N. Daeche. In Proc. Theorem Provers in Circuit Design, pages 301-310. North Holland, 1992.
• MooZ Case Studies. SRL Meira and ALC Cavalcanti. In R Barden, S Stepney, and D Cooper, editors, Object Orientation in Z, Workshops in Computing, chapter 5, pages 37-58. Springer-Verlag, 1992.
• How to produce correct software - an introduction to formal specification and program development by transformations. E.A. Boiten, H.A. Partsch, D. Tuijnman, and N. V"olker. Computer Journal, 35(6):547-554, December 1992.
• Cyclic weighted reference counting without delay. Richard Jones and Rafael D Lins. Technical Report 28-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, November 1992.
• Gmc a graph categorical multi-combinator machine. Martin A Musicante and Rafael D Lins. Technical Report 27-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, November 1992.
• Formulating Haskell. Simon Thompson. Technical Report 29-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, November 1992.
• Cumulative index to the acm algorithms. Tim Hopkins and David Morse. Technical Report 24-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, October 1992.
• Polymorphic type checking by interpretation of code. Stefan Kahrs. LFCS report ECS-LFCS-92-238, University of Edinburgh, Laboratory for Foundations of Computer Science, September 1992.
• Serialisation Analysis of Concurrent Logic Programs. A. King and P. Soper. In H. Kirchner, editor, Algebraic and Logic Programming, volume 632 of Lecture Notes in Computer Science, pages 322-334, September 1992.
• Generational cyclic reference counting. Rafael D Lins. Technical Report 22-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, September 1992.
• Some performance figures for the g-machine and its optimisations. P G Soares and R D Lins. Technical Report 21-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, September 1992.
• Zed - a Z specification language Type 1 font. Richard E. Jones. Info-Mac CD-ROM, Pacific HiTech Inc. and Oxford Z archive, Info-mac archive at Stanford University and mirrors, August 1992.
• Unlimp - uniqueness as a leitmotiv for implementation. Stefan Kahrs. In Maurice Bruynooghe and Martin Wirsing, editors, Programming Language Implementation and Logic Programming, volume 631 of Lecture Notes in Computer Science, pages 115-129. Springer, August 1992.
• Cyclic reference counting with lazy mark-scan. Rafael D Lins. Technical Report 26-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, August 1992.
• Gammacmc: A novel way of compiling functional languages. Rafael D Lins and Bruno O Lira. Technical Report 19-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, July 1992.
• The Categorical Multi-combinator Machine: CMCM. Simon Thompson and Rafael D Lins. The Computer Journal, 35(2), July 1992.
• Partial categorical multi-combinators and church-rosser theorems. Raphael D Lins. Technical Report 7-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, May 1992.
• A multi-processor shared memory architecture. Rafael D Lins. Technical Report 1-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, March 1992.
• Views of formal program development. E.A. Boiten. PhD thesis, University of Nijmegen, Faculty of Mathematics and Informatics, February 1992. Contains cite159,165,162,161,156. ISBN 90-9004747-6.
• USTOPIA requirements - Thoughts on a User-friendly System for Transformation Of Programs In Abstracto. E.A. Boiten, M.G.J. van den Brand, N.W.P. van Diepen, C.H.A. Koster, H.A. Partsch, and N. V"olker. Periodica Polytechnica Ser. El. Eng., 35(2):101-123, January 1992. Also Technical Report 90-12, Dept. of Informatics, University of Nijmegen.
• Factorisation of the factorial - an example of inverting the flow of computation. E.A. Boiten. Periodica Polytechnica Ser. El. Eng, 35(2):77-99, January 1992.
• Improving recursive functions by inverting the order of evaluation. E.A. Boiten. Science of Computer Programming, 18:139-179, January 1992.
• Tail recursion without space leaks. Richard E. Jones. Journal of Functional Programming, 2(1):73-79, January 1992.
• Solving divergence in Knuth-Bendix completion by enriching signatures. M. Thomas and P. Watson. In M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, Algebraic Methodology and Software Technology, Proceedings of the 2nd International Conference, Iowa City, U.S.A., 1991, Workshops in Computing, pages 377-390. Springer Verlag, January 1992.
• Are subsets necessary in Martin-Lof type theory?. Simon Thompson. In J. P. Myers Jr. and M. J. O'Donnell, editors, Constructivity in Computer Science, volume 613 of Lecture Notes in Computer Science, pages 46-57. Springer-Verlag, January 1992.
• The many disguises of accumulation. E.A. Boiten. Technical Report 91-26, Dept. of Informatics, University of Nijmegen, December 1991.
• Cyclic weighted reference counting. Rafael D Lins and Richard Jones. Technical Report 95*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, December 1991.
• Solving a combinatorial problem by transformation of abstract data types. E.A. Boiten. In J. van Leeuwen, editor, Computing Science in the Netherlands 1991, pages 99-108, Amsterdam, November 1991. Stichting Mathematisch Centrum. Also a chapter in PhD thesis.
• Intersections of sets and bags of extended substructures, and Can bag comprehension be used at all?. E.A. Boiten. Technical Report 91-21, Dept. of Informatics, University of Nijmegen, September 1991.
• A comparative study of algorithms for cyclic reference counting. Rafael D Lins and Marcio A Vasques. Technical Report 92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, September 1991.
• A shared memory architecture for parallel cyclic reference counting. Rafael D Lins. Technical Report 77*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, August 1991.
• Reducing Scheduling Overheads for Concurrent Logic Programs. A. King and P. Soper. In H. Boley and M. M. Richter, editors, Processing Declarative Knowledge, number 567 in Lecture Notes in Artificial Intelligence, pages 279-286. Springer-Verlag, July 1991.
• Type Theory and Functional Programming. Simon Thompson. Addison Wesley, June 1991.
• Intersections of bags and sets of extended substructures - a class of problems. E.A. Boiten. In B. M"oller, editor, Proceedings of the IFIP TC2 Working Conference on Constructing Programs from Specifications, pages 33-48, Amsterdam, May 1991. North-Holland.
• A note on similarity of specifications and reusability of transformational developments. H.A. Partsch and E.A. Boiten. In B. M"oller, editor, Proceedings of the IFIP TC2 Working Conference on Constructing Programs from Specifications, pages 71-89, Amsterdam, May 1991. North-Holland.
• An efficient representation of arithmetic for term rewriting. D. Cohen and P. Watson. In R. Book, editor, Rewrite Techniques and Applications, Proceedings of the 4th Conference on Rewrite Techniques and Applications, Como, Italy, 1991, volume 488 of Lecture Notes in Computer Science, pages 240-251. Springer Verlag, January 1991.
• Order-sorted term rewriting. A.J.J. Dick and P. Watson. The Computer Journal, 34(1):16-19, January 1991.
• Modular extensions to z. Silvio Lemos Meira. Technical Report 85*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, January 1991.
• On the use of structured inductive semantics in source-to-source translation of programming languagues. Silvio Lemos Meira. Technical Report 84*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, January 1991.
• Generalising diverging sequences of rewrite rules by synthesising new sorts. M. Thomas and P. Watson. In S.L. Peyton Jones, G. Hutton, and C. Kehler Holst, editors, Functional Programming, Glasgow 1990, Proceedings of the 1990 Glasgow Workshop on Functional Programming, Workshops in Computing, pages 268-273. Springer Verlag, January 1991.
• Modular Object-Oriented Z Specifications. SRL Meira and ALC Cavalcanti. In JE Nicholls, editor, Z User Workshop, pages 173-192, Oxford, UK, 1990. Springer-Verlag.
• Factorisation of the factorial - an algorithm discovered by playing with transformations. E.A. Boiten. Technical Report 90-18, Dept. of Informatics, University of Nijmegen, November 1990.
• Tail recursion without space leaks. Richard Jones. Technical Report 72*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, March 1990.
• Implementing SASL using Categorical Multi-combinators. Rafael D Lins and Simon Thompson. Technical Report 47*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, February 1990.
• Case studies in equational reasoning. U.H. Martin, D.A. Cohen, M.K.F. Lai, K.J. Norrie, and P. Watson. Technical report, Royal Holloway and Bedford New College, University of London, January 1990.
• On restricted forms of enumeration reducibility. P. Watson. Annals of Pure and Applied Logic, 49:75-96, January 1990.
• Denotational Models of Software Systems. ALC Cavalcanti and SRL Meira. In 9th Conference of the Brazilian Computer Society, pages 187-204, 1989. (in Portuguese).
• Formal Synthesis of Digital Systems. F. K. Hanna, N. Daeche, and M. Longley. In L. Claesen, editor, Proc IFIP Intnl. Workshop on Applied Formal Methods for Correct VLSI Design, pages 532-548. Elsevier, 1989. Leuven, Belgium.
• Veritas: A Specification Language based on Type Theory. F. K. Hanna, N. Daeche, and M. Longley. In Proc. Workshop on Hardware Specification, Verification and Synthesis, Mathematical Aspects, pages 358-379. Springer Verlag, 1989. LNCS.
• LindA: A Language for Automated Authoring of Hypertexts. J Kelner, ALC Cavalcanti, and A Pardo. In 3rd Brazilian Symposium on Sofrware Engineering, pages 124-136, 1989.
• Inverting the flow of computation in tree-like recursive functions. E.A. Boiten. In P.M.G. Apers, D. Bosman, and J. van Leeuwen, editors, Computing Science in the Netherlands 1989, pages 33-56, Amsterdam, November 1989. Stichting Mathematisch Centrum. Superseded by cite159.
• On the implementation of functional programming languages. Richard E. Jones. Master's thesis, UKC Computing Laboratory, September 1989.
• Cyclic reference counting with local mark-scan. Rafael D Lins. Technical Report 65*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, July 1989.
• A Logic for Miranda. Simon Thompson. Formal Aspects of Computing, (1), July 1989.
• Weak density and cupping in the d-r.e. degrees. S.B. Cooper, S. Lempp, and P. Watson. Israel Journal of Mathematics, 67(1):137-152, January 1989.
• Least sorts in order-sorted term rewriting. P. Watson and A.J.J. Dick. Technical Report CSD-TR-606, Royal Holloway and Bedford New College, University of London, January 1989.
• Concerning T-degrees of d-r.e. sets and e-reducibility of sigma_2 sets. P.R. Watson. PhD thesis, December 1988.
• Een syntax assisted editor. E.A. Boiten. Master's thesis, Universiteit Twente, January 1988. in Dutch.
• Implementation of a Relational Language for Microcomputers. ALC Cavalcanti, D Florissi, PG Soares, and TCS Melo. In 7th Conference of the Brazilian Computer Society, pages 441-451, 1987. (in Portuguese).
• Specification and verification of digital systems. F. K. Hanna and N. Daeche. In Proc Conf on Logic and its Application to Computer Science, pages 73-143, 1987. University of Newcastle upon Type, UK.
• A Language for a Relational Database Management System. R Sanches, SS Sette, ALC Cavalcanti, D Florissi, PG Soares, and TCS Melo. In 2nd Brazilian Symposium on Databases, 1987. (in Portuguese).
• Interactive functional programs: a method and a formal semantics. Simon Thompson. Technical Report 48*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, November 1987.
• Purely functional implementation of a logic. F. K. Hanna and N. Daeche. In Proc. 8th Intnl. Conf. on Automated Deduction, pages 598-607. Springer Verlag, 1986. LNCS 230.
• Specification and verification using higher-order logic: A case study. F. K. Hanna and N. Daeche. In Milne and Subrahmanyam, editors, Formal Aspects of VLSI Design, pages 179-213. North Holland, 1986.
• Proving properties of functions defined on lawful types. Simon Thompson. Technical Report 37*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, May 1986.
• A generator for Turing machine simulation programs - user's manual. P.R.J. Asveld and E.A. Boiten. Memorandum INF-86-31, Universiteit Twente, January 1986.
• Specification and verification using higher-order logic. F. K. Hanna and N. Daeche. In Koomen and Moto-oka, editors, Computer Hardware Description Languages and their Applications, pages 418-433. North Holland, 1985.