Programming Languages and Systems Research Group

Publications

• Refereed journal, conference and workshop publications
• PhD theses supervised in the group
• Other publications

Refereed journal, conference and workshop publications

2013

• Christopher M. Poskitt and Detlef Plump. Verifying total correctness of graph programs. In Graph Computation Models (GCM 2012), Revised Selected Papers, volume 61 of Electronic Communications of the EASST, 2013. (PDF)

2012

• Christopher Bak and Detlef Plump. Rooted graph programs. In Proc. International Workshop on Graph Based Tools (GraBaTs 2012), volume 54 of Electronic Communications of the EASST, 2012. (PDF)

• Annegret Habel and Detlef Plump. M,N-adhesive transformation systems. In Proc. International Conference on Graph Transformation (ICGT 2012), volume 7562 of Lecture Notes in Computer Science, pages 218–233. Springer-Verlag, 2012. (PDF)

• Matthew Naylor and Colin Runciman. The Reduceron reconfigured and re-evaluated. Journal of Functional Programming, 22(4–5):574–613, 2012. (PDF)

• Detlef Plump. The design of GP 2. In Proc. International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011), volume 82 of Electronic Proceedings in Theoretical Computer Science, pages 1–16, 2012. (PDF)

• Christopher M. Poskitt. Verification of graph programs. In Proc. International Conference on Graph Transformation (ICGT 2012), volume 7562 of Lecture Notes in Computer Science, pages 420–422. Springer-Verlag, 2012. (PDF)

• Christopher M. Poskitt and Detlef Plump. Hoare-style verification of graph programs. Fundamenta Informaticae, 118(1-2):135–175, 2012. (PDF)

• Christopher M. Poskitt and Detlef Plump. Verifying total correctness of graph programs. In Proc. International Workshop on Graph Computation Models (GCM 2012), 2012.

• Jason Reich, Matthew Naylor, and Colin Runciman. Lazy generation of canonical test programs. In Implementation and Application of Functional Languages (IFL 2011, Revised Selected Papers), pages 69–84. Springer LNCS 7257, 2012. (PDF)

2011

• Michael J. Banks and Jeremy L. Jacob. Confidentiality annotations for Circus. In Christopher M. Poskitt, editor, Proceedings of the Fourth York Doctoral Symposium on Computer Science (YDS 2011), pages 15–24. Department of Computer Science, University of York, UK, October 2011. (PDF)

• Michael J. Banks and Jeremy L. Jacob. Specifying confidentiality in Circus. In FM 2011: Formal Methods, volume 6664 of Lecture Notes in Computer Science, pages 215–230. Springer Berlin / Heidelberg, 2011. (PDF)

• Detlef Plump, Robin Suri, and Ambuj Singh. Minimizing finite automata with graph programs. In Graph Computation Models (GCM 2010), Revised Selected Papers, volume 39 of Electronic Communications of the EASST, 2011. (PDF)

• Yining Zhao and Alan Wood. Treaties: Behaviour-controlling capabilities. 2nd Annual International Conference on Advances in Distributed and Parallel Computing (ADPC 2011), 2011. (PDF)

2010

• Michael J. Banks and Jeremy L. Jacob. Calculated secure processes. In Alvaro Miyazawa, editor, Proceedings of the Third York Doctoral Symposium on Computing (YDS 2010), pages 19–28. Department of Computer Science, University of York, UK, November 2010. (PDF)

• Michael J. Banks and Jeremy L. Jacob. On modelling user observations in the UTP. In Shengchao Qin, editor, 3rd International Symposium on Unifying Theories of Programming (UTP 2010), volume 6445 of Lecture Notes in Computer Science, pages 101–119. Springer Berlin / Heidelberg, 2010. (PDF)

• Michael J. Banks and Jeremy L. Jacob. Unifying theories of confidentiality. In Shengchao Qin, editor, 3rd International Symposium on Unifying Theories of Programming (UTP 2010), volume 6445 of Lecture Notes in Computer Science, pages 120–136. Springer Berlin / Heidelberg, 2010. (PDF)

• Matthew Naylor and Colin Runciman. The Reduceron Reconfigured. In ICFP '10: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, pages 75–86, 2010. (PDF)

• Detlef Plump. Checking graph-transformation systems for confluence. In Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday, volume 26 of Electronic Communications of the EASST, 2010. (PDF)

• Detlef Plump. Graph programs. In Proc. International Workshop on Strategies in Rewriting, Proving, and Programming (IWS 2010), pages 39–44, 2010. (PDF)

• Detlef Plump and Sandra Steinert. The semantics of graph programs. In Proc. Rule-Based Programming (RULE 2009), volume 21 of Electronic Proceedings in Theoretical Computer Science, pages 27–38, 2010. (PDF)

• Christopher M. Poskitt and Detlef Plump. A Hoare calculus for graph programs. In Proc. International Conference on Graph Transformation (ICGT 2010), volume 6372 of Lecture Notes in Computer Science, pages 139–154. Springer-Verlag, 2010. (PDF)

• Christopher M. Poskitt and Detlef Plump. Hoare logic for graph programs. In Proc. THEORY Workshop at Verified Software: Theories, Tools and Experiments (VS-THEORY 2010), 2010. (PDF)

• Jason S. Reich, Matthew Naylor, and Colin Runciman. Supercompilation and the Reduceron. Proceedings of the Second International Workshop on Metacomputation in Russia, 2010. (PDF)

2009

• Mike Dodds and Detlef Plump. From hyperedge replacement to separation logic and back. In Proc. Doctoral Symposium at the International Conference on Graph Transformation (ICGT-DS 2008), volume 16 of Electronic Communications of the EASST, 2009. (PDF)

• David Duke, Rita Borgo, Colin Runciman, and Malcolm Wallace. Huge data but small programs: visualization design via multiple embedded DSLs. In Practical Aspects of Declarative Languages, number 5418 in LNCS, pages 31–45, Savannah, GA, January 2009. Springer. (PDF)

• Neil Mitchell and Colin Runciman. Losing functions without gaining data — another look at defunctionalisation. In Haskell '09: Proceedings of the ACM SIGPLAN 2008 Haskell Symposium, pages 13–24, New York, NY, USA, 2009. ACM. (PDF)

• Matthew Naylor and Colin Runciman. Expressible sharing for functional circuit description. Higher-Order and Symbolic Computation, 2009. (PDF)

• Detlef Plump. The graph programming language GP. In Proc. Algebraic Informatics, Third International Conference (CAI 2009), volume 5725 of Lecture Notes in Computer Science, pages 99–122. Springer-Verlag, 2009. (PDF)

2008

• Xun Dong, John A. Clark, and Jeremy L. Jacob. Modelling user-phishing interaction. In 2008 Conference on Human System Interactions, pages 627–632. IEEE, May 2008.

• Xun Dong, John A. Clark, and Jeremy L. Jacob. Threat modelling in user performed authentication. In Information and Communication Security, number 5308 in Lecture Notes in Computer Science, pages 49–64, 2008.

• Xun Dong, John A. Clark, and Jeremy L. Jacob. User behaviour based phishing websites detection. In International multiconference on Computer Science and Information Technology, pages 783–790. IEEE Press, 2008.

• David Duke, Rita Borgo, Colin Runciman, and Malcolm Wallace. Experience report: Visualizing data through functional pipelines. In International Conference on Functional Programming, pages 379–382, Victoria, BC, September 2008. ACM Press. (PDF)

• Ronaldo Menezes Lyndon Nixon, Robert Tolksdorf and Alan Wood. Coordinating Knowledge in Pervasive Environments. Ubiquitous Computing and Communication Journal, 3, 2008. (PDF)

• Greg Manning and Detlef Plump. The GP programming system. In Proc. Graph Transformation and Visual Modelling Techniques (GT-VMT 2008), volume 10 of Electronic Communications of the EASST, 2008. (PDF)

• Greg Manning and Detlef Plump. The York abstract machine. In Proc. Graph Transformation and Visual Modelling Techniques (GT-VMT 2006), volume 211 of Electronic Notes in Theoretical Computer Science, pages 231–240. Elsevier, 2008. (PDF)

• Neil Mitchell and Colin Runciman. Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching. In Haskell '08: Proceedings of the ACM SIGPLAN 2008 Haskell Symposium, pages 49–60, New York, NY, USA, 2008. ACM. (PDF)

• Neil Mitchell and Colin Runciman. A supercompiler for core haskell. In Implementation and Application of Functional Languages (IFL 2007, Revised Selected Papers), pages 147–164. Springer LNCS 5083, 2008. (PDF)

• Matthew Naylor and Colin Runciman. The Reduceron: Widening the von Neumann bottleneck for graph reduction using an FPGA. In Implementation and Application of Functional Languages (IFL 2007, Revised Selected Papers), pages 129–146. Springer LNCS 5083, 2008. (PDF)

• Colin Runciman, Matthew Naylor, and Fredrik Lindblad. Smallcheck and lazy smallcheck: automatic exhaustive testing for small values. In Haskell '08: Proceedings of the ACM SIGPLAN 2008 Haskell Symposium, pages 37–48, New York, NY, USA, 2008. ACM. (PDF)

• Gabriele Taentzer, Enrico Biermann, Dénes Bisztray, Bernd Bohnet, Iovka Boneva, Artur Boronat, Leif Geiger, Rubino Geiß, Ákos Horvath, Ole Kniemeyer, Tom Mens, Benjamin Ness, Detlef Plump, and Tamás Vajk. Generation of Sierpinski triangles: A case study for graph transformation tools. In Applications of Graph Transformation with Industrial Relevance (AGTIVE 2007), Revised Selected and Invited Papers, volume 5088 of Lecture Notes in Computer Science, pages 514–539. Springer-Verlag, 2008. (PDF)

• Malcolm Wallace. Partial parsing: combining choice with commitment. In Implementation and Application of Functional Languages (IFL) 2007, number 5083 in LNCS, pages 93–110, Freiburg, 2008. Springer. (PDF, 17 pages, 628093 bytes)

2007

• G. Ciardo, G. Lüttgen, and A.S. Miner. Exploiting interleaving semantics in symbolic state-space generation. Formal Methods in System Design, 31(1):63–100, 2007. (PDF)

• R. Cleaveland, G. Lüttgen, and V. Natarajan. Priority and abstraction in process algebra. Information and Computation, 205(9):1426–1458, 2007. (PDF)

• J. Ezekiel, G. Lüttgen, and G. Ciardo. Parallelising symbolic state-space generators. In W. Damm and H. Hermanns, editors, 19th Intl. Conference on Computer Aided Verification (CAV 2007), volume 4590 of Lecture Notes in Computer Science, pages 268–280, Berlin, Germany, July 2007. Springer-Verlag. (PDF)

• J. Ezekiel, G. Lüttgen, and R. Siminiceanu. Can Saturation be parallelised? on the parallelisation of a symbolic state-space generator. In L. Brim, B. Haverkort, M. Leucker, and J. van de Pol, editors, 5th Intl. Workshop on Parallel and Distributed Methods of Verification (PDMC 2006), volume 4346 of Lecture Notes in Computer Science, pages 331–346, Bonn, Germany, August 2007. Springer-Verlag. (PDF)

