[Computing Science Logo]

[Books] Publications

You should find the same list, but with links to our institutional repository, on my RMS page.

2017

D. Hamami, B. Atmani, C. Shankland. Decision Support Based on Bio-PEPA Modeling and Decision Tree Induction: A New Approach, Applied to a Tuberculosis Case Study International Journal of Information Systems in the Service Sector 9(2): 71-101, 2017. Available online doi: 10.4018/IJISSS.2017040104

2016

E. Scott, A. Hoyle, C. Shankland. Process Algebra with Layers: A Language for Multi-scale Integration Modelling, Illustrated by a Cell Cycle and DNA Damage Case Study. Extended abstract in proceedings of 13th International Conference on Computational Intelligence methods for Bioinformatics and Biostatistics.

C. Shankland. Who will be the First to Get Gold? In ITNOW (Summer 2016) 58 (2): 14-15. Available online doi:10.1093/itnow/bww035

2014

R. Lintott, S. McMahon, K. Prise, C. Addie-Lagorio, and C. Shankland. Using process algebra to model radiation induced bystander effects. In proceedings of 12th International Conference in Computional Methods in Systems Biology 2014, P. Mendes, J.O. Dada, K. Smallbone (eds.), LNCS 8859, pp 196-210, Springer, 2014. ISBN:978-3-319-12981-5. Available online.

2013

C. McCaig, A. Fenton, A. Graham, C. Shankland, and R. Norman. Using process algebra to develop predator-prey models of within-host parasite dynamics. Journal of Theoretical Biology 329: 74-81, 21 July 2013. DOI: 10.1016/j.jtbi.2013.03.001 Available online 1st May 2013.

E. Scott, A. Hoyle and C. Shankland. PEPA'd Oysters: Converting Dynamic Energy Budget Models to Bio-PEPA, illustrated by a Pacific oyster case study. In the proceedings of the Sixth International Workshop on the Practical Application of Stochastic Modelling (PASM) and the Eleventh International Workshop on Parallel and Distributed Methods in Verification (PDMC), J. Bradley, K. Heljanko, W. Knottenbelt and N. Thomas (Eds.), ENTCS 296, pp. 211-228, 2013. DOI:10.1016/j.entcs.2013.07.014 Available online.

2012

D. Marco, E. Scott, D. Cairns, A. Graham, J. Allen, S. Mahajan, and C. Shankland. Investigating co-infection dynamics through evolution of Bio-PEPA model parameters: a combined process algebra and evolutionary computing approach. In proceedings of Computational Methods in Systems Biology (CMSB 2012), D. Gilbert and M. Heiner (eds.), LNCS 7605 pp. 227-246, Springer-Verlag 2012. ISBN 978-1-4244-7834-7. DOI: 10.1007/978-3-642-33636-2_14 Available online.

D. Marco, C. Shankland, and D. Cairns. Evolving Bio-PEPA Process Algebra Models Using Genetic Programming. In proceedings of Genetic and Evolutionary Computation Conference (GECCO 2012), pp. 177-183, ACM 2012. ISBN 978-1-4503-1177-9. DOI: 10.1145/2330163.2330189. Available online.

S. Benkirane, E. Scott, R. Norman and C. Shankland. Measles Epidemics and PEPA: an exploration of historic disease dynamics using process algebra. In proceedings of 18th International Symposium on Formal Methods (FM 2012), D. Giannakopoulou and D. Mery (Eds.): FM 2012, LNCS 7436, pp. 101-115, 2012. DOI: 10.1007/978-3-642-32759-9_11 Available online.

2011

D. Marco, D. Cairns, and C. Shankland. Optimisation of Process Algebra Models Using Evolutionary Computation. In proceedings of 2011 IEEE Congress on Evolutionary Computation, CEC 2011, pp. 1296-1301, IEEE 2011. ISBN 978-1-4244-7834-7. DOI: 10.1109/CEC.2011.5949765. Available online.

