Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: Description: \\Unix1\muffy\public_html\line3.gif

Publications in chronological order

1.       O. Andrei M. Calder.
Temporal Analytics for Software Usage Models
Proceedings 6th Intl Symposium “From Data to Models and Back  DataMod 2017, Lecture Notes in Computer Science, vol. x, 2017 .DOI

2.       M. Calder, M. Sevegnani.
Stochastic model checking for predicting component failures and service availability
IEEE Transactions on Dependable and Secure Computing, in press, 2017.DOI

3.       S. Benford,T. Rodden, M. Calder, M. Sevegnani.
On lions, impala, and bigraphs: modelling interactions in physical/virtual spaces.
ACM Transactions on Computer-Human Interaction, vol. 23, issue 2, May 2016. DOI

4.       M. Sevegnani, M. Calder.
BigraphER:rewriting and analysis engine for bigraphs.
CAV 2016,
28th International Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol. 9780, part II, Springer, 2016.

5.       O. Andrei, M. Calder, M. Chalmers, A. Morrison, M. Rost.
Probabilistic Formal Analysis of App Usage to Inform Redesign.
Proceedings 12th International Conference on Integrated Formal Methods, iFM 2016, Lecture Notes in Computer Science, vol. 9681, 2016. DOI

6.       M. Sevegnani, M. Calder.
Bigraphs with sharing.
Theoretical Computer Science, vol. 577, pp 43--74, Elsevier, 2015. Online copy http://www.sciencedirect.com/science/article/pii/S0304397515001085

7.       M. Calder.
What makes a good science policy?
fst journal, Foundation for Science and Technology, volume 21(5), March 2015.

8.       O. Andrei, M. Calder, M. Higgs, M. Girolami.
Probabilistic Model Checking of DTMC Models of User Activity Patterns
Proceedings QEST 2014, Lecture Notes in Computer Science, vol. 8657, pp. 138--153, 2014.

9.       M. Calder, M. Sevegnani.
Do I need to fix a failed component now, or can I wait until tomorrow?
EDCC (Tenth European Dependable Computing Conference), IEEE, 2014.

10.   A. Degasperi, M. Calder.
A Process Algebra Framework for Multi-Scale Modelling of Biological Systems.
Theoretical Computer Science, Elsevier, vol. 488, pp. 15--45, 2013. http://dx.doi.org/10.1016/j.tcs.2013.03.018

11.   M. Calder, A. Koliousis, M. Sevegnani, J. Sventek.
Real-time verification of wireless home networks using bigraphs with sharing.
Science of Computer Programming, volume 80, part B, Feb., pp. 288--310, 2014. Online copy at http:/www.sciencedirect.com/science/article/pii/S0167642313001974.

12.   M. Calder, M. Sevegnani.
Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing.
Formal Aspects of Computer Science, vol. 26, issue 3, pp. 537--561,Springer, doi:10.1007/s00165-012-0270-3, 2014.

13.   M. Calder, P. Gray, C. Unsworth.
Is my configuration any good: checking usability in an interactive sensor-based activity monitor.
Innovations in System and Software Engineering, volume 11, issue 2, pp. 131--142 Springer, doi:10.1007/s11334-013-0203-1, 2015.

14.   M. Calder, R. Donaldson.
Modular modelling of signalling pathways and their crosstalk.
Theoretical Computer Science, Volume 456, pp. 30-50, October 2012.http://dx.doi.org/10.1016/j.tcs.2012.07.003

15.   O. Andrei, M. Calder.
Trend-based Analysis of a Population Model of the AKAP Scaffold Protein.
Transactions on Computational Systems Biology XIV, LNBI vol. 7625, pp. 1--25, Springer, 2012.

16.   M. Calder, M. Sevegnani.
Process algebra for event-driven runtime verification: a case study of wireless network managment.
Proceedings 9th International Conference on Integrated Formal Methods, IFM 2012, Pisa, Italy, Lecture Notes in Computer Science, volume 7321, pp 21-23, 2012.