• Andy Gill and Colin Runciman. Haskell program coverage. In Haskell '07: Proceedings of the ACM SIGPLAN 2007 Haskell Workshop, pages 1–12, New York, NY, USA, 2007. ACM. (PDF)

• G. Lüttgen and W. Vogler. Conjunction on processes: Full-abstraction via ready-tree semantics. Theoretical Computer Science, 373:19–40, 2007. (PDF)

• G. Lüttgen and W. Vogler. Ready simulation for concurrency: It's logical! In C. Cachin, T. Jurdzinski, and A. Tarlecki, editors, 34th Intl. Colloquium on Automata, Languages and Programming (ICALP 2007), volume 4596 of Lecture Notes in Computer Science, pages 752–763, Wroclaw, Poland, July 2007. Springer-Verlag. (PDF)

• M. Mendler and G. Lüttgen. Is observational congruence axiomatisable in equational horn logic? In L. Caires and V. T. Vasconcelos, editors, 18th International Conference on Concurrency Theory (CONCUR 2007), volume 4703 of Lecture Notes in Computer Science, pages 197–211, Lisbon, Portugal, September 2007. Springer-Verlag. (PDF)

• Neil Mitchell and Colin Runciman. A static checker for safe pattern matching in Haskell. In Marko van Eekelen, editor, Trends in Functional Programming, volume 6, pages 15–30. Intellect, 2007. (PDF)

• Neil Mitchell and Colin Runciman. A static checker for safe pattern matching in Haskell. In Marko van Eekelen, editor, Trends in Functional Programming, volume 6, pages 15–30. Intellect, 2007. (PDF)

• Neil Mitchell and Colin Runciman. Uniform boilerplate and list processing. In Haskell '07: Proceedings of the ACM SIGPLAN 2007 Haskell Workshop, pages 49–60, New York, NY, USA, 2007. ACM. (PDF)

• J.-T. Mühlberg and G. Lüttgen. BLASTing Linux code. In L. Brim, B. Haverkort, M. Leucker, and J. van de Pol, editors, 11th Intl. Workshop on Formal Methods for Industrial Critical Systems (FMICS 2006), volume 4346 of Lecture Notes in Computer Science, pages 211–226, Bonn, Germany, August 2007. Springer-Verlag. (PDF)

• Matthew Naylor and Colin Runciman. Finding inputs that reach a target expression. In SCAM '07: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation, pages 133–142, Washington, DC, USA, 2007. IEEE Computer Society. (PDF)

• Matthew Naylor, Emil Axelsson, and Colin Runciman. A functional-logic library for Wired. In Haskell '07: Proceedings of the ACM SIGPLAN 2007 Haskell Workshop, pages 37–48, New York, NY, USA, 2007. ACM. (PDF)

• L. Nixon, R. Tolksdorf, A.M. Wood, and R. Menezes. Co-ordinating Knowledge in Pervasive Environments. In Proc. 16th IEEE Int. Workshop on Enabling Technologies: Infrastructures for Collaborative Enterprises, WETICE07, page to appear. IEEE, 2007.

• Nur Izura Udzir, Alan M. Wood, and Jeremy L. Jacob. Coordination with multicapabilities. Science of Computer Programming: Special Issue on Coordination Models and Languages, 64(2):205–222, January 2007.

• Nur Izura Udzir, Alan M. Wood, and Jeremy L. Jacob. Coordination with Multicapabilities. Science of Computer Programming, 64(2):205–222, 2007.

• A.J. Yu, G. Ciardo, and G. Lüttgen. Bounded reachability checking of asynchronous systems using decision diagrams. In 13th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2007), volume 4424 of Lecture Notes in Computer Science, pages 648–663, Braga, Portugal, April 2007. Springer-Verlag. (PDF)

• A.J. Yu, G. Ciardo, and G. Lüttgen. Improving static variable orders via invariants. In 28th Intl. Conf. on Application and Theory of Petri Nets and Other Models of Concurrency (Petri Nets 2007), volume 4546 of Lecture Notes in Computer Science, pages 83–103, Siedlce, Poland, June 2007. Springer-Verlag. (PDF)

2006

• Rita Borgo, David Duke, Malcolm Wallace, and Colin Runciman. Multi-cultural visualization: how functional programming can enrich visualization (and vice versa). In Vision, Modelling and Visualization (VMV), Aachen, Nov 2006. (PDF)

• Mike Dodds and Detlef Plump. Extending C for checking shape safety. In Proc. Graph Transformation for Verification and Concurrency (GT-VC 2005), volume 154(2) of Electronic Notes in Theoretical Computer Science. Elsevier, 2006. (PDF)

• Mike Dodds and Detlef Plump. Graph transformation in constant time. In Proc. International Conference on Graph Transformation (ICGT 2006), volume 4178 of Lecture Notes in Computer Science, pages 367–382. Springer-Verlag, 2006. (PDF)

• David Duke, Malcolm Wallace, Rita Borgo, and Colin Runciman. Fine-grained visualization pipelines and lazy functional languages. IEEE Transactions on Visualization and Computer Graphics, 12(5):973–980, Sept 2006. (PDF)

• G. Lüttgen and W. Vogler. Bisimulation on speed: A unified approach. Theoretical Computer Science, 360:209–227, 2006. (PDF)

• G. Lüttgen and W. Vogler. Conjunction on processes: Full-abstraction via ready-tree semantics. In L. Aceto and A. Ingólfsdóttir, editors, 9th Intl. Conf. on Foundations of Software Science and Computation Structures (FOSSACS 2006), volume 3921 of Lecture Notes in Computer Science, pages 261–276, Vienna, Austria, April 2006. Springer-Verlag. (PDF)

• R. Menezes and A.M. Wood. The Fading Concept in Tuple-Space Systems. In SAC '06: Proceedings of the 2006 ACM Symposium on Applied Computing, pages 440–444. ACM Press, 2006.

• Jan Tobias Mühlberg and Gerald Lüttgen. Blasting Linux Code. In Proceedings of the 11th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2007), Bonn, Germany, number 4346 in Lecture Notes in Computer Science, pages 211–226. Springer Verlag, 2006. (PDF)

• Nur Izura Udzir and Alan Wood. Establishing private communications in open systems using multicapabilities. In Proceedings of the Second IEEE International Conference on Information and Communication Technologies: From Theory to Applications (ICTTA’06), April 24-28 2006. (PDF)

2005

• N. Cataño. Combining symbolic execution and model checking to reduce dynamic program analysis overhead. The Colombian Journal of Computation, 6(1), Jun. 2005.

• N. Cataño. Formal modeling of a slicing algorithm for java event spaces in PVS. In J. Hurd and T. Melham, editors, Proceedings in Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs, volume 3603 of Lecture Notes in Computer Science, pages 82–97, Oxford, UK, Aug. 22–25 2005. Springer-Verlag.

• G. Lüttgen and W. Vogler. Bisimulation on speed: A unified approach. In Sassone [Sassone, 2005], pages 79–94. (PDF)

• G. Lüttgen and W. Vogler. Bisimulation on speed: Lower time bounds. RAIRO – Theoretical Informatics and Applications, 39:587–618, 2005. (PDF)

• Detlef Plump. Confluence of graph transformation revisited. In Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, and Roel de Vrijer, editors, Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday, volume 3838 of Lecture Notes in Computer Science, pages 280–308. Springer-Verlag, 2005. (PDF)

• V. Sassone, editor. International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2005), volume 3441 of Lecture Notes in Computer Science, Edinburgh, Scotland, April 2005. Springer-Verlag.

• Nur Izura Udzir, Alan M. Wood, and Jeremy L. Jacob. Coordination with multicapabilities. In Jean-Marie Jacquet and Gian Pietro Picco, editors, Proceedings of the Seventh International Conference on Coordination Models and Languages, LNCS 3454, pages 79–93. Springer-Verlag, Berlin Hiedelberg, April 2005.

• Nur Izura Udzir, Alan M. Wood, and Jeremy L. Jacob. Coordination with Multicapabilities. In Coordination Models and Langauges , volume LNCS 3454, pages 79–108. Springer Verlag, 2005.

• Malcolm Wallace. Modular architectural representation and analysis of fault propagation and transformation. In FESCA'05: Formal Foundations of Embedded Systems and Component-Based Software Architectures, volume ENTCS 799, pages 46–63, Edinburgh, April 2005. Elsevier. (PDF, 18 pages, 347588 bytes)

• Andrew Wilkinson and Alan Wood. Isomorphic types for open coordination systems. In Proceedings of the 17th IASTED Int. Conf. Parallel and Distributed Computing and Systems, pages 404–408, 2005. (PDF)

• Andrew Wilkinson and Alan M. Wood. Isomorphic Types for Open Coordination Systems. In Proc. 17th IASTED Int. Conf. on Parallel and Distributed Computing and Systems 2005, pages 404–408, 2005.

2004

• Adam Bakewell, Detlef Plump, and Colin Runciman. Checking the shape safety of pointer manipulations. In Int. Seminar on Relational Methods in Computer Science (RelMiCS 7), Revised Selected Papers, volume 3051 of Lecture Notes in Computer Science, pages 48–61. Springer-Verlag, 2004. (PDF)

• Adam Bakewell, Detlef Plump, and Colin Runciman. Specifying pointer structures by graph reduction. Mathematical Structures in Computer Science, 2004. To appear.

• Adam Bakewell, Detlef Plump, and Colin Runciman. Specifying pointer structures by graph reduction. In Int. Workshop Applications of Graph Transformations With Industrial Relevance (AGTIVE 2003), Revised Selected and Invited Papers, volume 3062 of Lecture Notes in Computer Science, pages 30–44. Springer-Verlag, 2004. (PDF)

• C. Breunesse, N. Cataño, M. Huisman, and B. Jacobs. Formal methods for Smart Cards: an experience report. Science of Computer Programming, Issues 1–3, 51:55–80, March 2004.

• Hao Chen, John A. Clark, and Jeremy L. Jacob. Automated design of security protocols. Computational Intelligence, 20(3):503–516, 2004.

• Hao Chen, John A. Clark, and Jeremy L. Jacob. Synthesizing efficient and effective security protocols. In Automated Reasoning for Security Protocol Analysis, pages 25–40. IJCAR 2004 Workshop W6, ENTCS, July 2004. Available from http://www.avispa-project.org/arspa/arspa-informal-proceedings.pdf.

• O. Chitil, D. McNeill, and C. Runciman. Lazy assertions. In Implementation of Functional Languages: 15th International Workshop, selected papers from IFL'03, pages 1–19. Springer LNCS 3145, November 2004. (PDF)

• John A. Clark, Jeremy L. Jacob, Subhamoy Maitra, and Pantelimon Stanica. Almost Boolean functions: The design of Boolean functions by spectral inversion. Computational Intelligence, 20(3):450–462, August 2004.

• John A. Clark, Jeremy L. Jacob, and Susan Stepney. The design of S-boxes by simulated annealing. In Conference on Evolutionary Computation: special session on Security and Cryptology, Portland, Oregon, June 2004.