C. McCaig, M. Begon, R. Norman, and C. Shankland. A rigorous approach to investigating common assumptions about disease transmission: Process algebra as an emerging modelling methodology for epidemiology. Theory in Biosciences 130(1):19-29, Special Issue on Emerging Modelling Methodologies in Medicine, 2011. DOI: 10.1007/s12064-010-0106-8. Available online.

C. McCaig, C. Shankland and R. Norman. From Individuals to Populations: a mean field semantics for process algebra. Theoretical Computer Science 412(17):1557-1580, 2011. doi:10.1016/j.tcs.2010.09.024. Available online.

C. McCaig, M. Begon, R. Norman, and C. Shankland. A Symbolic Investigation of Superspreaders. Bulletin of Mathematical Biology 73(4): 777-794, 2011. doi:10.1007/s11538-010-9603-7 Available online. Special Issue on Algebraic Methods in Mathematical Biology.

2010

Erin Scott, Simmi M. Mahajan, Timothy Brand-Spencer, Judith E. Allen, Rachel Norman, Andrea L. Graham, Carron Shankland. Modelling Immunological Systems using PEPA: a preliminary report. in: 9th Workshop on Process Algebra and Stochastically Timed Activities: pp 64-69, London, 2010. Available online.

2009

S. Maharaj, C. McCaig, and C. E. Shankland. Studying the effects of adding spatiality to a process algebra model. in: 8th Workshop on Process Algebra and Stochastically Timed Activities: pp 153-158, Edinburgh, 2009. Available online.

Soufiene Benkirane, Carron Shankland, Rachel Norman and Chris McCaig. Modelling the bubonic plague in a prairie dog burrow: a work in progress in: 8th Workshop on Process Algebra and Stochastically Timed Activities: pp 145-152, Edinburgh, 2009. Available online.

Chris McCaig, Mike Begon Carron Shankland and Rachel Norman. From individual behaviour to population dynamics: changing scale in models of superspreaders in: 8th Workshop on Process Algebra and Stochastically Timed Activities: pp 159-164, Edinburgh, 2009. Available online.

C. McCaig, R. Norman and C. Shankland. From Individuals to Populations: A Symbolic Process Algebra Approach to Epidemiology. Mathematics of Computer Science 2(3):139-155, Special Issue on Symbolic Computation in Biology. Birkhauser/Springer. April 2009. Go to the Springer final version.

2008

S. Benkirane, J. Hillston, C. McCaig, R. Norman and C. Shankland. Improved Continuous Approximation of PEPA Models through Epidemiological Examples. In proceedings of From Biology to Concurrency and back, FBTC 2008. ENTCS 229(1): 59-74, Elsevier, 2008. preliminary version or go to the Science Direct final version.

C. McCaig, R. Norman and C. Shankland. Process Algebra Models of Population Dynamics. In proceedings of Algebraic Biology, 3rd International Conference, AB 2008. LNCS 5147, Springer-Verlag, pp 139-155, 2008. Preliminary version of the paper or go to the Springer final version.

C. McCaig, R. Norman and C. Shankland. Deriving mean field equations from process algebra models. Technical Report 175, University of Stirling, 2008. Available from www.cs.stir.ac.uk/research/publications/techreps.

2006

Rattray, C., Maharaj, S. and Shankland, C. (editors), Special Issue of Selected papers from Algebraic Methodlogy and Software Technology, 10th International Conference, AMAST 2004. Theoretical Computer Science, 351(2):129-294 , Elsevier, February 2006.

2005

N. Tran, C. Baral, C. Shankland. Issue in Reasoning about Interaction Networks in Cells: Necessity of Event Ordering Knowledge In proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp 676-681, AAAI press, 2005. pdf.

C. Baral, W. Kolch, C. Shankland, N. Tran. Reasoning about the ERK signal transduction pathway using BioSigNet-RR. In proceedings of Computational Methods in Systems Biology, CMSB 2005. Informal publication, pp 79-90, 2005. postscript.

2004

C. Shankland, J. Bryans and L. Morel. Expressing Iterative Properties Logically in a Symbolic Setting. In proceedings of Algebraic Methodlogy and Software Technology, 10th International Conference, AMAST 2004. LNCS 3116, Springer-Verlag, pp 460-476, 2004. postscript.