17.   A. Degasperi, M. Calder.
Multi-Scale Modelling of Biological Systems in Process Algebra with Multi-way Synchronisation.
Proceedings 9th International CMSB 2011 (International Computational Systems Biology), Paris, France. 978-1-4503-0817-5, 2011.

18.   R. Donaldson, C. Talcott, M. Knapp, M. Calder.
Understanding Signalling Networks as Collections of Signal Transduction Pathways
Proceedings of 8th International CMSB (Computational Methods in Systems Biology), ACM, 2010. http://portal.acm.org/citation.cfm?id=1839764\&picked=prox2010.

19.   M. Calder, P. Gray, A. Miller and C. Unsworth.
An introduction to Pervasive Interface Automata
Proceedings of 7th International FACS (Formal Aspects of Component Software). LNCS vol. 6921, pp.71-87, 2011.

20.   O. Andrei and M. Calder.
A model and Analysis of the AKAP Scaffold.
CS2Bio2010, ENTCS 268, pages 3-15, Elsevier, 2010.

21.   M. Calder, O. Andrei, A. Degasperi and R. Donaldson.
From species to pathway and tissue as process
Proceedings of 8th International CMSB (Computational Methods in Systems Biology), ACM, 2010. http://portal.acm.org/citation.cfm?id=1839764\&picked=prox2010.

22.     A. Degasperi, M. Calder.
Process Algebra with Hooks for Models of Pattern Formation.
CS2Bio2010, ENTCS 268, pages 31-47, Elsevier, 2010

23.   A. Degasperi, M. Calder.
Relating PDEs in Cylindrical Coordinates and CTMCs with Levels of Concentration.
CS2Bio2010, ENTCS 268, pages 49-59, Elsevier, 2010.

24.   R. Donaldson, M. Calder.
Modelling and and Analysis of Biochemical Signalling Pathway Crosstalk.
FBTC 2010, ENTCS 118, pp. 01-15, Elsevier, 2010.

25.   M. Sevegnani, M. Calder.
Bigraphs with sharing
DCS Technical Report Series, University of Glasgow, TR-2010-310, 2010.

26.   M. Sevegnani, C. Unsworth, M. Calder.
A SAT based algorithm for the matching problem in biraphs with sharing
DCS Technical Report Series, University of Glasgow, TR-2010-311, 2010.

27.   M. Calder, J. Hillston.
Process algebra modelling styles for biomolecular processes.
Transactions on Computational Systems Biology XI, LNBI 5750, pp.1-25, Springer, 2009.

28.   M. Calder, P. Gray and C. Unsworth
Tightly coupled verification of pervasive systems
Proceedings of the Third International Workshop on Formal Methods for Interactive Systems (FMIS 2009) Electronic Communications of the EASST, volume X, 2009.

29.   M. Calder, S. Gilmore, J. Hillston and V. Vyshemirsky
Formal methods for biochemical signalling pathways

Formal Methods: State of the Art and New Directions, Springer, 2009.

30.   A. Miller and M. Calder.
An automatic abstraction technique for verifying featured, parameterised systems

Theoretical Computer Science, 404, pp. 235-255, 2008.

31.   F. Ciochetta, A. Degasperi, J. Hillston, M. Calder.
Some investigations concerning the CTMC and the ODE model derived from Bio-PEPA

Proceedings of FBTC 2008, ENTCS vol. 17350, Elsevier, 2008.

32.   M. Calder, S. Gilmore (Editors)
Computational Methods for Systems Biology

Theoretical Computer Science, volume 408, Elsevier, 2008.

33.   D. Graham, M. Calder, and A Miller
An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols

Proceedings of AVOCS 07 (Automated Verification of Critical Systems), ENTCS vol. 250, pp.87-103, Elsevier 2009.

34.   M. Calder, S. Gilmore (Editors)
Computational Methods for Systems Biology
Lecture Notes in Bioinformatics, volume 4695, Springer, 2007.

35.   M. Calder, S. Gilmore and J. Hillston
Modelling the influence of RKIP on the ERK signalling pathway using the stochastic process algebra PEPA

Transactions on Computational Systems Biology VII, vol. 4230, pp. 1-23, Springer, 2006.