• John A. Clark, Jeremy L. Jacob, and Susan Stepney. Searching for cost functions. In Conference on Evolutionary Computation: special session on Security and Cryptology, Portland, Oregon, June 2004.

• G. Lüttgen and W. Vogler. Bisimulation on speed: Lower time bounds. In I. Walukiewicz, editor, International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2004), volume 2987 of Lecture Notes in Computer Science, pages 333–347, Barcelona, Spain, April 2004. Springer-Verlag. (PDF)

• G. Lüttgen and W. Vogler. Bisimulation on speed: Worst-case efficiency. Information and Computation, 191(2):105–144, 2004. (PDF)

• Detlef Plump and Sandra Steinert. Towards graph programs for graph algorithms. In Proc. International Conference on Graph Transformation (ICGT 2004), volume 3256 of Lecture Notes in Computer Science, pages 128–143. Springer-Verlag, 2004. (PDF)

• N.I. Udzir and A.M. Wood. Implementing Contract Net in Tuple Space Models. In Proc. IASTED Int. Conf. on Parallel and Distributed Computing and Networks 2004, pages 325–330, 2004.

• N.I. Udzir and A.M. Wood. Multicapabilities for Distributed Resource Management in Open Systems. In Proc. IASTED Int. Conf. on Parallel and Distributed Computing and Systems 2004, pages 157–162, 2004.

• Nur Izura Udzir and Alan Wood. Implementing Contract Net in tuple space models. In M. H. Hamza, editor, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks (PDCN 2004), pages 325–330. ACTA Press, February 17–19 2004. (PostScript)

• Nur Izura Udzir and Alan Wood. Multicapabilities for distributed resource management in open systems. In T. Gonzalez, editor, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2004), pages 157–162. ACTA Press, Nov 9-11 2004. (PostScript)

2003

• J. Aguado, M. Mendler, and G. Lüttgen. A-maze-ing esterel. In A. Girault, F. Maraninchi, and E. Rutten, editors, International Workshop on Synchronous Languages, Applications, and Programming (SLAP 2003), volume 88 of Electronic Notes in Computer Science. Elsevier Science, 2003. (PDF)

• N. Amàlio and F. Polack. Comparison of formalisation approaches of UML class constructs in Z and Object-Z. In ZB2003,: Formal specification and development in Z and B, Turku, Finland, volume 2651 of LNCS, pages 339–358. Springer Verlag, June 2003.

• N. Amálio, S. Stepney, and F. Polack. Modular UML semantics: Interpretations in Z based on templates and generics. In FACS'03 Workshop on Formal Aspects of Component Software, FME2003, Pisa, Italy, September 2003.

• Hao Chen, John A. Clark, and Jeremy L. Jacob. Automated design of security protocols. In Proceedings of the 2003 Congress on Evolutionary Computation, pages 2181–2188. IEEE Press, December 2003.

• Olaf Chitil, Colin Runciman, and Malcolm Wallace. Transforming Haskell for tracing. In Proceedings of the 14th International Workshop on Implementation of Functional Languages (IFL 2002), LNCS 2670, pages 165–181, 2003. (PDF)

• K. Claessen, C. Runciman, O. Chitil, R. J. M. Hughes, and M. Wallace. Testing and tracing lazy functional programs using QuickCheck and Hat. In Advanced Functional Programming 4th International School, AFP'02, pages 59–99. Springer LNCS 2638, February 2003. (PDF)

• John A. Clark, Jeremy L. Jacob, Subhamoy Maitra, and Pantelimon Stanica. Almost Boolean functions: The design of Boolean functions by spectral inversion. In Conference on Evolutionary Computation: Special session Evolutionary Computation and Computer Security, Canberra, Australia, December 2003. IEEE.

• John A. Clark, Jeremy L. Jacob, and Susan Stepney. Secret agents leave big footprints: How to plant a cryptographic trapdoor, and why you might not get away with it. In Erick Cantú-Paz, James A. Foster, Kalyanmoy Deb, Lawrence Davis, Rajkumar Roy, Una-May O'Reilly, Hans-Georg Beyer, Russell K. Standish, Graham Kendall, Stewart W. Wilson, Mark Harman, Joachim Wegener, Dipankar Dasgupta, Mitchell A. Potter, Alan C. Schultz, Kathryn A. Dowsland, Natasa Jonoska, and Julian F. Miller, editors, Genetic and Evolutionary Computation — GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12–16, 2003. Proceedings, Part II, volume 2724 of Lecture Notes in Computer Science, pages 2022–2033. Springer, 2003.

• T. Srivatanakul, J. A. Clark, S. Stepney, and F. Polack. Challenging formal specifications by mutation: a CSP security example. In Proceedings of the Asia Pacific Security Conference, APSEC2003, Chiang Mai, Thailand. IEEE, December 2003. To Appear.

• S. Stepney, F. Polack, and I. Toyn. An outline pattern language for Z: five illustrations and two tables. In ZB2003,: Formal specification and development in Z and B, Turku, Finland, volume 2651 of LNCS, pages 2–19. Springer Verlag, June 2003.

• S. Stepney, F. Polack, and I. Toyn. Patterns to guide practical refactoring: examples targetting promotion in Z. In ZB2003,: Formal specification and development in Z and B, Turku, Finland, volume 2651 of LNCS, pages 20–39. Springer Verlag, June 2003.

• Joe Wells, Detlef Plump, and Fairouz Kamareddine. Diagrams for meaning preservation. In Proc. Rewriting Techniques and Applications (RTA 2003), volume 2706 of Lecture Notes in Computer Science, pages 88–106. Springer-Verlag, 2003. (PDF)

2002

• Adam Bakewell. Using term-graph rewriting models to analyse relative space efficiency. In TERMGRAPH 2002 International Workshop on Term Graph Rewriting, volume 72 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002. (PostScript)

• L. Brim, P. Jancar, M. Kretinsky, and A. Kucera, editors. 13th International Conference on Concurrency Theory (CONCUR 2002), volume 2421 of Lecture Notes in Computer Science, Brno, Czech Republic, August 2002. Springer-Verlag.

• John A. Clark and Jeremy L. Jacob. The heuristic evolution of security and insecurity. ERCIM News, 49:18–19, April 2002. A publication of the European Consortium for Informatics and Mathematics.

• John A. Clark, Jeremy L. Jacob, Susan Stepney, Subhamoy Maitra, and William Millan. Evolving boolean functions satisfying multiple criteria. In Alfred Menezes and Palash Sarkar, editors, Progress in Cryptology — INDOCRYPT 2002, Third International Conference on Cryptology in India, Hyderabad, India, December 16–18, 2002, volume 2551 of Lecture Notes in Computer Science, pages 246–259. Springer, 2002.

• R. Cleaveland and G. Lüttgen. A logical process calculus. In U. Nestmann and P. Panangaden, editors, 9th International Workshop on Expressiveness in Concurrency (EXPRESS 2002), volume 68,2 of ENTCS, Brno, Czech Republic, August 2002. Elsevier Science. (PDF)

• Frank Drewes, Berthold Hoffmann, and Detlef Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64(2):249–283, 2002. (PDF)

• Nathalie Foster and Jeremy L. Jacob. Hazard analysis for security protocol requirements. In Bart De Decker, Frank Pieseens, Jan Smits, and Els Van Herreweghen, editors, Advances in Network and Distributed Systems Security, pages 75–92. IFIP TC11 WG11.4, Kluwer Academic, 2002. Proceedings of the First International Conference on Network Security (I-NetSec 01).

• Annegret Habel and Detlef Plump. Relabelling in graph transformation. In Proc. International Conference on Graph Transformation (ICGT 2002), volume 2505 of Lecture Notes in Computer Science, pages 135–147. Springer-Verlag, 2002. (PDF)

• Annegret Habel and Detlef Plump. Solving equations by graph transformation. In Proc. GETGRATS Closing Workshop, volume 51 of Electronic Notes in Theoretical Computer Science, pages 165–176. Elsevier Science Publishers, 2002. (PDF)

• R. Laleau and F. Polack. Coming and going from UML to B : a proposal to support traceability in rigorous is development. In ZB2002, second international conferene of B and Z users, Grenoble, France, volume 2272 of LNCS, pages 517–534. Springer Verlag, January 2002.

• G. Lüttgen and M. Mendler. Axiomatizing an algebra of step reactions for synchronous languages. In Brim et al. [Brim et al., 2002], pages 386–401. (PDF)

• G. Lüttgen and M. Mendler. The intuitionism behind statecharts steps. ACM Transactions on Computational Logic, 3(1):1–41, 2002. (PDF)

• G. Lüttgen and M. Mendler. Towards a model-theory for esterel. In F. Maraninchi, A. Girault, and E. Rutten, editors, Workshop on Synchronous Languages, Applications, and Programming (SLAP 2002), volume 65,5 of ENTCS, Grenoble, France, April 2002. Elsevier Science. (PDF)

• Detlef Plump. Essentials of term graph rewriting. In Proc. GETGRATS Closing Workshop, volume 51 of Electronic Notes in Theoretical Computer Science, pages 277––289. Elsevier Science Publishers, 2002. (PDF)

• S. Stepney, F. Polack, and I. Toyn. Refactoring in maintenance and development of Z specifications and proofs. In REFINE 2002, BCS-FACS Refinement Workshop, Copenhagen, July 2002.

2001

• A. Bakewell and C. Runciman. A space semantics for core haskell. In Proc. ACM SIGPLAN Haskell Workshop 2000, volume 41, 2001. (PDF)

• Olaf Chitil. Compositional explanation of types and algorithmic debugging of type errors. In Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP'01), pages 193–204, 2001. (PDF)

• O. Chitil, C. Runciman, and M. Wallace. Freja, hat and hood — a comparative evaluation of three systems for tracing and debugging lazy functional programs. In Implementation of Functional Languages: selected papers from 12th Intl. Workshop (IFL'00), pages 176–193. Springer LNCS 2011, 2001. (PDF)

• G. Ciardo, G. Lüttgen, and R. Siminiceanu. Saturation: An efficient iteration strategy for symbolic state-space generation. In 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), volume 2031 of Lecture Notes in Computer Science, pages 328–342, Genova, Italy, April 2001. Springer-Verlag. (PDF)

• John A. Clark and Jeremy L. Jacob. Protocols are programs too: The meta-heuristic search for security protocols. Information and Software Technology, 43(14):891–904, December 2001.

• Annegret Habel and Detlef Plump. Computational completeness of programming languages based on graph transformation. In Proc. Foundations of Software Science and Computation Structures (FOSSACS 2001), volume 2030 of Lecture Notes in Computer Science, pages 230–245. Springer-Verlag, 2001. (PDF)

• Annegret Habel, Jürgen Müller, and Detlef Plump. Double-pushout graph transformation revisited. Mathematical Structures in Computer Science, 11(5):637–688, 2001. (PDF)

• R. Laleau and F. Polack. Specification of integrity-preserving operations in information systems by using a formal UML-based language. Information and Software Technology, 43(12):693–704, November 2001.