Rattray, C., Maharaj, S. and Shankland, C. (editors), Algebraic Methodlogy and Software Technology, 10th International Conference, AMAST 2004. Lecture Notes in Computer Science 3116, Springer-Verlag, July 2004.

2003

R. Norman and C. Shankland. Developing the Use of Process Algebra in the Derivation and Analysis of Mathematical Models of Infectious Disease. In Computer Aided Systems Theory - EUROCAST 2003, 9th International Workshop on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 24-28, 2003. LNCS 2809, Springer-Verlag, pp 404-414, 2003. postscript.

P. Robinson and C. Shankland. Combating Infinite State Using Ergo. In Formal Techniques for Networked and Distributed Systems - FORTE 2003, LNCS 2767, Springer-Verlag, pp 144-159, 2003. postscript.

S. Maharaj, J. Romijn and C. Shankland. IEEE 1394 Tree Identify Protocol: Introduction to the Case Study. In Formal Aspects of Computing 14 (3), pp 200-214, 2003. postscript.

C. Fidge and C. Shankland. But What if I Don't Want to Wait Forever?. In Formal Aspects of Computing 14 (3), pp 281-294, 2003. postscript.

R. Norman and C. Shankland. Developing the Use of Process Algebra in the Derivation and Analysis of Mathematical Models of Infectious Disease. Extended abstract to appear in proceedings of Eurocast 2003. postscript.

2002

M. Calder, S. Maharaj and C. Shankland. A Modal Logic for Early Symbolic Transition Systems. In the Computer Journal 45(1), pp 55-61, 2002. postscript.

2001

M. Calder and C. Shankland. A Symbolic Semantics and Bisimulation for Full LOTOS. In FORTE'01 (International Conference on Formal Description Techniques for Networked and Distributed Systems), pp 184-200, Kluwer Academic Publishers, 2001. postscript.

J. Bryans and C. Shankland. Implementing a modal logic over data and processes using XTL. In FORTE'01 (International Conference on Formal Description Techniques for Networked and Distributed Systems), pp 201-218, Kluwer Academic Publishers, 2001. postscript.

C. Shankland and A. Verdejo. A case study in abstraction using E-LOTOS and the FireWire. Computer Networks 37:481-502, Elsevier, 2001. postscript.

J. Bryans, A. Verdejo and C. Shankland. Using Rewriting Logic to implement the modal logic FULL. In Proceedings AVoCS'01: Workshop on Automated Verification of Critical Systems, published as Oxford University Computing Laboratory technical report PRG-RR-01-07, April 2001. Also appeared in Proceedings of AVIS'01: First International Workshop on Automated Verification of Infinite-State Systems, published as a Naval Reseach Laboratory Technical Memorandum, Mar 2001. postscript.

P. Robinson and C. Shankland. Implementing the modal logic FULL using Ergo. As above in AVoCS'01 and AVIS'01, Mar 2001. postscript.

C. Fidge and C. Shankland. But What if I Don't Want To Wait Forever?. Pages 15-18 in Proceedings of International Workshop on Applications of Formal Methods to IEEE Standard 1394, Mar 2001. ISBN 1-85769-1539. Extended Abstract. postscript.

S. Maharaj, J. Romijn and C. Shankland (eds). Proceedings of International Workshop on Applications of Formal Methods to IEEE Standard 1394, Mar 2001. ISBN 1-85769-1539.

M. Calder, S. Maharaj and C. Shankland. An Adequate Logic for Full LOTOS. Pages 384-395 in Proceedings of Formal Methods Europe, LNCS 2021, Springer-Verlag, 2001. postscript.

M. Calder and C. Shankland. Symbolic Bisimulation for Full LOTOS. University of Glasgow Technical Report TR-2001-77, Mar 2001.

2000

S. Maharaj and C. Shankland. A Survey of Formal Methods applied to Leader Election in IEEE 1394. Journal of Universal Computing Science, 6(11) pp 1145-1163, Nov 2000. postscript.