36.   A. Miller, A. Donaldson and M. Calder
Symmetry in temporal logic model checking

Computing Surveys, ACM ,vol. 38, issue 3,pp. 1-36, 2006.

37.   A. Miller, M. Calder and A. Donaldson
A template-based approach for the generation of abstractable and reducible models of featured networks

Computer Networks, vol
. 51(2), pp. 439-455, Elsevier, 2007.

38.   M. Calder, A. Duguid, S. Gilmore and J. Hillston.
Stronger computational modelling of signalling pathways using both continuous and discrete-space methods

Computational Methods in Systems Biology (CMSB 2006), LNBI vol. 421, pp. 63-78, 2006.

39.   M. Calder, V. Vyshemirsky, D. Gilbert, and R. Orton.
Analysis of Signalling Pathways using Continuous Time Markov Chains

Transactions on Computational Systems Biology VI, vol. 4220, pp. 44-67, Springer, 2006.

40.   M. Calder and A. Miller
Feature Interaction Detection by Pairwise Analysis of LTL Properties--a case study

Formal Methods in System Design, Volume 28(30), pp. 213-261, May 2006.

41.   M. Calder and J. Hillston
What do scaffold proteins really do?

Fifth Workshop on Process Algebra and Stochastically Timed Activities (PASTA 2006), Imperial College, 2006.

42.   A. Miller and M. Calder.
A generic approach for the automatic verification of featured, parameterised systems