• K.G. Larsen and M. Nielsen, editors. 12th International Conference on Concurrency Theory (CONCUR 2001), volume 2154 of Lecture Notes in Computer Science, Aalborg, Denmark, August 2001. Springer-Verlag.

• G. Lüttgen and M. Mendler. Statecharts: From visual syntax to model-theoretic semantics. In K. Bauknecht, W. Brauer, and Th. Mück, editors, Informatik 2001: Wirtschaft und Wissenschaft in der Network Economy - Visionen und Wirklichkeit, volume 1, chapter Workshop on Integrating Diagrammatic and Formal Specification Techniques, pages 615–621. Austrian Computer Society, Vienna, Austria, September 2001. (PDF)

• G. Lüttgen and W. Vogler. A faster-than relation for asynchronous processes. In Larsen and Nielsen [Larsen and Nielsen, 2001], pages 262–276. (PDF)

• T. Matsushita and C. Runciman. The accepting power of unary string logic programs. Theoretical Computer Science, 266:59–79, 2001. (PDF)

• R. Menezes, R. Tolksdorf, and A.M. Wood. Scalability in Linda-like Coordination Systems. In A. Omicini, F. Zambonelli, M. Klusch, and R.Tolksdorf, editors, Coordination of Internet Agents, pages 299–319. Springer, 2001.

• G. E. Moss and C. Runciman. Inductive benchmarking for purely functional data structures. Journal of Functional Programming, 11(5):525–556, 2001. (PDF)

• F. Polack. A case study using lightweight formalism to review an information system specification. Software Practice and Experience, 31(8):57–80, July 2001.

• F. Polack and R. Laleau. A rigorous metamodel for UML static conceptual modelling of information systems. In CAiSE2001: 13th International Conference on Advanced Information Systems Engineering, Interlaken, Switzerland, volume 2068 of LNCS, pages 402–416. Springer Verlag, June 2001.

• Andreas Schaad, Jonathan Moffett, and Jeremy Jacob. The role-based access control system of a European bank: A case study and discussion. In Trent Jaeger, editor, Proceedings of the Sixth ACM Symposium on Access Control Models and Technologies (SACMAT 2001), pages 3–9. ACM SIGSAC, ACM Press, May 2001.

• M. Wallace, O. Chitil, T. Brehm, and C. Runciman. Multiple-view tracing for haskell: a new hat. In Proc. ACM SIGPLAN Haskell Workshop, pages 151–170, 2001. (PDF)

2000

• Zena M. Ariola, Jan Willem Klop, and Detlef Plump. Bisimilarity in term graph rewriting. Information and Computation, 156(1/2):2–24, 2000. (PDF)

• A. Bakewell and C. Runciman. A model for comparing the space usage of lazy evaluators. In Proc. 2nd Intl. ACM Conf. on Principles and Practice of Declarative Programming (PPDP'00), pages 151–162, Montreal, September 2000. ACM Press. (PDF)

• Adam Bakewell and Colin Runciman. The space usage problem: An evaluation kit for graph-reduction semantics. In S. Gilmore, editor, Trends in Functional Programming 2: Selected papers from the 2nd Scottish Functional Programming Workshop (SFP00), pages 115–128. Intellect Books, 2000. (PDF)

• G. Ciardo, G. Lüttgen, and R. Siminiceanu. Efficient symbolic state–space construction for asynchronous systems. In M. Nielsen and D. Simpson, editors, 21st International Conference on Application and Theory of Petri Nets (ICATPN 2000), volume 1839 of Lecture Notes in Computer Science, pages 103–122, Aarhus, Denmark, June 2000. Springer-Verlag. (PDF)

• John A. Clark and Jeremy L. Jacob. Searching for a solution: Engineering tradeoffs and the evolution of provably secure protocols. In Michael Reiter and Roger Needham, editors, Proceedings of the 2000 IEEE Symposium on Security and Privacy, pages 82–95. IEEE Computer Society, May 2000.

• John A. Clark and Jeremy L. Jacob. Two-stage optimisation in the design of boolean functions. In Ed Dawson, Andrew Clark, and Colin Boyd, editors, Information Security and Privacy: Proceeding of the 5th Australian Conference (ACSIP 2000), number 1841 in Lecture Notes in Computer Science, pages 242–254. Springer, July 2000.

• R. Cleaveland and G. Lüttgen. A semantic theory for heterogeneous system design. In S. Kapoor and S. Prasad, editors, 20th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000), volume 1974 of Lecture Notes in Computer Science, pages 312–324, New Delhi, India, December 2000. Springer-Verlag. (PDF)

• Frank Drewes, Berthold Hoffmann, and Detlef Plump. Hierarchical graph transformation. In Proc. Foundations of Software Science and Computation Structures (FOSSACS 2000), volume 1784 of Lecture Notes in Computer Science, pages 98–113. Springer-Verlag, 2000.

