2009 |
26 | EE | Robert Colvin,
Ian J. Hayes:
CSP with Hierarchical State.
IFM 2009: 118-135 |
25 | EE | Lindsay Groves,
Robert Colvin:
Trace-based derivation of a scalable lock-free stack algorithm.
Formal Asp. Comput. 21(1-2): 187-223 (2009) |
24 | EE | Robert Colvin,
Brijesh Dongol:
A general technique for proving lock-freedom.
Sci. Comput. Program. 74(3): 143-165 (2009) |
2008 |
23 | EE | Robert Colvin,
Lars Grunske,
Kirsten Winter:
Timed Behavior Trees for Failure Mode and Effects Analysis of time-critical systems.
Journal of Systems and Software 81(12): 2163-2182 (2008) |
22 | EE | Robert Colvin,
Ian J. Hayes,
Paul A. Strooper:
Calculating modules in contextual logic program refinement.
TPLP 8(1): 1-31 (2008) |
2007 |
21 | EE | Saad Zafar,
Robert Colvin,
Kirsten Winter,
Nisansala Yatapanage,
R. Geoff Dromey:
Early Validation and Verification of a Distributed Role-Based Access Control Model.
APSEC 2007: 430-437 |
20 | EE | Lars Grunske,
Kirsten Winter,
Robert Colvin:
Timed Behavior Trees and Their Application to Verifying Real-Time Systems.
ASWEC 2007: 211-222 |
19 | EE | Lian Wen,
Robert Colvin,
Kai Lin,
John Seagrott,
Nisansala Yatapanage,
R. Geoff Dromey:
"Integrare", a Collaborative Environment for Behavior-Oriented Design.
CDVE 2007: 122-131 |
18 | EE | Robert Colvin,
Brijesh Dongol:
Verifying Lock-Freedom Using Well-Founded Orders.
ICTAC 2007: 124-138 |
17 | EE | Robert Colvin,
Lars Grunske,
Kirsten Winter:
Probabilistic Timed Behavior Trees.
IFM 2007: 156-175 |
16 | EE | Lars Grunske,
Robert Colvin,
Kirsten Winter:
Probabilistic Model-Checking Support for FMEA.
QEST 2007: 119-128 |
15 | EE | Robert Colvin,
Lindsay Groves:
A Scalable Lock-Free Stack Algorithm and its Verification.
SEFM 2007: 339-348 |
14 | EE | Lindsay Groves,
Robert Colvin:
Derivation of a Scalable Lock-Free Stack Algorithm.
Electr. Notes Theor. Comput. Sci. 187: 55-74 (2007) |
2006 |
13 | EE | Robert Colvin,
Lindsay Groves,
Victor Luchangco,
Mark Moir:
Formal Verification of a Lazy Concurrent List-Based Set Algorithm.
CAV 2006: 475-488 |
12 | EE | Robert Colvin,
Ian J. Hayes,
Paul A. Strooper:
Calculating modules in contextual logic program refinement
CoRR abs/cs/0608110: (2006) |
2005 |
11 | EE | Robert Colvin,
Lindsay Groves:
Formal Verification of an Array-Based Nonblocking Queue.
ICECCS 2005: 507-516 |
10 | EE | Robert Colvin,
Simon Doherty,
Lindsay Groves:
Verifying Concurrent Data Structures by Simulation.
Electr. Notes Theor. Comput. Sci. 137(2): 93-110 (2005) |
2004 |
9 | EE | Robert Colvin,
Lindsay Groves,
Ian J. Hayes,
David Hemer,
Ray Nickson,
Paul A. Strooper:
Developing Logic Programs from Specifications Using Stepwise Refinement.
Program Development in Computational Logic 2004: 66-89 |
2002 |
8 | EE | Robert Colvin,
Ian J. Hayes,
David Hemer,
Paul A. Strooper:
Translating Refined Logic Programs to Mercury.
ACSC 2002: 33-40 |
7 | EE | Robert Colvin,
Ian J. Hayes,
David Hemer,
Paul A. Strooper:
Refinement of Higher-Order Logic Programs.
LOPSTR 2002: 126-143 |
6 | EE | Ian J. Hayes,
Robert Colvin,
David Hemer,
Paul A. Strooper,
Ray Nickson:
A Refinement Calculus for Logic Programs
CoRR cs.SE/0202002: (2002) |
5 | EE | David Hemer,
Ian J. Hayes,
Paul A. Strooper,
Robert Colvin:
Don't Care Non-determinism in Logic Program Refinement.
Electr. Notes Theor. Comput. Sci. 61: (2002) |
4 | | Ian J. Hayes,
Robert Colvin,
David Hemer,
Paul A. Strooper,
Ray Nickson:
A refinement calculus for logic programs.
TPLP 2(4-5): 425-460 (2002) |
2000 |
3 | EE | Robert Colvin,
Ian J. Hayes,
Paul A. Strooper:
Refining Logic Programs Using Types.
ACSC 2000: 43-50 |
2 | EE | Robert Colvin,
Ian J. Hayes,
Paul A. Strooper:
Modular Logic Program Refinement.
LOPSTR 2000 |
1 | EE | Robert Colvin,
Ian J. Hayes,
Paul A. Strooper:
A Technique for Modular Logic Program Refinement.
LOPSTR (LNCS 2042: Selected Papers) 2000: 38-56 |