Muffy Calder

According to our database1, Muffy Calder authored at least 75 papers between 1986 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Conditional Bigraphs.
Proceedings of the Graph Transformation - 13th International Conference, 2020

2019
Stochastic Model Checking for Predicting Component Failures and Service Availability.
IEEE Trans. Dependable Secur. Comput., 2019

2018
Data-driven modelling and probabilistic analysis of interactive software usage.
J. Log. Algebraic Methods Program., 2018

Making Sense of the World: Models for Reliable Sensor-Driven Systems.
CoRR, 2018

Making Sense of the World: Framing Models for Trustworthy Sensor-Driven Systems.
Comput., 2018

Modelling and Verification of Large-Scale Sensor Network Infrastructures.
Proceedings of the 23rd International Conference on Engineering of Complex Computer Systems, 2018

2017
Temporal Analytics for Software Usage Models.
Proceedings of the Software Engineering and Formal Methods, 2017

2016
On Lions, Impala, and Bigraphs: Modelling Interactions in Physical/Virtual Spaces.
ACM Trans. Comput. Hum. Interact., 2016

Probabilistic Formal Analysis of App Usage to Inform Redesign.
Proceedings of the Integrated Formal Methods - 12th International Conference, 2016

BigraphER: Rewriting and Analysis Engine for Bigraphs.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Bigraphs with sharing.
Theor. Comput. Sci., 2015

Is my configuration any good: checking usability in an interactive sensor-based activity monitor.
Innov. Syst. Softw. Eng., 2015

Enchantress of Abstraction, Bride of Science: must Ada Lovelace be a superheroine?
Proceedings of the Ada Lovelace Symposium 2015, 2015

2014
Real-time verification of wireless home networks using bigraphs with sharing.
Sci. Comput. Program., 2014

Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing.
Formal Aspects Comput., 2014

Probabilistic Model Checking of DTMC Models of User Activity Patterns.
Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

Do I Need to Fix a Failed Component Now, or Can I Wait Until Tomorrow?
Proceedings of the 2014 Tenth European Dependable Computing Conference, 2014

2013
A process algebra framework for multi-scale modelling of biological systems.
Theor. Comput. Sci., 2013

2012
Trend-Based Analysis of a Population Model of the AKAP Scaffold Protein.
Trans. Comp. Sys. Biology, 2012

Modular modelling of signalling pathways and their cross-talk.
Theor. Comput. Sci., 2012

Process Algebra for Event-Driven Runtime Verification: A Case Study of Wireless Network Management.
Proceedings of the Integrated Formal Methods - 9th International Conference, 2012

2011
Multi-scale modelling of biological systems in process algebra with multi-way synchronisation.
Proceedings of the Computational Methods in Systems Biology, 9th International Conference, 2011

2010
Relating PDEs in Cylindrical Coordinates and CTMCs with Levels of Concentration.
Electron. Notes Theor. Comput. Sci., 2010

Process Algebra with Hooks for Models of Pattern Formation.
Electron. Notes Theor. Comput. Sci., 2010

A Model and Analysis of the AKAP Scaffold.
Electron. Notes Theor. Comput. Sci., 2010

Modelling and Analysis of Biochemical Signalling Pathway Cross-talk
Proceedings of the Proceedings Third Workshop From Biology To Concurrency and back, 2010

An Introduction to Pervasive Interface Automata.
Proceedings of the Formal Aspects of Component Software - 7th International Workshop, 2010

Understanding signalling networks as collections of signal transduction pathways.
Proceedings of the Computational Methods in Systems Biology, 8th International Conference, 2010

From species to pathway and tissue as process.
Proceedings of the Computational Methods in Systems Biology, 8th International Conference, 2010

2009
Process Algebra Modelling Styles for Biomolecular Processes.
Trans. Comp. Sys. Biology, 2009

Preface.
Electron. Notes Theor. Comput. Sci., 2009

An Inductive Technique for Parameterised Model Checking of Degenerative Distributed Randomised Protocols.
Electron. Notes Theor. Comput. Sci., 2009

Some Investigations Concerning the CTMC and the ODE Model Derived From Bio-PEPA.
Electron. Notes Theor. Comput. Sci., 2009

Tightly coupled verification of pervasive systems.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2009

Towards the Verification of Pervasive Systems.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2009

2008
An automatic abstraction technique for verifying featured, parameterised systems.
Theor. Comput. Sci., 2008

Preface.
Theor. Comput. Sci., 2008

2007
A template-based approach for the generation of abstractable and reducible models of featured networks.
Comput. Networks, 2007

2006
Analysis of Signalling Pathways Using Continuous Time Markov Chains.
, 2006