S. Maharaj and C. Shankland. A Survey of Formal Methods applied to IEEE 1394. In proceedings of the Joint Workshop on Formal Specification of Computer Based Systems, Edinburgh April 2000. Pages 25-26. ISBN 1-85-769121-0. Extended Abstract.

M. Calder and C. Shankland. Symbolic Bisimulation for Full LOTOS. University of Stirling Technical Report CSM 159, Oct 2000.

1999

C. Shankland. Using E-LOTOS to pick a leader. In proceedings of the Workshop on Formal Methods in Computation, Ullapool 1999. Pages 143-162. postscript.

C. Shankland and A. Verdejo. Time, E-LOTOS and the FireWire. In proceedings of the Workshop on Formal Methods and Telecommunications, Zaragoza 99, pages 103-119, Prensas Universitarias de Zaragoza, 1999. postscript.

1998

C. Shankland and M. van der Zwaag. The Tree Identify Protocol of IEEE 1394 in muCRL. Formal Aspects of Computing, Volume 10, pages 509-531, Springer-Verlag 1998. postscript.

C. Shankland. The Tree Identify Protocol of IEEE 1394. In proceedings of the Third International Workshop on Formal Methods for Industrial Critical Systems, Amsterdam 98, pages 299-319, SMC 1998. postscript.

1997

Special note: before 1997 I was also known as Kirkwood, so these really are my papers. Honest!

C. Shankland and M. Thomas. Symbolic Bisimulation for Full LOTOS. In proceedings of AMAST (Algebraic Methodology and Software Technology) 97, Lecture Notes in Computer Science 1349, pages 479-493, Springer-Verlag 1997. postscript.

C. Kirkwood and M. Thomas. Towards a Symbolic Temporal Logic for Full LOTOS. In the proceedings of the Northern Formal Methods Workshop, eWiC (http://www.springer.co.uk/ewic/), 1997. postscript.

1996

C. Kirkwood. Specifying Properties of Basic LOTOS Specifications Using Temporal Logic. In FORTE'95 (8th International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols), Chapman &; Hall, 1996. Abstract, postscript.

Earlier ...

C. Kirkwood and M. Thomas. Experiences with LOTOS Verification: A Report on Two Case Studies. In Workshop on Industrial-Strength Formal Specification Techniques, pages 159-171. IEEE Computer Society Press, 1995. Abstract, postscript.

C. Kirkwood. Verification of LOTOS Specifications using Term Rewriting Techniques. PhD thesis, University of Glasgow, 1994. Also available as University of Glasgow Technical Report, FM-94-07. Abstract, overview (abstract, table of contents, introduction, conclusions and bibliography), complete (compressed postscript 490K - expands to 1.6M).

C. Kirkwood. Automating (Specification $\equiv$ Implementation) using Equational Reasoning and LOTOS. In M.-C. Gaudel and J.-P. Jouannaud, editors, TAPSOFT '93: Theory and Practice of Software Development, Lecture Notes in Computer Science 668, pages 544-558. Springer-Verlag, 1993. postscript.

C. Kirkwood. A Case Study for the ERIL Project. Technical Report 1992/R4, University of Glasgow, 1992. postscript.

C. Kirkwood and K. Norrie. Some Experiments using Term Rewriting Techniques for Concurrency. In J. Quemada, J. Ma{\~n}as and E. Vásquez, editors, Formal Description Techniques, III, pages 527-530. Elsevier Science Publishers B.V. (North-Holland), 1991. Extended Abstract. postscript.

C. Kirkwood. An Experiment using Term Rewriting Techniques for Concurrency. In S.L. Peyton-Jones, G. Hutton and C.K. Holst, editors, Functional Programming, Glasgow, 1990, pages 196-200. Springer-Verlag, 1991. Extended Abstract. postscript.

C. Kirkwood and K. Norrie. Some Experiments using Term Rewriting Techniques for Concurrency. Technical Report CSD-TR-623, Royal Holloway and Bedford New College, 1990. postscript.

Please email me if you want any more information.


[] Research   [] Teaching   [] CV   [] Personal   [Home] Home


Dr Carron Shankland    Email: ces@cs.stir.ac.uk [email me]

Last revision: 5th September 2006