| 2008 |
| 47 | EE | Joachim Baran,
Howard Barringer:
Forays into Sequential Composition and Concatenation in Eagle.
RV 2008: 69-85 |
| 46 | EE | Corina S. Pasareanu,
Dimitra Giannakopoulou,
Mihaela Gheorghiu Bobaru,
Jamieson M. Cobleigh,
Howard Barringer:
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning.
Formal Methods in System Design 32(3): 175-205 (2008) |
| 2007 |
| 45 | EE | Naikuo Yang,
Howard Barringer,
Ning Zhang:
A Purpose-Based Access Control Model.
IAS 2007: 143-148 |
| 44 | EE | Howard Barringer,
David E. Rydeheard,
Klaus Havelund:
Rule Systems for Run-Time Monitoring: From Eagleto RuleR.
RV 2007: 111-125 |
| 43 | EE | Howard Barringer,
Dov M. Gabbay,
David E. Rydeheard:
From Runtime Verification to Evolvable Systems.
RV 2007: 97-110 |
| 42 | EE | Howard Barringer,
David E. Rydeheard,
Dov M. Gabbay:
A Logical Framework for Monitoring and Evolving Software Components.
TASE 2007: 273-282 |
| 41 | EE | Joachim Baran,
Howard Barringer:
A Grammatical Representation of Visibly Pushdown Languages.
WoLLIC 2007: 1-11 |
| 2006 |
| 40 | EE | Howard Barringer,
Bernd Finkbeiner,
Yuri Gurevich,
Henny B. Sipma:
Preface.
Electr. Notes Theor. Comput. Sci. 144(4): 1 (2006) |
| 39 | EE | Cornelia P. Inggs,
Howard Barringer:
CTL* model checking on a shared-memory architecture.
Formal Methods in System Design 29(2): 135-155 (2006) |
| 2005 |
| 38 | | Sergei N. Artëmov,
Howard Barringer,
Artur S. d'Avila Garcez,
Luís C. Lamb,
John Woods:
We Will Show Them! Essays in Honour of Dov Gabbay, Volume One
College Publications 2005 |
| 37 | | Sergei N. Artëmov,
Howard Barringer,
Artur S. d'Avila Garcez,
Luís C. Lamb,
John Woods:
We Will Show Them! Essays in Honour of Dov Gabbay, Volume Two
College Publications 2005 |
| 36 | EE | Howard Barringer,
Dov M. Gabbay,
John Woods:
Temporal Dynamics of Support and Attack Networks: From Argumentation to Zoology.
Mechanizing Mathematical Reasoning 2005: 59-98 |
| 35 | | Howard Barringer,
David E. Rydeheard:
Modelling Evolvable Systems: A Temporal Logic View.
We Will Show Them! (1) 2005: 195-228 |
| 34 | EE | Dimitra Giannakopoulou,
Corina S. Pasareanu,
Howard Barringer:
Component Verification with Automatically Generated Assumptions.
Autom. Softw. Eng. 12(3): 297-320 (2005) |
| 33 | EE | Cornelia P. Inggs,
Howard Barringer:
CTL ast Model Checking on a Shared-Memory Architecture.
Electr. Notes Theor. Comput. Sci. 128(3): 107-123 (2005) |
| 32 | EE | Cyrille Artho,
Howard Barringer,
Allen Goldberg,
Klaus Havelund,
Sarfraz Khurshid,
Michael R. Lowry,
Corina S. Pasareanu,
Grigore Rosu,
Koushik Sen,
Willem Visser,
Richard Washington:
Combining test case generation and runtime verification.
Theor. Comput. Sci. 336(2-3): 209-234 (2005) |
| 2004 |
| 31 | EE | Howard Barringer,
Allen Goldberg,
Klaus Havelund,
Koushik Sen:
Program Monitoring with LTL in EAGLE.
IPDPS 2004 |
| 30 | EE | Howard Barringer,
Allen Goldberg,
Klaus Havelund,
Koushik Sen:
Rule-Based Runtime Verification.
VMCAI 2004: 44-57 |
| 2002 |
| 29 | EE | Dimitra Giannakopoulou,
Corina S. Pasareanu,
Howard Barringer:
Assumption Generation for Software Component Verification.
ASE 2002: 3-12 |
| 28 | EE | Howard Barringer,
Donal Fellows,
Graham Gough,
Alan Williams:
Rainbow: Development, Simulation and Analysis Tools for Asynchronous Micropipeline Hardware Design.
Comput. J. 45(1): 2-11 (2002) |
| 27 | EE | Cornelia P. Inggs,
Howard Barringer:
Effective State Exploration for Model Checking on a Shared Memory Architecture.
Electr. Notes Theor. Comput. Sci. 68(4): (2002) |
| 2000 |
| 26 | EE | Willem Visser,
Howard Barringer:
Practical CTL* Model Checking: Should SPIN be Extended?
STTT 2(4): 350-365 (2000) |
| 1997 |
| 25 | | Willem Visser,
Howard Barringer,
Donal Fellows,
Graham Gough,
Alan Williams:
Efficient CTL* model checking for analysis of rainbow designs.
CHARME 1997: 128-145 |
| 1996 |
| 24 | | Howard Barringer,
Graham Gough,
Brian Monahan,
Alan Williams:
A Process Algebra Foundation for Reasoning about Core ELLA.
Comput. J. 39(4): 303-324 (1996) |
| 23 | EE | Howard Barringer,
Graham Gough,
Derek Brough,
Dov M. Gabbay,
Ian M. Hodkinson,
Anthony Hunter,
Richard Owens,
Peter McBrien,
Mark Reynolds,
Michael Fisher:
Languages, Meta-languages and METATEM, A Discussion Paper.
Logic Journal of the IGPL 4(2): 255-272 (1996) |
| 1995 |
| 22 | | Ana Cristina Vieira de Melo,
Howard Barringer:
A foundation for formal reuse of hardware.
CHARME 1995: 124-145 |
| 21 | | Howard Barringer,
Graham Gough,
Brian Monahan,
Alan Williams:
Formal support for the ELLA hardwar description language.
CHARME 1995: 225-245 |
| 20 | | Howard Barringer,
Michael Fisher,
Dov M. Gabbay,
Graham Gough,
Richard Owens:
METATEM: An Introduction.
Formal Asp. Comput. 7(5): 533-549 (1995) |
| 1994 |
| 19 | | Clare Dixon,
Michael Fisher,
Howard Barringer:
A Graph-Based Approach to Resolution in Temporal Logic.
ICTL 1994: 415-429 |
| 1991 |
| 18 | | Howard Barringer,
Michael Fisher,
Dov M. Gabbay,
Anthony Hunter:
Meta-Reasoning in Executable Temporal Logic.
KR 1991: 40-49 |
| 17 | | Howard Barringer:
Editorial.
J. Log. Comput. 1(5): 573-574 (1991) |
| 1989 |
| 16 | | Behnam Banieqbal,
Howard Barringer,
Amir Pnueli:
Temporal Logic in Specification, Altrincham, UK, April 8-10, 1987, Proceedings
Springer 1989 |
| 15 | | Howard Barringer,
Michael Fisher,
Graham Gough:
Fair SMG and Linear Time Model Checking.
Automatic Verification Methods for Finite State Systems 1989: 133-150 |
| 14 | | Howard Barringer,
Michael Fisher,
Dov M. Gabbay,
Graham Gough,
Richard Owens:
METATEM: A Framework for Programming in Temporal Logic.
REX Workshop 1989: 94-129 |
| 1988 |
| 13 | | Howard Barringer,
Dov M. Gabbay:
Executing Temporal Logic: Review and Prospects (Abstract).
Concurrency 1988: 104-105 |
| 12 | EE | Victoria Stavridou,
Howard Barringer,
David A. Edwards:
Formal Specification and Verification of Hardware: A Comparative Case Study.
DAC 1988: 197-204 |
| 11 | | Graham Gough,
Howard Barringer:
A Semantics Driven Temporal Verification System.
ESOP 1988: 21-33 |
| 1987 |
| 10 | | Behnam Banieqbal,
Howard Barringer:
Temporal Logic with Fixed Points.
Temporal Logic in Specification 1987: 62-74 |
| 9 | | Howard Barringer:
Up and Down The Temporal Wey.
Comput. J. 30(2): 134-148 (1987) |
| 1986 |
| 8 | | Howard Barringer,
Ruurd Kuiper,
Amir Pnueli:
A Really Abstract Concurrent Model and its Temporal Logic.
POPL 1986: 173-183 |
| 7 | | Howard Barringer,
I. Mearns:
A Proof System for Ada Tasks.
Comput. J. 29(5): 404-415 (1986) |
| 1985 |
| 6 | | Howard Barringer:
A Survey of Verification Techniques for Parallel Programs
Springer 1985 |
| 1984 |
| 5 | | Howard Barringer,
Ruurd Kuiper,
Amir Pnueli:
Now You May Compose Temporal Logic Specifications
STOC 1984: 51-63 |
| 4 | | Howard Barringer,
Ruurd Kuiper:
Hierarchical Development of Cncurrent Systems in a Temporal Logic Framework.
Seminar on Concurrency 1984: 35-61 |
| 3 | | Howard Barringer,
J. H. Cheng,
Cliff B. Jones:
A Logic Covering Undefinedness in Program Proofs.
Acta Inf. 21: 251-269 (1984) |
| 1983 |
| 2 | | Howard Barringer,
Ruurd Kuiper:
Towards the Hierarchical, Temporal Logic, Specification.
The Analysis of Concurrent Systems 1983: 157-183 |
| 1979 |
| 1 | | Howard Barringer,
P. C. Capon,
R. Philips:
The Portable Compiling Systems of MUSS.
Softw., Pract. Exper. 9(8): 645-655 (1979) |