Modelling the Influence of RKIP on the ERK Signalling Pathway Using the Stochastic Process Algebra PEPA.
, 2006

Feature interaction detection by pairwise analysis of LTL properties - A case study.
Formal Methods Syst. Des., 2006

Symmetry in temporal logic model checking.
ACM Comput. Surv., 2006

Stronger Computational Modelling of Signalling Pathways Using Both Continuous and Discrete-State Methods.
Proceedings of the Computational Methods in Systems Biology, International Conference, 2006

2005
Spin-to-Grape: A Tool for Analysing Symmetry in Promela Models.
Electron. Notes Theor. Comput. Sci., 2005

Finding Symmetry in Models of Concurrent Systems by Static Channel Diagram Analysis.
Electron. Notes Theor. Comput. Sci., 2005

A Generic Approach for the Automatic Verification of Featured, Parameterised Systems.
Proceedings of the Feature Interactions in Telecommunications and Software Systems VIII, 2005

2004
Verifying parametrized, featured networks by abstraction.
Proceedings of the International Symposium on Leveraging Applications of Formal Methods, 2004

Optimising Communication Structure for Model Checking.
Proceedings of the Fundamental Approaches to Software Engineering, 2004

Abstraction for Safety, Induction for Liveness.
Proceedings of the Algebraic Methodology and Software Technology, 2004

2003
Using SPIN to Analyse the Tree Identification Phase of the IEEE 1394 High-Performance Serial Bus (FireWire) Protocol.
Formal Aspects Comput., 2003

Feature interaction: a critical review and considered forecast.
Comput. Networks, 2003

Generalising Feature Interactions in Email.
Proceedings of the Feature Interactions in Telecommunications and Software Systems VII, 2003

Hybrid Solutions to the Feature Interaction Problem.
Proceedings of the Feature Interactions in Telecommunications and Software Systems VII, 2003

Detecting Feature Interactions: How Many Components Do We Need?
Proceedings of the Objects, 2003

2002
A Modal Logic for Full LOTOS based on Symbolic Transition Systems.
Comput. J., 2002

Automatic Verification of any Number of Concurrent, Communicating Processes.
Proceedings of the 17th IEEE International Conference on Automated Software Engineering (ASE 2002), 2002

2001
Using SPIN for Feature Interaction Analysis - A Case Study.
Proceedings of the Model Checking Software, 2001

A Symbolic Semantics and Bisimulation for Full LOTOS.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2001

An Adequate Logic for Full LOTOS.
Proceedings of the FME 2001: Formal Methods for Increasing Software Productivity, 2001

1999
Hybrid approach to software interworking problems: managing interactions between legacy and evolving telecommunications software.
IEE Proc. Softw., 1999

1998
Interactive Theorem Proving: An Empirical Study of User Activity.
J. Symb. Comput., 1998

What Use are Formal Design and Analysis Methods to Telecommunications Services?
Proceedings of the Feature Interactions in Telecommunications and Software Systems V, September 29, 1998

1997
Modelling and Analysing User Views of Telecommunications Services.
Proceedings of the Feature Interactions in Telecommunications Networks IV, 1997

Symbolic Bisimulation for Full LOTOS.
Proceedings of the Algebraic Methodology and Software Technology, 1997

1995
Experiences with specification and verification in LOTOS: a report on two case studies.
Proceedings of the Workshop on Industrial-Strength Formal Specification Techniques, 1995

Experiences in applying formal methods to the analysis of software and system requirements.
Proceedings of the Workshop on Industrial-Strength Formal Specification Techniques, 1995

1993
Solving Divergence in Knuth-Bendix Completion by Enriching Signatures.
Theor. Comput. Sci., 1993

1992
A translator for ASN.1 into LOTOS.
Proceedings of the Formal Description Techniques, 1992

1990
Generalising Diverging Sequences of Rewrite Rules by Synthesising New Sorts.
Proceedings of the 1990 Glasgow Workshop on Functional Programming, 1990

1989
From 1 Notation to Another One: An ACT-ONE Semantics for ASN.1.
Proceedings of the Formal Description Techniques, 1989

Inductive Inference for Solving Divergence in Knuth-Bendix Completion.
Proceedings of the Analogical and Inductive Inference, 1989

1988
The imperative implementation of algebraic data types.
PhD thesis, 1988

Towards a Termination Ordering for Loop Programs.
Proceedings of the 6st Workshop on Abstract Data Type, 1988. University of Berlin, Germany, 1988

1987
Implementing Algebraically Specified Abstract Data Types in an Imperative Programming Language.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

1986
The Storage and Access Structure of Algebraically Specified Data Types.
Proceedings of the 4st Workshop on Abstract Data Type, 1986


  Loading...