Research
Summary of Interests:

The mathematical and cognitive understanding of diagrammatic notations
for the specification, development and reasoning about software; domainspecific
programming languages.

Category theory, on a `needtoknow' basis.

Applications to programmable logic controllers (PLCs).
Since its commencement in January 2000, this EPSRC (UK governement) funded
project has been my main research occupation.
Assorted Documents:
(in chronological order)

K. Tourlas. Semantic
analysis and design of languages for Programmable Controllers.
Masters Thesis, University of Edinburgh, 1996 (gziped postscript)

S. Anderson and K. Tourlas. Diagrams
and Programming Languages for Programmable Controllers. Proceedings
of Formal Methods Europe 97 (gziped postscript)

S. Anderson and K. Tourlas. An
Assessment of the IEC 11313 Standard On Languages for Programmable Controllers.
SafeComp 97 (gziped postscript)

S. Anderson and K. Tourlas. A
Language for Programmable Controllers. Unpublished notes detailing
an operational semantics for a rationalisation of IEC 11313 function blocks.
(gziped postscript)

S. Anderson and K. Tourlas. Design
for Proof: An Approach to the Design of DomainSpecific Languages.
Third FMICS (Formal Methods for Industrial Critical Systems) Workshop,
1998 (gziped postscript)

S. Anderson and K. Tourlas. Design
for Proof: An Approach to the Design of DomainSpecific Languages.
Revised version. Formal Aspects of Computing, vol 10, pages 452468, 1998

C. Gurr and K. Tourlas. Formalising
Pragmatic Features of Graphbased Notations. Proceedings of the
1999 IEEE Symposium on Visual Languages. (gziped postscript)

C. Gurr and K. Tourlas. Towards
the Principled Design of Software Engineering Diagrams. Proceedings
of ICSE 2000, the 20th International Conference on Software Engineering.
(gziped postscript)

The slides
(in gzip postscript) from a talk I gave in Birmingham
on 27th October 2000. My notes will also appear here, shortly...

My Ph.D thesis
on
Diagrammatic Representations in DomainSpecific Languages (approx.
150 pages). Abstract.

J. Power and K. Tourlas. An
Algebraic Foundation for Higraphs. Proceedings of the Conference
on Computer Science Logic (CSL), 2001. (gzipped postscript)

J. Power and K. Tourlas. An
Algebraic Foundation for Graphbased Diagrams in Computing. Proceedings
of the 17th Conference on the Mathematical Foundations of Programming Semantics
(MFPS), 2001. (gzipped postscript)

S. Anderson, J. Power and K. Tourlas. Reasoning
in Higraphs with Loose Edges. Proceedings of the Conference on
Visual Languages and Formal Methods (VLFM), 2001. (Part of the IEEE Symposium
on Humancentric Computing Environments) (gzipped postscript)

S. Anderson, J. Power and K. Tourlas. Zoomingout
of higraphbased diagrams: Syntactic and Semantic Issues. Proceedings
of CATS 2002, the Australasian Symposium on Computing, 2002. To appear
(gzipped postscript)

K. Tourlas. On Extending
Diagrammatic Notations by Means of InterpretationConstraining Features.
In preparation, soon to become available online.

I'm currently typesetting Algebras, Theories and Freeness: an Introduction
for Computer Scientists. Written in 1981 by R. Burstall and J. Goguen,
this is an outofprint technical report which provides one of the most
accessible, gentle introductions to universal algebra I have encountered.
Please email me if you require any
of the above documents in other formats.
BibTeX entries for the documents above may be found here.
Related Projects at Edinburgh
This is a link to Corin's
work on software architectures, with emphasis on diagrammatic representations
of software.
This project looked at the graphical notations used or mandated in
safety
cases, which are collections of documents that present the arguments
for believing that a proposed potentiallydangerous system is acceptably
safe.