Proceedings of Eighth International Conference on Feature Interactions in Telecommunications and Software Systems (ICFI '05) ,
pp 217-235, IOS Press, 2005.

43.   M. Calder, S. Gilmore and J. Hillston.
Automatically deriving ODEs from process algebra models of signalling pathways

Proceedings of CMSB 2005 (Computational Methods in Systems Biology),
pp 204-215, 2005.

44.   M. Calder, V. Vyshemirsky, D. Gilbert and R. Orton.
Analysis of Signalling Pathways using the Prism Model Checker

Proceedings of CMSB 2005 (Computational Methods in Systems Biology),
pp 179-190,2005.

45.   W. Kolch, M. Calder and D. Gilbert.
When kinases meet mathematics: the systems biology of MAPK signalling

FEBS Letters, vol. 579,
pp 1891--1895,2005.

46.   R. Orton, O. Sturm, V. Vyshemirsky, M. Calder, D. Gilbert and W. Kolch.
Computational Modelling of the Receptor Tyrosine Kinase Activated MAPK Pathway

Biochemical Journal, vol. 392,
pp 249--261,2005.

47.   M. Calder, S. Gilmore and J. Hillston.
Modelling the influence of RKIP on the ERK signalling pathway using the stochastic process algebra PEPA

Proceedings of Bio-CONCUR 2004, Electronic Notes in Theoretical Computer Science, 2004.

48.   A. Donaldson, A. Miller and M. Calder.
Finding symmetry in models of concurrent systems by static channel diagram analysis

Electronic Notes in Theoretical Computer Science, vol. 128/6, pp 161-177, Elsevier, 2004.

49.   M Calder and A. Miller.
Verifying parameterised, featured networks by abstraction
Proceedings of the first International Symposium on Leveraging Applications of Formal Methods (ISOLA'04), pp 227--234.

50.   M Calder and A. Miller.
Detecting Feature Interactions: how many components do we need?
Objects, Agents and Features. Lecture Notes in Computing Science, vol. 2975, pp 45-66, 2004.

51.   P.Saffrey and M. Calder.
Optimising Communications Structure for Model Checking Lecture Notes in Computer Science,
Proceedings of FASE 2004, Lecture Notes in Computer Science, vol. 2984, pp 310-3224, Springer Verlag, 2004.

52.   A.Miller and M Calder.
An application of abstraction and induction techniques to degenerating systems of processes.
Proceedings of the International Workshop on Model-Checking for Dependable Software Intensive Systems (MCDSIS '03), IEEE Computer Society Press, 2003.

53.   M Calder, M. Kolberg E. Magill, D. Marples and S. Reiff-Marganiec.
Hybrid Solutions to the Feature Interaction Problem
Feature Interactions in Telecommunications and Software Systems VII, IOS Press. pp.187-205, 2003.

54.   M Calder and A. Miller
Generalising Feature Interactions in Email
Feature Interactions in Telecommunications and Software Systems VII, IOS Press. pp. 295-217, 2003.

55.   M Calder, E. Magill, M. Kolberg, and S. Reiff-Marganiec.
Feature Interaction: A Critical Review and Considered Forecast.
Computer Networks
, Volume 41/1, pp. 115-141, North-Holland. January 2003.

56.   M. Calder and A. Miller.
Using SPIN to Analyse the FireWire Protocol -- a Case Study.
Formal Aspects of Computer Science, vol. 14, no. 3, pp. 247266, Springer Verlag, 2003.

57.   M. Calder and A. Miller.
Automated verification of any number of concurrent, communicating processes.
Proceedings of 17th IEEE Automated Software Engineering
(ASE 2002), pp. 227-230, IEEE, 2002.

58.   M. Calder and A. Miller.
Five ways to use symmetry and induction in the verification of networks of processes using model-checking.
Proceedings of Automated Verification of Critical Systems (AVoCS),2002.

59.   M. Calder, S. Maharaj, and C. Shankland.
A Modal Logic for Full LOTOS based on Symbolic Transition Systems.
The Computer Journal, Volume 45, No.1, pp. 55--61, 2002.

60.   M. Calder and A. Miller.
Using SPIN for Feature Interaction: Analysis -- a Case Study.
Proceedings of the 8th International SPIN Workshop (SPIN 2001), Toronto, Canada, Lecture Notes in Computer Science, Volume 2057, pp. 143--162, 2001.

61.   M. Calder and A. Miller.
Using the Model Checker SPIN to Detect Feature Interactions in Telecommunications Services.
University of Glasgow, Computing Science Technical Report TR-2001-91. 2001.

62.   M. Calder, S. Maharaj, and C. Shankland.
An Adequate Logic for Full LOTOS.
Proceedings of FME 2001, Lecture Notes in Computer Science. vol. 2021, pp.384-395, 2001.

63.   M. Calder and C. Shankland.
A Symbolic Semantics and Bisimulation for Full LOTOS.
Proceedings of FORTE 2001, 21st International Conference on Formal Techniques for Networked and Distributed Systems, Korea, 2001. M.Kim, B.Chin, S.Kang and D.Lee (Eds.), pp. 184--200, Kluwer Academic Publishers, 2001.

64.   M Calder, E. Magill, S. Reiff-Marganiec, and V. Thayananthan.
Theory and Practice of Enhancing a Legacy Software System.
Systems Engineering for Business Process Change (volume 2), P.Henderson (ed.) Springer-Verlag, 2001.

65.   M. Calder and S. Reiff.
Modelling Legacy Telecommunications Switching Systems for Interaction Analysis.
Systems Engineering for Business Process Change, P. Henderson (ed.), pp. 182-195, Springer-Verlag, 2000.

66.   M. Calder and E. Magill, Editors.
Feature Interactions in Telecommunications and Software Systems VI.
IOS Press, 2000.

67.   M. Calder, E. Magill and D. Marples.
A Hybrid Approach to Software Interworking Problems: Managing Interactions between Legacy and Evolving Telecommunications Software.
IEE Proceedings - Software, Vol. 146, No. 3, June 1999.
Abstract only in electronic form, please contact the authors for a hard copy of the full paper.

68.   M. Calder and C. Shankland.
A Symbolic Semantics and Bisimulation for Full LOTOS.
University of Glasgow, Computing Science Technical Report TR-2001-77.

69.   M. Calder.
What Use are Formal Analysis and Design Methods to Telecommunications Services?
In Feature Interactions in Telecommunications and Software Systems, pp. 23-31, IOS Press, 1998.

70.   M. Thomas.
Modelling and Analysing User Views of Telecommunications Services.
In Feature Interactions in Telecommunications Systems, pp. 168-183, IOS Press, 1997.

71.   P. Jeffcutt and M. Thomas.
Organisation, Information and Computation.
ORGANIZATION, 5/3, pp. 397-423, August 1998.

72.   M. Calder and A. Miller.
Analysing a Basic Call Protocol using PROMELA/XSPIN.
Proceedings SPIN '98: Workshop on Automata Theoretic Verification with the SPIN model Checker, pp. 169-181, Paris, G. Holzmann, Ed., 1998.

73.   C. Shankland and M. Thomas.
Symbolic Bisimulations for Full LOTOS.
In Lecture Notes in Computer Science vol. 1349, pp. 479-493, Springer-Verlag, 1997.

74.   S. Aitken, P. Gray, T. Melham, and M. Thomas.
A Study of User Activity in Interactive Theorem Proving.
Journal of Symbolic Computation, vol. 25, no. 2, pp. 263-284, February 1998.

75.   M. Thomas.
Formal Methods and their Role in Developing Safe Systems.
High Integrity Systems Journal, Volume 1, Number 5, Oxford University Press, pp. 447-451, 1996.

76.   C. Kirkwood and M. Thomas.
Experiences with LOTOS: A Report on Two Case Studies.
Proceedings of WIFT '95 159-172, pp. IEEE Computer Society Press, 1995.

77.   M. Thomas and B. Ormsby.
On the Design of Side-Stick Controllers in Fly-By-Wire Aircraft.

ACM Applied Computing Review
, Volume 2, Number 1, Spring 1994.

78.   U. Martin and M. Thomas.
Verification Techniques for LOTOS.
Proceedings of Formal Methods Europe '94, Lecture Notes in Computer Science, Volume 873, Springer Verlag, 1994.

79.   M. Thomas.
The Story of the Therac-25 in LOTOS.
High Integrity Systems Journal, Volume 1, Number 1, Oxford University Press, pp. 3-17, 1994.

80.   M. Thomas.
A Proof of Incorrectness using LP: the Editing Problem from the Therac-25.
High Integrity Systems Journal, Volume 1, Number 1, Oxford University Press, pp. 35-49, 1994.

81.   P. Jeffcutt and M. Thomas.
Order, Disorder and the Unmanageability of Boundaries in Organised Life.
In the Realm of Organisation, R. Chia (ed.), Routledge, 1997.

82.   M. Thomas and P. Watson.
Solving Divergence in Knuth-Bendix Completion by Enriching Signatures.
Theoretical Computer Science (Elsevier) 112 pp. 145 - 185, 1993.

83.   M. Thomas.
A Translator Tool for ASN.1 into LOTOS.
Formal Description Techniques V. Elsevier (North Holland) Science Publishers, M. Diaz, R. Groz (eds.), B.V. Amsterdam, 1993, pp. 37-52, 1993.

84.   M. Thomas.
Algebraic Semantics.Chapter 4
in D.A. Watt, Programming Language Syntax and Semantics pp. 147-183, Prentice Hall 1991.

85.   M. Thomas and P. Watson.
Generalising Sequences of Rewrite Rules by Synthesising New Sorts.
Extended Abstract, Functional Programming, Glasgow 1990, pp.268-273, Workshops in Computing, S. Peyton-Jones, G. Hutton, C. Kehler Holst (eds.), Springer-Verlag 1991.

86.   M. Thomas.
From 1 Notation to Another One: An ACT-ONE Semantics for ASN.1.
Formal Description Techniques II , pp. 517-532, S.T. Vuong (Ed.), Elsevier (North Holland) Science Publishers, B.V. Amsterdam, 1990.

87.   M. Thomas and K. Jantke
Inductive Inference for Knuth Bendix Completion
Lecture Notes in Computer Science vol. 397 288-303, Springer Verlag, 1989.

88.   M. Thomas
Implementing Algebraically Specified Abstract Data Types in an Imperative Programming Language
Proceedings
of TAPSOFT 87, Lecture Notes in Computer Science vol. 250 197-211, Springer Verlag, 1987.

89.   Verification of LOTOS Specifications, Final Project Report, from SERC/IED Project IEATP/SE/IED4/1/1477. March 1993.
Published as University of Glasgow Department of Computing Science Research Report FM-1993-8.