• Annegret Habel, Jürgen Müller, and Detlef Plump. Double-pushout approach with injective matching. In Theory and Application of Graph Transformations (TAGT'98), Selected Papers, volume 1764 of Lecture Notes in Computer Science, pages 103–116. Springer-Verlag, 2000.

• J. Jacob and A.M. Wood. A Principled Semantics for inp. In Coordination Languages and Models, volume LNCS 1906, pages 51–66. Springer Verlag, 2000.

• Jeremy L. Jacob and Alan M. Wood. A principled semantics for textsf inp. In António Porto and Grui-Catalin Roman, editors, Coordination Languages and Models, number 1906 in Lecture Notes in Computer Science, pages 51–65, Berlin, Germany, September 2000. Coordination 2000, Springer. Proceedings of 4th international conference.

• G. Lüttgen and M. Mendler. Fully-abstract statecharts semantics via intuitionistic kripke models. In U. Montanari, J. Rolim, and E. Welzl, editors, 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 163–174, Geneva, Switzerland, July 2000. Springer-Verlag. (PDF)

• G. Lüttgen, M. von der Beeck, and R. Cleaveland. A compositional approach to statecharts semantics. In ACM SIGSOFT 8th International Symposium on the Foundations of Software Engineering (FSE 2000), volume 25,6 of ACM Software Engineering Notes, pages 120–129, San Diego, CA, USA, November 2000. ACM Press. (PDF)

• I. Merrick and A.M. Wood. Coordination with Scopes. In Proc. 14th ACM Symposium on Applied Computing, 2000.

• I. Merrick and A.M. Wood. Scoped Coordination in Open Distributed Systems. In Coordination Languages and Models, volume LNCS 1906, pages 311–316. Springer Verlag, 2000.

1999

• Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, and Gabriele Taentzer. Graph transformation for specification and programming. Science of Computer Programming, 34(1):1–54, 1999.

• J.C.M. Baeten and S. Mauw, editors. Tenth International Conference on Concurrency Theory (CONCUR '99), volume 1664 of Lecture Notes in Computer Science, Eindhoven, The Netherlands, August 1999. Springer-Verlag.

• A. Bakewell and C. Runciman. Automated generalisation of function definitions. In Proc. Intl. Fuji Symposium on functional and logic programming systems (FLOPS'99), pages 225–240. Springer LNCS Vol. 1722, 1999. (PDF)

• G. Bhat, R. Cleaveland, and G. Lüttgen. A practical approach to implementing real-time semantics. Annals of Software Engineering, 7:127–155, 1999. Special issue on Real-Time Software Engineering. (PDF)

• N. Charles and C. Runciman. An interactive approach to profiling parallel functional programs. In K. Hammond, T. Davie, and C. Clack, editors, Implementation of Functional Languages: selected papers from 10th Intl. Workshop (IFL'98), pages 20–37, University College, London, 1999. Springer LNCS 1595. (PDF)

• N. Charles and C. Runciman. Performance modelling. In K. Hammond and G. Michaelson, editors, Research directions in parallel functional programming, pages 233–246. Springer Verlag, 1999.

• Olaf Chitil. Type-inference based short cut deforestation (nearly) without inlining. In Proceedings of the 11th International Workshop on Implementation of Functional Languages 1999, LNCS 1868, pages 19–36, 1999. (PostScript)

• Olaf Chitil. Type inference builds a short cut to deforestation. ACM SIGPLAN Notices, 34(9):249–260, September 1999. Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99). (PostScript)

• Annegret Habel and Detlef Plump. Complete strategies for term graph narrowing. In Recent Developments in Algebraic Development Techniques (WADT'98), Selected Papers, volume 1589 of Lecture Notes in Computer Science, pages 152–167. Springer-Verlag, 1999.

• G. Lüttgen and V. Carreño. Analyzing mode confusion via model checking. In D. Dams, R. Gerth, S. Leue, and M. Massink, editors, Theoretical and Practical Aspects of SPIN Model Checking (SPIN '99), volume 1680 of Lecture Notes in Computer Science, pages 120–135, Toulouse, France, September 1999. Springer-Verlag. (PDF)

• G. Lüttgen, M. von der Beeck, and R. Cleaveland. Statecharts via process algebra. In Baeten and Mauw [Baeten and Mauw, 1999], pages 399–414. (PDF)

• R. Menezes, I. Merrick, and A.M. Wood. Coordination in a Content-Addressable Web. Journal of Autonomous Agents and Multi-Agent Systems, 2(3):287–301, 1999.

• G. E. Moss and C. Runciman. Automated benchmarking of functional data structures. In G. Gupta, editor, Proc. 1st Intl. Workshop on Practical Aspects of Declarative Languages (PADL'99), pages 1–15, San Antonio, January 1999. Springer LNCS Vol. 1551. (PDF)

• Detlef Plump. Computing by Graph Rewriting. Habilitation thesis, Universität Bremen, Fachbereich Mathematik und Informatik, 1999.

• Detlef Plump. Term graph rewriting. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 1, pages 3–61. World Scientific, 1999.

• M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type-based translation? In Proc. 4th Intl. Conf. on Functional Programming (ICFP'99), Paris, France, September 1999. ACM Press. (PDF)

• A.M. Wood. Coordination with Attributes. In P. Ciancarini and A.L. Wolf, editors, Coordination Langauges and Models, volume LNCS 1594 of Lecture Notes in Computer Science, pages 21–36. Springer, 1999.

1998

• A.Rowstron and A. Wood. Solving the Multiple-rd Problem. Science of Computer Programming, 31:335–358, July 1998.

• D.K.G. Campbell, H.R. Osborne, A.M. Wood, and D.G. Bridge. sc Linda for Case Base Retrieval: a Case for Extending the Functionality of sc Linda. In Proc. 31st Hawaii International Conference on System Sciences, January 1998.

• R. Cleaveland, G. Lüttgen, and V. Natarajan. A process algebra with distributed priorities. Theoretical Computer Science, 195(2):227–258, March 1998. (PDF)

• R. Menezes and A. Wood. Incorporating Input/Output Operations in sc Linda. In Proc. 31st Hawaii International Conference on System Sciences, January 1998.

• Ronaldo Menezes and Alan Wood. Garbage Collection in Linda using Tuple Monitoring and Process Registration. In Proc. of the 10th International Conference on Parallel and Distributed Computing and Systems, pages 490–495, Las Vegas, Nevada, USA, 1998. Acta Press.

• G. E. Moss and C. Runciman. Auburn: a kit for benchmarking functional data structures. In C. Clack, K. Hammond, and T. Davie, editors, Implementation of Functional Languages: selected papers from 9th Intl. Workshop (IFL'97), pages 141–159. Springer LNCS 1467, 1998. (PDF)

• Detlef Plump. Termination of graph rewriting is undecidable. Fundamenta Informaticae, 33(2):201–209, 1998.

• J. Sparud and C. Runciman. Complete and partial redex trails of functional computations. In Implementation of Functional Languages: selected papers from 8th Intl. workshop (IFL'97), pages 160–177. Springer LNCS 1467, 1998. (PDF)

• Ian Toyn, David M. Cattrall, John A. McDermid, and Jeremy L. Jacob. A practical language and toolkit for high-integrity tools. Journal of Systems and Software, 41:161–173, 1998.

• M. Wallace and C. Runciman. The bits between the lambdas: binary data in a lazy functional language. In Proc. Intl. Symp. on Memory Management, pages 107–117, Vancouver, October 1998. ACM Press. (PDF)

• A.M. Wood and D.K.G. Campbell. Generic Operations for Concurrent Knowledge Manipulation Architectures. In Proc. International Conference on Applied Informatics, February 1998.

1997

• Zena M. Ariola, Jan Willem Klop, and Detlef Plump. Confluent rewriting of bisimilar term graphs. In Proc. Fourth Workshop on Expressiveness in Concurrency, volume 7 of Electronic Notes in Theoretical Computer Science. Elsevier, 1997.

• G. Bhat, R. Cleaveland, and G. Lüttgen. Dynamic priorities for modeling real-time. In Proceedings of FORTE/PSTV'97, volume 7. Chapman & Hall, 1997. 127–142. (PDF)

• Phil J. Brooke, Jeremy L. Jacob, and Jim M. Armstrong. Analysis of the four-slot mechanism. In Duke and Evans [Duke and Evans, 1997], page 4. This is the abstract only; the body of the paper is available electronically.

• D.K.G. Campbell, H.R. Osborne, and A.M. Wood. Characterising the Design Space for sc Linda Semantics. Technical Report YCS-277, Dept. Computer Science, University of York, 1997.

• D.K.G. Campbell, H.R. Osborne, A.M. Wood, and D.G. Bridge. Parallel Case Base Retrieval: An Implementation on Distributed sc Linda. In Proc. 9th IASTED International Conference on Parallel and Distributed Computing and Systems, pages 525–530, October 1997.

• Olaf Chitil. Common subexpressions are uncommon in lazy functional languages. In Proceedings of the 9th International Workshop on Implementation of Functional Languages 1997, LNCS 1467, pages 53–71, 1997. (PostScript)

• Olaf Chitil. The sigma-semantics: A comprehensive semantics for functional programs. Fundamenta Informaticae, 31:253–294, 1997. (PostScript)

• John A. Clark and Jeremy L. Jacob. A survey of authentication protocol literature. Provided on the internet, 1997. Produced for DERA (since replaced by QinetiQ).

• R. Cleaveland, G. Lüttgen, and M. Mendler. An algebraic theory of multiple clocks. In Mazurkiewicz and Winkowski [Mazurkiewicz and Winkowski, 1997], pages 166–180. (PDF)

• David J. Duke and Andy S. Evans, editors. Proceedings of the BCS-FACS Northern Formal Methods Workshop, Ilkley 1996, Electronic Workshops in Computing, London, 1997. Springer.

• A. Mazurkiewicz and J. Winkowski, editors. CONCUR '97 (Concurrency Theory), volume 1243 of Lecture Notes in Computer Science, Warsaw, Poland, July 1997. Springer-Verlag.

• R. Menezes and A. Wood. Garbage Collection in Open Distributed Tuple Space Systems. In Proc. 15th Brazilian Symposium on Computer Networks, pages 525–534, May 1997.

• Detlef Plump. Simplification orders for term graph rewriting. In Proc. Mathematical Foundations of Computer Science (MFCS'97), volume 1295 of Lecture Notes in Computer Science, pages 458–467. Springer-Verlag, 1997.

• A. Rowstron and A. Wood. BONITA: a Set of Tuple Space Primitives for Distributed Coordination. In Proc. 30th Hawaii International Conference on System Sciences, January 1997.

• C. Runciman. Lazy wheel sieves and spirals of primes. Journal of Functional Programming, 7(2):219–225, March 1997. (PDF)

• C. Runciman and N. Röjemo. Two-pass heap profiling: a matter of life and death. In Implementation of Functional Languages: selected papers from 8th Intl. Workshop (IFL'96), pages 222–232, Bad Godesberg, 1997. Springer LNCS 1268. (PDF)

• J. Sparud and C. Runciman. Tracing lazy functional computations using redex trails. In Proc. Intl. Symposium on Programming Languages: Implementations, Logics and Programs (PLILP'97), pages 291–308. Springer LNCS 1292, 1997. (PDF)

• M. Wallace and C. Runciman. Heap compression and binary I/O in Haskell. In 2nd ACM SIGPLAN Workshop on Haskell, Amsterdam, June 1997. (PDF)

• A.M. Wood. Coordination using Object Attributes. Technical Report YCS-290, Dept. Computer Science, University of York, 1997.

1996

• John A. Clark and Jeremy L. Jacob. Attacking authentication protocols. High Integrity Systems, 1(5):465–473, August 1996.

• R. Cleaveland, G. Lüttgen, and V. Natarajan. A process algebra with distributed priorities. In Montanari and Sassone [Montanari and Sassone, 1996], pages 34–49. (PDF)

• R. Cleaveland, G. Lüttgen, V. Natarajan, and S. Sims. Priorities for modeling and verifying distributed systems. In Margaria and Steffen [Margaria and Steffen, 1996], pages 278–297. (PDF)

• R. Cleaveland, V. Natarajan, S. Sims, and G. Lüttgen. Modeling and verifying distributed systems using priorities: A case study. Software–Concepts and Tools, 17(2):50–62, 1996. (PDF)

• A. Douglas, N. Röjemo, C. Runciman, and A. Wood. AstroGofer: Parallel functional programming with co-ordinating processes. In Proc. 2nd International EuroPar Conference, pages 686–694. Springer LNCS 1123, 1996. (PDF)

• A. Douglas, N. Röjemo, C. Runciman, and A. Wood. sc AstroGofer: Parallel Functional Programming with Co-ordinating Processes. In Proc. 2nd International EuroPar Conference, pages 686–694, October 1996.

• Simon N. Foley and Jeremy L. Jacob. Specifying security for computer supported collaborative working. Journal of Computer Security, 3(4):233–253, 1996. Published in 1996, even though the volume is dated 1994/1995!

• A. Geser, J. Knoop, G. Lüttgen, O. Rüthing, and B. Steffen. Non-monotone fixpoint iterations to resolve second order effects. In T. Gyimóthy, editor, Proceedings of the 6th International Symposium on Compiler Construction (CC'96), volume 1060 of Lecture Notes in Computer Science, pages 106–120, Linköping, Sweden, April 1996. Springer-Verlag. (PDF)

• S. Graf, B. Steffen, and G. Lüttgen. Compositional minimisation of finite state systems using interface specifications. Formal Aspects of Computing, 8:607–616, 1996. (PDF)

• Annegret Habel and Detlef Plump. Term graph narrowing. Mathematical Structures in Computer Science, 6:649–676, 1996.

• T. Margaria and B. Steffen, editors. TACAS '96, volume 1055 of Lecture Notes in Computer Science, Passau, Germany, March 1996. Springer-Verlag.

• Ugo Montanari and Vladimiro Sassone, editors. CONCUR '96 (Concurrency Theory), volume 1119 of Lecture Notes in Computer Science, Pisa, Italy, August 1996. Springer-Verlag.

• Detlef Plump and Annegret Habel. Graph unification and matching. In Graph Grammars and Their Application to Computer Science, Selected Papers, volume 1073 of Lecture Notes in Computer Science, pages 75–89. Springer-Verlag, 1996.

• N. Röjemo and C. Runciman. Lag, drag, void and use — heap profiling and space-efficient compilation revisited. In Proc. 1st Intl. Conf. on Functional Programming (ICFP'96), pages 34–41, Philadelphia, USA, May 1996. ACM Press. (PDF)

• A. Rowstron and A. Wood. An Efficient Distributed Tuple Space Implementation for Networks of Workstations. In Proc. 2nd International EuroPar Conference, pages 510–514, October 1996.

• A. Rowstron and A. Wood. copy-collect: A new primitive for the Linda model. Technical Report YCS-268, Dept. Computer Science, University of York, 1996.

• A. Rowstron and A. Wood. Solving the multiple-rd problem. In Proc. Coordination96, pages 357–367, 1996.

• A. Rowstron, A. Douglas, and A. Wood. COPY-COLLECT: A New Primitive for the Linda Model. Technical Report YCS-268, Dept. Computer Science, University of York, 1996.

• C. Runciman and N. Röjemo. Heap profiling for space efficiency. In J. Launchbury, E. Meijer, and T. Sheard, editors, 2nd Intl. School on Advanced Functional Programming, pages 159–183, Olympia, WA, August 1996. Springer LNCS Vol. 1129. (PDF)

• C. Runciman and N. Röjemo. New dimensions in heap profiling. Journal of Functional Programming, 6(4):587–620, 1996. (PDF)

1995

• John A. Clark and Jeremy L. Jacob. On the security of recent protocols. Information Processing Letters, 56(3):151–155, November 1995.

• A. Douglas, A. Wood, and A. Rowstron. uppercase Isetl- sc uppercase linda: Parallel programming with bags. Technical Report YCS-257, Dept. Computer Science, University of York, 1995.

• Simon N. Foley and Jeremy L. Jacob. Specifying security in CSCW systems. In Gong [Gong, 1995], pages 136–145.

• S. P. Foubister and C. Runciman. Techniques for simplifying the visualisation of graph reduction. In Proc. 1994 Glasgow Workshop on Functional Programming, pages 66–77. British Computer Society and Springer Verlag, 1995.

• Li Gong, editor. Proceedings 8th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, June 1995.

• Annegret Habel and Detlef Plump. Unification, rewriting, and narrowing on term graphs. In Proc. Joint textsc Compugraph/Semagraph Workshop on Graph Rewriting and Computation (SEGRAGRA'95), volume 2 of Electronic Notes in Theoretical Computer Science. Elsevier, 1995.

• T. Matsushita and C. Runciman. Functional counterparts of some logic programming techniques. In Proc. Intl. Fuji Workshop on Functional and Logic Programming, pages 90–103, Susono, 1995. World Scientific. (PDF)

• R. J. Noble and C. Runciman. Gadgets: lazy functional components for graphical user interfaces. In E M. Hermenegildo and S. D. Swierstra, editors, Proc. 7th Intl. Symposium on Programming Languages: Implementations, Logics and Programs (PLILP'95), pages 321–340, Utrecht, Netherlands, September 1995. Springer LNCS Vol. 982. (PDF)

• Detlef Plump. On termination of graph rewriting. In Proc. Graph-Theoretic Concepts in Computer Science (WG'95), volume 1017 of Lecture Notes in Computer Science, pages 88–100. Springer-Verlag, 1995.

• A. Rowstron and A. Wood. Implementing mathematical morphology in uppercase Isetl- sc uppercase linda. In Proc. 5th Intl. Conference on Image Processing, pages 847–851, 1995.

• A. Rowstron, A. Douglas, and A. Wood. A distributed sc uppercase linda-like kernel for uppercase PVM. In Proc. Euro PVM, pages 107–112. Hermes, 1995.

• A. Rowstron, A. Douglas, and A. Wood. sc uppercase Linda implementation revisited. In Transputer and occam Developments, pages 125–138. IOS Press, 1995.

• C. Runciman. Binding-time improvement and fold-unfold transformations. In Proc. 1994 Glasgow Workshop on Functional Programming, pages 218–230. British Computer Society and Springer Verlag, 1995. (PDF)

• C. Runciman and D. Wakeling, editors. Applications of functional programming. UCL Press, 1995.

• M. Wallace and C. Runciman. Extending a functional programming system for embedded applications. Software — practice and experience, 25(1):73–96, 1995.

• M. Wallace and C. Runciman. Lambdas in the Liftshaft — functional programming and an embedded architecture. In Proc. 7th Intl. Conf. on Functional Programming Languages and Computer Architecture (FPCA'95), pages 249–258, La Jolla, June 1995. ACM Press. (PDF)

• M. Wallace and C. Runciman. Type-checked message passing between functional processes. In Proc. 1994 Glasgow Workshop on Functional Programming, pages 245–254. British Computer Society and Springer Verlag, 1995.

• A.M. Wood. Case based reasoning. AXIS: Journal of Academic Computing and Information Systems, 2(3):23–30, September 1995.

1994

• P. Butcher, A.M. Wood, and M. Atkins. Global synchronisation in sc uppercase linda. Concurrency: Practice and Experience, 6:505–516, 1994.

• Detlef Plump. Critical pairs in term graph rewriting. In Proc. Mathematical Foundations of Computer Science (MFCS'94), volume 841 of Lecture Notes in Computer Science, pages 556–566. Springer-Verlag, 1994.

• C. Runciman and D. Wakeling. Profiling parallel functional computations (without parallel machines). In J. T. O'Donnell and K. Hammond, editors, Proc. 1993 Glasgow Workshop on Functional Programming, pages 236–251. Springer-Verlag Workshops in Computing, 1994. (PDF)

1993

• D. M. Cattrall and C. Runciman. Widening the representation bottleneck: a functional implementation of relational programming. In Proceedings of the 1993 Conference on Functional Programming Languages and Computer Architecture, pages 191–200. ACM Press, June 1993. (PDF)

• I. G. Checkland and C. Runciman. Perfect hash functions made parallel – lazy functional programming on a distributed multiprocessor. In Proc. Intl. Conf. on System Sciences (ICSS'93), pages 397–406, Hawaii, 1993. IEEE Computer Society Press.

• Detlef Plump. Collapsed tree rewriting: Completeness, confluence, and modularity. In Proc. Conditional Term Rewriting Systems (CTRS'92), volume 656 of Lecture Notes in Computer Science, pages 97–112. Springer-Verlag, 1993.

• Detlef Plump. Evaluation of Functional Expressions by Hypergraph Rewriting. Doctoral dissertation, Universität Bremen, Fachbereich Mathematik und Informatik, 1993. (PDF)

• Detlef Plump. Hypergraph rewriting: Critical pairs and undecidability of confluence. In Ronan Sleep, Rinus Plasmeijer, and Marko van Eekelen, editors, Term Graph Rewriting: Theory and Practice, chapter 15, pages 201–213. John Wiley, 1993.

• C. Runciman and D. Wakeling. Heap profiling of a lazy functional compiler. In J. Launchbury and P. Sansom, editors, Proc. 1992 Glasgow workshop on functional programming, pages 203–214. Springer-Verlag Workshops in Computing, 1993. (PDF)

• C. Runciman and D. Wakeling. Heap profiling of lazy functional programs. Journal of Functional Programming, 3(2):217–245, 1993. (PDF)

• C. Runciman and D. Wakeling. LZW text compression in haskell. In J. Launchbury and P. Sansom, editors, Proc. 1992 Glasgow workshop on functional programming, pages 215–226. Springer-Verlag Workshops in Computing, 1993.

• C. Runciman, I. Toyn, and M. Firth. An incremental, exploratory and transformational environment for lazy functional programming. Journal of Functional Programming, 3(1):93–115, January 1993. (PDF)

• H. Somers and A.M. Wood. Design versus training of neural machines. In Proc. Int. Conf. on Artificial Neural Networks, Amsterdam, 1993.

• M. Wallace and C. Runciman. An incremental garbage collector for embedded real-time systems. In Proc. winter meeting on programming methodology, pages 277–288. Dept. of Computer Science, Chalmers Technical University, Gothenburg, 1993. (PDF)

1992

• Jeremy L. Jacob. Basic theorems about security. Journal of Computer Security, 1(4):385–411, 1992.

• Jeremy L. Jacob. A model of reconfiguration in Communicating Sequential Processes with a notion of transactions. Information Processing Letters, 41:9–12, 1992.

1991

• J. Austin, T. Jackson, and A. Wood. Efficient implementation of massive neural networks. In J.G. Delgado-Frias and W.P. Moore, editors, VLSI for Artificial Intelligence and neural Networks, pages 387–398. Pleneum Press, 1991.

• Annegret Habel, Hans-Jörg Kreowski, and Detlef Plump. Jungle evaluation. Fundamenta Informaticae, 15(1):37–60, 1991.

• Berthold Hoffmann and Detlef Plump. Implementing term rewriting by jungle evaluation. RAIRO Theoretical Informatics and Applications, 25(5):445–472, 1991.

• Jeremy L. Jacob. The basic integrity theorem. In Proceedings of the Computer Security Foundations Workshop IV, pages 89–97. IEEE Computer Society Press, June 1991.

• Jeremy L. Jacob. A uniform presentation of confidentiality properties. IEEE Transactions on Software Engineering, 17(11):1186–1194, November 1991.

• Jeremy L. Jacob. The varieties of refinement. In J. M. Morris and R. C. Shaw, editors, Proceedings of the 4th Refinement Workshop, pages 441–455. Springer, 1991.

• Detlef Plump. Graph-reducible term rewriting systems. In Proc. Graph Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 622–636. Springer-Verlag, 1991.

• Detlef Plump. Implementing term rewriting by graph reduction: Termination of combined systems. In Proc. Conditional and Typed Rewriting Systems (CTRS'90), volume 516 of Lecture Notes in Computer Science, pages 307–317. Springer-Verlag, 1991.

• David Wakeling and Colin Runciman. Linearity and laziness. In John Hughes, editor, Functional Programming Languages and Computer Architecture, pages 215–240. Springer LNCS 523, 1991. (PDF)

1990

• Jeremy L. Jacob. Categorising non-interference. In Proceedings Computer Security Foundations Workshop III, pages 44–50. IEEE Computer Society Press, 1990.

• Jeremy L. Jacob. A model of reconfiguration in Communicating Sequential Processes. Information Processing Letters, 35:19–22, 1990.

• Jeremy L. Jacob. Separability and the detection of hidden channels. Information Processing Letters, 34(1):27–29, February 1990.

• Jeremy L. Jacob. Specifying security properties. In C. A. R. Hoare, editor, Developments in Concurrency and Communication, pages 221–237. Addison Wesley, Reading, Mass, U. S. A., 1990.

• A.M. Wood. Architecturally independent software: the case for abstraction. In Proc. Software Standards for MIMD Machines, pages 123–127. SERC, 1990.

1989

• Jeremy L. Jacob. On the derivation of secure components. In Tom Berson and Deborah M. Cooper, editors, Proceedings 1989 IEEE Symposium on Security and Privacy, pages 242–247, New York, NY, May 1989. IEEE Computer Society Press.

• Jeremy L. Jacob. Refinement of shared systems. In John McDermid, editor, The Theory and Practice of Refinement: Approaches to the Formal Development of Large-Scale Software Systems, pages 27–36. Butterworths, 1989.

1988

• Annegret Habel, Hans-Jörg Kreowski, and Detlef Plump. Jungle evaluation. In Recent Trends in Data Type Specification (WADT'88), Selected Papers, volume 332 of Lecture Notes in Computer Science, pages 92–112. Springer-Verlag, 1988.

• Berthold Hoffmann and Detlef Plump. Jungle evaluation for efficient term rewriting. In Proc. Algebraic and Logic Programming. Mathematical Research 49, pages 191–203, Berlin, 1988. Akademie-Verlag. Also in Springer Lecture Notes in Computer Science 343, 191–203, 1989.

• Jeremy L. Jacob. A security framework. In Steven B. Lipner and Tom Berson, editors, Proceedings The Computer Security Foundations Workshop, pages 98–111, Bedford, MA, June 1988. The MITRE Corporation.

• Jeremy L. Jacob. Security specifications. In Proceedings 1988 IEEE Symposium on Security and Privacy, pages 14–23, New York, NY, April 1988. IEEE Computer Society Press.

• A.M. Wood. Intermediate-level vision, relations and processor arrays: An application of sc uppercase clip4 to image sequence analysis. In I. Page, editor, Parallel Architectures and Computer Vision, pages 157–170. Oxford University Press, 1988.

1986

• A.M. Wood. Higher level operations using processor arrays. In L. Uhr, K. Preston Jr., S. Levialdi, and M. Duff, editors, Evaluation of Multicomputers for Image Processing, pages 91–105. Academic Press, 1986.

• A.M. Wood. Motion analysis. In M.J.B. Duff and T.J. Fountain, editors, Cellular Logic Image Processing, pages 174–207. Academic Press, 1986.

• A.M. Wood and D.E. Reynolds. Software for sc uppercase clip4. In M.J.B. Duff and T.J. Fountain, editors, Cellular Logic Image Processing, pages 69–94. Academic Press, 1986.

1985

• A.M. Wood. Parallel thinking. In Proc. Coll: Parallel Processing - Parallel Thinking, pages 1–3. Institute of Electronic and Radio Engineers, 1985.

1983

• A.M. Wood. The organisation of parallel processing machines. In J. Becker and I. Eisele, editors, Proc. Workshop on Parallel Processing: Logic, Organisation and Technology, volume Lecture Notes 196, pages 132–144. Springer Verlag, 1983.

• A.M. Wood. Parallel Processing Techniques for Image Sequence Analysis. PhD thesis, University of London, 1983.

1982

• A.M. Wood. Practical parallel processing: A user's view of sc uppercase clip4. In Proc. IEE Coll. Real Time Architectures for Computer Vision and Robotics, pages 4.1–4.7, 1982.

1981

• A.M. Wood. The interaction between hardware, software, and algorithms. In M.J.B. Duff and S. Levialdi, editors, Languages and Architectures for Image Processing, pages 1–11. Academic Press, 1981.

1980

• A.M. Wood. The sc uppercase clip4 array processor. J. British Interplanetary Society, 33:338–343, 1980.

• J. Austin, T. Jackson, and A.M. Wood. Architectures for uncertain reasoning. In Proc. Int. Neural Networks Conference INNC-90, July 1990.

• Ronaldo Menezes and A.M. Wood. Distributed Garbage Collection of Tuple Spaces in Open Linda Coordination Systems. In Proc. $14^th Int. Symposium on Computer and Information Systems.

PhD theses supervised in the group

2012

• Michael J. Banks. On Confidentiality and Formal Methods. PhD thesis, University of York, 2012.

2009

• Xun Dong. Defending Against Phishing Attacks. PhD thesis, University of York, 2009.

• David Robert White. Genetic Programming for Low Resource Systems. PhD thesis, University of York, 2009.

2008

• Mike Dodds. Graph Transformation and Pointer Structures. PhD thesis, The University of York, 2008. (PDF)

• N. D. Mitchell. Transformation and analysis of functional programs. PhD thesis, Dept. of Computer Science, University of York, 2008.

• M. F. Naylor. Target-directed and hardware-assisted evaluation of functional programs. PhD thesis, Dept. of Computer Science, University of York, 2008.

2007

• Hao Chen. A Search-Based Framework for Security Protocol Synthesis. PhD thesis, University of York, 2007.

• Sandra Steinert. The Graph Programming Language GP. PhD thesis, The University of York, 2007. (PDF)

2006

• N.I. Udzir. Capability-Based Coordination for Open Distributed Systems. PhD thesis, University of York, 2006.

2003

• I. Merrick. Scope-BAsed Coordination for Open Systems. PhD thesis, University of York, 2003.

• M. J. Thyer. Lazy specialization. PhD thesis, Dept. of Computer Science, University of York, 2003. YCST 2003/04.

2002

• A. Bakewell. An operational theory of relative space efficiency. PhD thesis, Dept. of Computer Science, University of York, 2002. YCST 2002/08.

• Nathalie Foster. The Application of Software and Saftey Engineering Techniques to Security Protocol Development. PhD thesis, The University of York, 2002.

2001

• N. R. Charles. Data model refinement, generic profiling and functional programming. PhD thesis, Dept. of Computer Science, University of York, 2001. YCST 2001/11.

2000

• G. E. Moss. Benchmarking purely functional data structures. PhD thesis, Dept. of Computer Science, University of York, 2000. YCST 2000/01.

1999

• Philip J. Brooke. A Timed Semantics for a Hierarchical Design Notation. Dphil, University of York, 1999.

• T. Matsushita. Expressive power of declarative programming languages. PhD thesis, Dept. of Computer Science, University of York, 1999. YCST 99/03.

• R.P. Menezes. Resource Management in Open Tuple-Space Systems. PhD thesis, University of York, 1999.

1996

• A.I.P.Rowstron. Bulk Primitives in sc Linda Run-Time Systems. PhD thesis, University of York, 1996.

• R. Noble. Lazy functional components for graphical user interfaces. PhD thesis, Dept. of Computer Science, University of York, 1996. YCST 96/05.

1995

• I. G. Checkland. Speculative concurrent evaluation in a lazy functional language. PhD thesis, Dept. of Computer Science, University of York, 1995. YCST 95/01.

• S. P. Foubister. Graphical application and visualisation of lazy functional computation. PhD thesis, Dept. of Computer Science, University of York, 1995. YCST 95/10.

• M. Wallace. Functional programming and embedded systems. PhD thesis, Dept. of Computer Science, University of York, 1995. YCST 95/04.

1993

• D. M. Cattrall. The design and implementation of a relational programming system. PhD thesis, Dept. of Computer Science, University of York, 1993. YCST 93/01.

• John A. Clark. PhD thesis.

Other publications

2013

• Rachid Echahed and Detlef Plump, editors. Proc. International Workshop on Computing with Terms and Graphs (TERMGRAPH 2013), volume 110 of Electronic Proceedings in Theoretical Computer Science, 2013.

2012

• Christopher Bak. The implementation of graph programming systems. Qualifying Dissertation. Department of Computer Science, The University of York, 2012. (PDF)

2011

• Christopher M. Poskitt (ed.). Proceedings of the Fourth York Doctoral Symposium on Computer Science (YDS 2011). Technical Report YCS-2011-468, Department of Computer Science, The University of York, 2011. (PDF)

2010

• Frank Drewes, Annegret Habel, Berthold Hoffmann, and Detlef Plump, editors. Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday, volume 26 of Electronic Communications of the EASST, 2010.

• Detlef Plump, Robin Suri, and Ambuj Singh. Minimizing finite automata with graph programs. In Proc. Graph Computation Models (GCM 2010), volume WP 2010-05 of CTIT Workshop Proceedings, pages 97–110. University of Twente, 2010.

• Christopher M. Poskitt. Towards the verification of graph programs. Qualifying Dissertation. Department of Computer Science, The University of York, 2010. (PDF)

2009

• Frank Drewes, Annegret Habel, Berthold Hoffmann, and Detlef Plump, editors. Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday. 2009. 362 pages.

2008

• Ian Mackie and Detlef Plump, editors. Proc. International Workshop on Term Graph Rewriting (TERMGRAPH 2007), volume 203(1) of Electronic Notes in Theoretical Computer Science. Elsevier, 2008.

2007

• J. Ezekiel, G. Lüttgen, and R. Siminiceanu. A parallel saturation algorithm on shared memory architectures. Technical Report 2007-01, National Institute of Aerospace (NIA), Hampton, Virginia, January 2007. (PDF)

• J. Ezekiel, G. Lüttgen, and R. I. Siminiceanu. An anticipated firing saturation algorithm for shared-memory architectures. Technical Report YCS-2007-422, Department of Computer Science, University of York, England, November 2007. (PDF)

• A. Galloway, J.-T. Mühlberg, R. Siminiceanu, and G. Lüttgen. Model-checking part of a Linux file system. Technical Report YCS-2007-423, Department of Computer Science, University of York, England, November 2007. (PDF)

• Dimitry Golubovsky, Neil Mitchell, and Matthew Naylor. Yhc.Core - from Haskell to Core. The Monad.Reader, (7):45–61, April 2007.

• G. Lüttgen and W. Vogler. Ready simulation for concurrency: It's logical! Technical Report 2007-04, Computer Science Institute, University of Augsburg, Germany, April 2007. (PDF)

• Ian Mackie and Detlef Plump, editors. Proc. International Workshop on Term Graph Rewriting (TERMGRAPH 2002), volume 72(1) of Electronic Notes in Theoretical Computer Science. Elsevier, 2007.

• Ian Mackie and Detlef Plump, editors. Theory and Applications of Term Graph Rewriting, volume 17(3) of Mathematical Structures in Computer Science. Cambridge University Press, 2007.

• M. Mendler and G. Lüttgen. Is observational congruence on μ-expressions axiomatisable in equational horn logic? Technical Report 07-72, Faculty of Information Systems and Applied Computer Sciences, University of Bamberg, Germany, June 2007. (PDF)

• J.-T. Mühlberg and G. Lüttgen. BLASTing Linux code. Technical Report YCS-2007-417, Department of Computer Science, University of York, England, June 2007. (PDF)

• Matthew Naylor. A Recipe for Controlling Lego using Lava. The Monad.Reader, (7):5–21, April 2007.

• Colin Runciman, David Duke, Rita Borgo, and Malcolm Wallace. Polytopes and polytypes: Generic isosurfacing and functional programming. In Draft Proc. 19th Intl. Symposium on Implementation and Application of Functional Languages, IFL 2007, pages 474–488, Freiburg, Germany, September 2007. Tech. Report 12-07, Computing Laboratory, University of Kent.

2006

• D. Atiya, N. Cataño, and G. Lüttgen. Towards a benchmark for model checkers of asynchronous concurrent systems. Technical Report YCS-2006-399, Department of Computer Science, University of York, England, April 2006. (PDF)

• N. Cataño and G. Lüttgen. Enforcing correct programming of libraries: A case study on hash tables. Technical Report YCS-2006-406, Department of Computer Science, University of York, England, July 2006. (PDF)

• N. Cataño and G. Lüttgen. Enforcing correct programming of libraries: A case study on hash tables. Technical Report YCS-2006-406, Department of Computer Science, University of York, England, July 2006. (PDF)

• Hartmut Heinrich, Friedrich Holl, Katharina Menzel, Jan Tobias Mühlberg, Ingo Schäfer, and Hanno Schüngel. Metastudie Open-Source-Software und ihre Bedeutung für Innovatives Handeln. Friedrich Holl, self-published, Berlin, Germany, 2006. Study commissioned by the Federal Ministry of Education and Research of Germany.

• Friedrich Holl, Katharina Menzel, Peter Morcinek, Jan Tobias Mühlberg, Ingo Schäfer, and Hanno Schüngel. Forschungsbericht: Innovationsverhalten deutscher Software-Entwicklungsunternehmen. Friedrich Holl, self-published, Berlin, Germany, 2006. Study commissioned by the Federal Ministry of Education and Research of Germany.

• G. Lüttgen. Formal verification & its role in testing. Technical Report YCS-2006-400, Department of Computer Science, University of York, England, May 2006. (PDF)

• Jan Tobias Mühlberg. Software Engineering und Softwarequalität in Open-Source-Projekten. In Open Source Jahrbuch 2006: Zwischen Softwareentwicklung und Gesellschaftsmodell, pages 251 – 262. Technische Universität Berlin and Lehmanns Media, Berlin, Germany, 2006.

2005

• Olaf Chitil, Malcolm Wallace, and Colin Runciman. Hat – the Haskell Tracer. University of York, 2.04 edition, May 2005.

• M. Dodds and C. Runciman. Using trace data to diagnose non-termination errors. In Proc. Hat Day 2005: work in progress on the Hat tracing system for Haskell, pages 12–17. Tech. Report YCS-2005-395, Dept. of Computer Science, University of York, UK, 2005.

• G. Lüttgen, N. Martinez-Madrid, and M. Mendler, editors. 2nd Intl. Workshop on Semantic Foundations of Engineering Design Languages (SFEDL 2004), volume 115 of Electronic Notes in Theoretical Computer Science. Elsevier Science, January 2005. (PDF)

• Neil Mitchell. Visual Hat. In Colin Runciman, editor, Hat Day 2005: work in progress on the Hat tracing system for Haskell, pages 23–26. Tech. Report YCS-2005-395, Dept. of Computer Science, University of York, UK, October 2005. (PDF)

• N. Mitchell and C. Runciman. Unfailing haskell: A static checker for pattern matching. In M. van Eekelen, editor, Proc. 6th Symposium on Trends in Functional Programming (TFP'05), pages 313–328. Tartu University Press, 2005.

• Neil Mitchell and Colin Runciman. Unfailing Haskell: A static checker for pattern matching. In Proceedings of the Sixth Symposium on Trends in Functional Programming, pages 313–328, September 2005. (PDF)

• C. Runciman. Deriving program coverage from hat traces. In Proc. Hat Day 2005: work in progress on the Hat tracing system for Haskell, pages 27–32. Tech. Report YCS-2005-395, Dept. of Computer Science, University of York, UK, 2005.

• T. Shackell and C. Runciman. Faster production of redex trails: The hat g-machine. In M. van Eekelen, editor, Proc. 6th Symposium on Trends in Functional Programming (TFP'05), pages 135–150. Tartu University Press, 2005.

• Malcolm Wallace. cpphs – A Reimplementation of CPP. University of York, 0.9 edition, March 2005.

• Malcolm Wallace and Colin Runciman. HaXml - Haskell and XML. University of York, 1.13 edition, May 2005.

• Malcolm Wallace, Niklas Röjemo, and Olaf Chitil. The nhc98 Haskell Compiler. University of York, 1.18 edition, March 2005.

2004

• M. Broy, G. Lüttgen, and M. Mendler (editors). Special issue on semantic foundations of engineering design languages. Formal Aspects of Computing, 16(3):165–312, August 2004. (PDF)

• Hao Chen, John A. Clark, and Jeremy L. Jacob. A search-based approach to the automated design of security protocols. Technical report YCS 376, Department of Computer Science, The University of York, York, England, May 2004.

• Nur Izura Udzir and Alan Wood. Safe contracting using Scope with attributes. In Proceedings (Poster) of the Postgraduate Research Conference in Electronics, Photonics, Communications & Networks, and Computing Science (PREP 2004), pages 198–199, April 5-7 2004.

• D. White and G. Lüttgen. Accessing databases within Esterel. In S.A. Edwards, N. Halbwachs, R. v. Hanxleden, and T. Stauner, editors, Workshop on Synchronous Programming (SYNCHRON '04), number 04491 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, December 2004. Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany. (PDF)

2003

• Adam Bakewell, Detlef Plump, and Colin Runciman. Checking the shape safety of pointer manipulations - extended abstract. In Proc. 7th International Seminar on Relational Methods in Computer Science (RelMiCS 7), Malente, Germany, pages 144–151. CAU Kiel, 2003.

• Adam Bakewell, Detlef Plump, and Colin Runciman. Specifying pointer structures by graph reduction. Technical Report YCS-2003-367, University of York, 2003. 48 pages. (PDF)

• M. Broy, G. Lüttgen, and M. Mendler (editors). Special issue on semantic foundations of engineering design languages. Formal Aspects of Computing, 15(4):297–422, December 2003. (PDF)

• Manuel Chakravarty, Malcolm Wallace, et al. The haskell 98 foreign function interface 1.0: An addendum to the haskell 98 report, 2003.

• Olaf Chitil, Dan McNeill, and Colin Runciman. Lazy assertions. In Draft Proceedings of the 15th International Workshop on Implementation of Functional Languages, IFL 2003, pages 31–46, 2003.

• Simon Marlow and Malcolm Wallace. The hierarchical module namespace extension, version 0.0: An addendum to the haskell 98 report, 2003.

• Sandra Steinert. Graph programs for graph algorithms. Technical Report 7/03, Carl von Ossietzky University of Oldenburg, Faculty II, Department of Computer Science, 2003. (PostScript)

• S. Stepney, F. Polack, and I. Toyn. A Z patterns catalogue I: specification and refactorings v0.1. Technical Report YCS-2003-349, University of York Department of Computer Science, 2003.

2002

• Olaf Chitil, Colin Runciman, and Malcolm Wallace. Transforming Haskell for tracing. In Draft Proceedings of the 14th International Workshop on Implementation of Functional Languages, IFL 2002, pages 96–112, 2002. (PDF)

• Koen Claessen, Colin Runciman, Olaf Chitil, John Hughes, and Malcolm Wallace. Testing and tracing lazy functional programs using QuickCheck and Hat. In 4th Summer School in Advanced Functional Programming, page 40, 2002. to appear in LNCS. (PostScript)

• Annegret Habel and Detlef Plump. A core language for graph transformation. In Proc. Applied Graph Transformation (AGT 2002), 2002.

• Hans-Jörg Kreowski and Detlef Plump, editors. APPLIGRAPH: Applications of Graph Transformation — ESPRIT Working Group No. 22565. Final report. Universität Bremen, 2002. 98 pages.

• G. Lüttgen, F. Maraninchi, and M. Mendler, editors. 1st Intl. Workshop on Semantic Foundations of Engineering Design Languages (SFEDL 2002), VERIMAG Workshop Proceedings Series. VERIMAG, Grenoble, France, April 2002. (PDF)

• Detlef Plump. TERMGRAPH 2002 — workshop survey. In Proc. International Conference on Graph Transformation (ICGT 2002), volume 2505 of Lecture Notes in Computer Science, pages 435–439. Springer-Verlag, 2002.

• F. Polack. Exploring the informal translation of OMT object models in B. Technical Report YCS-2003-351, University of York, 2002.

2001

• Adam Bakewell. Looking for leaks. In F Henglein, editor, SPACE 2001 Informal Proceedings of Workshop on Semantics, Program Analysis and Computing Environments for Memory Management, London, UK, pages 81–88. IT University of Copenhagen(ITU), Denmark, January 2001. (PostScript)

• Olaf Chitil. Pretty printing with lazy dequeues. In Preliminary Proceedings of the 2001 ACM SIGPLAN Haskell Workshop, pages 183–201. Universiteit Utrecht, 2001. UU-CS-2001-23. (PDF)

• Olaf Chitil. A semantics for tracing. In Draft Proceedings of the 13th International Workshop on Implementation of Functional Languages, IFL 2001, pages 249–254, 2001. (PDF)

• R. Cleaveland, G. Lüttgen, and V. Natarajan. Priority in process algebra. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra, pages 711–765. Elsevier Science Publishers, February 2001. (PDF)

• Malcolm Wallace, Olaf Chitil, Thorsten Brehm, and Colin Runciman. Multiple-view tracing for Haskell: a new Hat. In Preliminary Proceedings of the 2001 ACM SIGPLAN Haskell Workshop, pages 151–170, 2001. (PDF)

2000

• Olaf Chitil. Deforestation of functional programs through type inference. In Proceedings des 17. Workshops der GI-Fachgruppe 2.1.4, Programmiersprachen und Rechenkonzepte mit Schwerpunkt Softwarekomponenten, pages 121–130, 2000. (PostScript)

• Olaf Chitil. Type-Inference Based Deforestation of Functional Programs. PhD thesis, RWTH Aachen, 2000. (PDF)

• G. Lüttgen, C. Muñoz, R. Butler, B. Di Vito, and P. Miner. Towards a customizable PVS. Technical Report 2000-4, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA, USA, January 2000. Presented at the PVS User Group Meeting, Toulouse, France, September 1999. (PDF)

• Axel Simon, Olaf Chitil, and Frank Huch. Typeview: A tool for understanding type errors. In Draft Proc. of IFL 2000, pages 63–69. RWTH Aachen, 2000. AIB 00-7. (PostScript)

• Malcolm Wallace. hi - hmake interactive - compiler or interpreter? In Draft Proceedings of the 12th International Workshop on Implementation of Functional Languages, IFL 2000, Aachen, Sept 2000. (PDF)

1999

• Olaf Chitil. Denotational semantics for teaching lazy functional programming. In Proceedings of the Workshop on Functional and Declarative Programming in Education, page 27, 1999. Rice University Computer Science Technical Report TR99-346. (PostScript)

• G. Lüttgen. Modellieren nebenlaeufiger und verteilter systeme mit prae-emption. In Ausgezeichnete Informatikdissertationen 1998, pages 102–111. B.G. Teubner, Stuttgart, Germany, September 1999. (PDF)

• Detlef Plump. Church-Rosser hypergraph languages. In Proc. 9. Theorietag ``Automaten und Formale Sprachen'', number 12/99 in Mathematische Schriften Kassel, page 55. Fachbereich Mathematik/Informatik, Universität Gesamthochschule Kassel, 1999.

1998

• G. Lüttgen. Formal methods for the quality assurance of digital systems. Research Quarterly, 7(4), December 1998. (PDF)

• G. Lüttgen. Pre-emptive Modeling of Concurrent and Distributed Systems. PhD thesis, Universität Passau, Passau, Germany, May 1998. (PDF)

1997

• D.K.G. Campbell, H.R. Osborne, and A.M. Wood. Characterising the Design Space for sc Linda Semantics. Technical Report YCS-277, Dept. Computer Science, University of York, 1997.

• Olaf Chitil. Adding an optimisation pass to the Glasgow Haskell compiler. Included in GHC documentation., November 1997. (PostScript)

• Annegret Habel and Detlef Plump. Completeness of narrowing in non-copying implementations. Informatik-Bericht 19/97, Universität Hildesheim, Institut für Informatik, 1997.

• A.M. Wood. Coordination using Object Attributes. Technical Report YCS-290, Dept. Computer Science, University of York, 1997.

1996

• Olaf Chitil. The sigma-semantics: A comprehensive semantics for functional programs. Technical Report AIB 96-7, 1996. (PostScript)

• A. Rowstron and A. Wood. copy-collect: A new primitive for the Linda model. Technical Report YCS-268, Dept. Computer Science, University of York, 1996.

• A. Rowstron, A. Douglas, and A. Wood. COPY-COLLECT: A New Primitive for the Linda Model. Technical Report YCS-268, Dept. Computer Science, University of York, 1996.

1995

• Olaf Chitil. Denotationelle und operationelle Semantiken für konstruktorbasierte funktionale Programmiersprachen erster Ordnung. Master's thesis, RWTH Aachen, 1995. In German. (PostScript)

• A. Douglas, A. Wood, and A. Rowstron. uppercase Isetl- sc uppercase linda: Parallel programming with bags. Technical Report YCS-257, Dept. Computer Science, University of York, 1995.

1994

• A. Geser, J. Knoop, G. Lüttgen, B. Steffen, and O. Rüthing. Chaotic fixed point iterations. Technical Report MIP-9403, Universität Passau, Passau, Germany, October 1994. (PDF)

1992

• Bernd Krieg-Brückner and Detlef Plump. COMPASS: A Comprehensive Algebraic Approach to System Specification and Development — ESPRIT Basic Research Working Group No. 3264. EATCS Bulletin, 47:87–90, 1992.

1991

• Bernd Krieg-Brückner and Detlef Plump. COMPASS: A Comprehensive Algebraic Approach to System Specification and Development — ESPRIT Basic Research Working Group No. 3264. Technical Report 7/91, Universität Bremen, Fachbereich Mathematik und Informatik, 1991. 104 pages.

1990

• A.M. Wood. Architecturally independent software: the case for abstraction. In Proc. Software Standards for MIMD Machines, pages 123–127. SERC, 1990.

1983

• A.M. Wood. Parallel Processing Techniques for Image Sequence Analysis. PhD thesis, University of London, 1983.