M. Abadi & L. Lamport (1995):
Conjoining Specifications.
ACM Trans. Program. Lang. Syst. 17(3),
pp. 507–534.
Available at http://doi.acm.org/10.1145/203095.201069.
R.-J. Back & J. von Wright (1994):
Trace Refinement of Action Systems.
In: B. Jonsson & J. Parrow: CONCUR,
LNCS 836.
Springer,
pp. 367–384.
Available at http://dx.doi.org/10.1007/BFb0015020.
R.-J. Back & J. von Wright (1999):
Reasoning algebraically about loops.
Acta Informatica 36(4),
pp. 295–334,
doi:10.1007/s002360050163.
P. Baldan & S. Crafa (2010):
A Logic for True Concurrency.
In: P. Gastin & F. Laroussinie: CONCUR,
LNCS 6269.
Springer,
pp. 147–161.
Available at http://dx.doi.org/10.1007/978-3-642-15375-4_11.
S. Bäumler, G. Schellhorn, B. Tofan & W. Reif (2011):
Proving linearizability with temporal logic.
Formal Asp. Comput. 23(1),
pp. 91–112.
Available at http://dx.doi.org/10.1007/s00165-009-0130-y.
J. Boyland (2003):
Checking Interference with Fractional Permissions.
In: R. Cousot: SAS,
LNCS 2694.
Springer,
pp. 55–72.
Available at http://dx.doi.org/10.1007/3-540-44898-5_4.
A. Burns & I. J. Hayes (2010):
A timeband framework for modelling real-time systems.
Real-Time Systems 45(1-2),
pp. 106–142.
Available at http://dx.doi.org/10.1007/s11241-010-9094-5.
J. Derrick & E. A. Boiten (1999):
Non-atomic Refinement in Z.
In: J. M. Wing, J. Woodcock & J. Davies: World Congress on Formal Methods,
LNCS 1709.
Springer,
pp. 1477–1496.
Available at http://dx.doi.org/10.1007/3-540-48118-4_28.
J. Derrick & E. A. Boiten (2007):
Relational Concurrent Refinement with Internal Operations.
Electr. Notes Theor. Comput. Sci. 187,
pp. 35–53.
Available at http://dx.doi.org/10.1016/j.entcs.2006.08.043.
J. Derrick & E. A. Boiten (2009):
Relational Concurrent Refinement: Automata.
Electr. Notes Theor. Comput. Sci. 259,
pp. 21–34.
Available at http://dx.doi.org/10.1016/j.entcs.2009.12.015.
J. Derrick, S. Gnesi, D. Latella & H. Treharne (2012):
Integrated Formal Methods - 9th International Conference, IFM 2012, Pisa, Italy, June 18-21, 2012. Proceedings.
LNCS 7321.
Springer.
Available at http://dx.doi.org/10.1007/978-3-642-30729-4.
B. Dongol (2009):
Progress-based verification and derivation of concurrent programs.
The University of Queensland.
B. Dongol & J. Derrick (2012):
Proving linearisability via coarse-grained abstraction.
CoRR abs/1212.5116.
Available at http://arxiv.org/abs/1212.5116.
B. Dongol & I. J. Hayes (2010):
Compositional Action System Derivation Using Enforced Properties.
In: C. Bolduc, J. Desharnais & B. Ktari: MPC,
LNCS 6120.
Springer,
pp. 119–139.
Available at http://dx.doi.org/10.1007/978-3-642-13321-3_9.
B. Dongol & I. J. Hayes (2012):
Deriving Real-Time Action Systems Controllers from Multiscale System Specifications.
In: J. Gibbons & P. Nogueira: MPC,
LNCS 7342.
Springer,
pp. 102–131.
Available at http://dx.doi.org/10.1007/978-3-642-31113-0_7.
B. Dongol & I. J. Hayes (2012):
Rely/Guarantee Reasoning for Teleo-reactive Programs over Multiple Time Bands.
In: Derrick,
pp. 39–53.
Available at http://dx.doi.org/10.1007/978-3-642-30729-4_4.
B. Dongol, I. J. Hayes, L. Meinicke & K. Solin (2012):
Towards an Algebra for Real-Time Programs.
In: W. Kahl & T. G. Griffin: RAMICS,
LNCS 7560.
Springer,
pp. 50–65.
Available at http://dx.doi.org/10.1007/978-3-642-33314-9_4.
W. H. J. Feijen & A. J. M. van Gasteren (1999):
On a Method of Multiprogramming.
Springer Verlag.
C. J. Fidge (1993):
Real-Time Refinement.
In: J. Woodcock & P. G. Larsen: FME,
Lecture Notes in Computer Science 670.
Springer,
pp. 314–331.
Available at http://dx.doi.org/10.1007/BFb0024654.
C. J. Fidge, M. Utting, P. Kearney & I. J. Hayes (1996):
Integrating Real-Time Scheduling Theory and Program Refinement.
In: M.-C. Gaudel & J. Woodcock: FME,
LNCS 1051.
Springer,
pp. 327–346.
Available at http://dx.doi.org/10.1007/3-540-60973-3_95.
C. B. Jones & K. G. Pierce (2008):
Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification.
In: E., M. J. Butler, J. P. Bowen & P. Boca: ABZ,
Lecture Notes in Computer Science 5238.
Springer,
pp. 360–377.
Available at http://dx.doi.org/10.1007/978-3-540-87603-8_47.
W. P. de Roever & K. Engelhardt (1996):
Data Refinement: Model-oriented proof methods and their comparison.
Cambridge Tracts in Theoretical Computer Science 47.
Cambridge University Press.
D. Scholefield, H. S. M. Zedan & J. He (1993):
Real-Time Refinement: Semantics and Application.
In: A. M. Borzyszkowski & S. Sokolowski: MFCS,
LNCS 711.
Springer,
pp. 693–702.
Available at http://dx.doi.org/10.1007/3-540-57182-5_60.
C. Zhou & M. R. Hansen (2004):
Duration Calculus: A Formal Approach to Real-Time Systems.
EATCS: Monographs in Theoretical Computer Science.
Springer.