Items where division is "Faculties > Sciences > School of Computing > Theoretical Computing Group"

A

Aichernig, Bernhard K. and Boiten, Eerke Albert and Butler, Michael and Derrick, John and Groves, Lindsay (2009) Preface: Special Issue on REFINE 2006. Formal Aspects of Computing, 21 (1-2). ISSN 0934-5043. (doi:https://doi.org/10.1007/s00165-008-0100-9) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Aichernig, Bernhard K. and Boiten, Eerke Albert and Derrick, John and Groves, Lindsay (2007) Preface: Proceedings of the 11th BCS-FACS Refinement Workshop, Macao, 2006. Electronic Notes in Theoretical Computer Science, 187 . p. 1. ISSN 1571-0661. (doi:https://doi.org/10.1016/j.entcs.2006.08.040) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Akehurst, David H. and Bordbar, Behzad and Derrick, John and Waters, A. Gill (2002) Design Support for Distributed Systems: DSE4DS. In: Finney, Joe and Haahr, Mads and Montressor, Alberto, eds. Procedings of the 7th Cabernet Radicals Workshop. (Full text available)

Preview

Akehurst, David H. and Bowman, Howard and Bryans, Jeremy W. and Derrick, John (2000) A Manual for a ModelChecker for Stochastic Automata. Technical report. n/a (Full text available)

Preview

Akehurst, David H. and Derrick, John and Waters, A. Gill (2003) Design and Verification of Distributed Multi-media Systems. In: Najm, Elie and Nestmann, Uwe and Stevens, Perdita, eds. FMOODS 2003 - 6th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems. Lecture Notes in Computer Science, 2884. Springer pp. 276-292. ISBN 3-540-20491-1. (Full text available)

Preview

Alexander, Kaganovsky (1999) Computing with Exact Real Numbers in a Radix-r System. Technical report. , University of Kent at Canterbury (Full text available)

Preview Preview

Anzellotti, G. and Battiti, Roberto and Lazzizzera, I. and Soncini, G. and Zorat, Alessandro and Sartori, Alvise and Tecchiolli, Giampietro and Lee, Peter (1995) Totem:. a Highly Parallel Chip for Triggering Applications with Inductive Learning Based on the Reactive Tabu Search. In: International Journal of Modern Physics C. World Scientific Publ Co Pte Ltd pp. 555-560. (doi:https://doi.org/10.1142/S0129183195000423) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Arts, Thomas and Earle, Clara Benac and Derrick, John (2003) Development of a Verified Erlang Program for Resource Locking. Software Tools for Technology Transfer (STTT), 5 (2). pp. 205-220. ISSN 1433-2779. (doi:https://doi.org/10.1007/s10009-003-0114-9) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Arts, Thomas and Earle, Clara Benac and Derrick, John (2002) Verifying Erlang code: a resource locker case-study. In: Eriksson, Lars-Henrik and Lindsay, Peter A., eds. In Proc. Formal Methods Europe: Getting IT Right, Copenhagen, Denmark. LNCS, 2391. Springer-Verlag pp. 184-203. ISBN 3-540-43928-5. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Arts, Thomas and Earle, Clara Benac and Penas, Juan José Sánchez (2004) Translating Erlang to muCRL. In: 4th International Conference on Application of Concurrency to System Design. IEEE Computer Society Press, Piscataway, New Jersey pp. 135-144. ISBN 0-7695-2077-4. (Full text available)

Preview Preview

Asveld, Peter R. J. and Boiten, Eerke Albert (1986) A Generator for Turing Machine Simulation Programs - user's manual. Technical report. Universiteit Twente (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Augusto, Juan Carlos and Gomez, Rodolfo (2003) A Procedure to Translate PARADIGM Specifications to Propositional Linear Temporal Logic and its Application to Verification. International Journal of Software Engineering and Knowledge Engineering, 13 (6). pp. 627-654. ISSN 0218-1940. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

B

Barnes, David J. and Fincher, Sally and Thompson, Simon (1997) Introductory Problem Solving in Computer Science. In: Daughton, Goretti and Magee, Patricia, eds. 5th Annual Conference on the Teaching of Computing. , Centre for Teaching Computing, Dublin City University, Dublin 9, Ireland pp. 36-39. (Full text available)

Preview

Barnes, David J. and Hopkins, Tim (2000) The evolution and testing of a medium sized numerical package. In: Langtangen, Hans Petter and Bruaset, Are Magnus and Quak, Ewald, eds. Advances In Software Tools For Scientific Computing. Springer-Verlag Berlin pp. 225-237. ISBN 3-540-66557-9. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bartoszek, Bozena and Czeck, Zbigniew and Konopka, Marek (1993) Parallel Searching for a First Solution. Technical report. University of Kent, Canterbury, UK, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Bassett, Eryl E. and Brooks, Stephen P. and Morgan, Byron J. T. (1994) Minitab macros for multivariate analysis. Computational Statistics and Data Analysis, 17 (1). pp. 100-101. ISSN 0167-9473. (doi:https://doi.org/10.1016/0167-9473(94)90031-0) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Battiti, Roberto and Lee, Peter and Sartori, Alvise and Tecchiolli, Giampietro (1995) Special-purpose parallel architectures for high-performance machine learning. In: Hertzberger, Bob and Serazzi, Giuseppe, eds. Hight-Performance Computing and Networking. Springer-Verlag Berlin p. 944. ISBN 3-540-59393-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Beckett, David J. (1995) Combined Log System. In: Computer Networks and ISDN Systems. Elsevier Science BV, Amsterdam, Netherlands pp. 1089-1096. (doi:https://doi.org/10.1016/0169-7552(95)00013-W) (Full text available)

Preview

Beezer, Anthony E. and Mitchell, John C. and Colegate, Rachel M. and Scally, David J. and Twyman, Lance J. and Willson, Richard J. (1995) Microcalorimetry in the Screening of Discovery Compounds and in the Investigation of Novel Drug-Delivery systems. In: Thermochimica Acta. Elsevier pp. 277-283. (doi:https://doi.org/10.1016/0040-6031(94)01966-K) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Benoy, Florence and King, Andy (1996) Inferring Argument Size Relationships with CLP(R). In: Gallagher, John, ed. Logic Programming Synthesis and Transformation. Lecture Notes in Computer Science, 1207 . Springer-Verlag, pp. 204-223. ISBN 3-540-62718-9. (Full text available)

Preview

Benoy, Florence and King, Andy (1999) An Isomorphism between Abstract Polyhedral Cones and Definite Boolean Functions. University of Kent, School of Computing, University of Kent, 21 pp. (Full text available)

Preview

Blackburn, Steve and Jones, Richard E. and McKinley, Kathryn S. and Moss, J.Eliot B. (2002) Beltway: Getting Around Garbage Collection Gridlock. In: Hendren, Laurie J., ed. Proceedings of PLDI'02 Programming Language Design and Implementation. Association for Computing Machinery, Berlin pp. 153-164. ISBN 1-58113-463-0. (Full text available)

Preview Preview

Blair, Gordon S. and Blair, Lynne and Bowman, Howard and Chetwynd, Amanda G. (1997) Formal Specification of Distributed Multimedia Systems. University College London Press, 352 pp. ISBN 1-85728-677-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Blair, Lynne and Blair, Gordon S. and Bowman, Howard and Chetwynd, Amanda G. (1995) Formal Specification and Verification of Multimedia Systems in Open Distributed Processing. Computer Standards and Interfaces, 17 (5-6). pp. 413-436. ISSN 0920-5489. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bodden, Eric (2003) JAnalyzer, A Visual Static Analyzer for Java. Technical report. University of Kent, Kent, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boel, R.K. and Bordbar, Behzad and Stremersch, G. (1998) Controlled Timed Petri Nets: Equivalence Relations, Model Reduction. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. IEEE Systems, Man, and Cybernetics,Conference, 1. IEEE, San Diego, California, USA pp. 674-679. ISBN 0-7803-4778-1. (doi:https://doi.org/10.1109/ICSMC.1998.725491) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (2003) Book review: Concepts in Programming Languages, by John Mitchell. Review of: Concepts in Programming Languages by Mitchell, John. Journal of Functional Programming, 13 (6). pp. 1087-1088. ISSN 0956-7968. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (1988) Een Syntax Assisted Editor. Other masters thesis, Universiteit Twente. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (1990) Factorisation of the Factorial -- an algorithm discovered by playing with transformations. Technical report. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (1992) Factorisation of the Factorial -- an example of inverting the flow of computation. Periodica Polytechnica: Electrical Engineering, 35 (2). pp. 77-99. ISSN 0324-6000. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (2008) From ABZ to cryptography (abstract). In: Börger, Egon and Butler, Michael and Bowen, Jonathan P. and Boca, Paul, eds. Lecture Notes in Computer Science. Abstract State Machines, B and Z, First International Conference, ABZ 2008. LNCS, 5238. Springer-Verlag Berlin ISBN 978-3-540-87602-1. (doi:https://doi.org/10.1007/978-3-540-87603-8<sub>4</sub>0) (Full text available)

Preview

Boiten, Eerke Albert (1992) Improving recursive functions by inverting the order of evaluation. Science of Computer Programming, 18 . pp. 139-179. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (2004) Input/Output Abstraction of State Based Systems. Technical report. University of Kent (Full text available)

Preview Preview

Boiten, Eerke Albert (2002) Integrating Specifications: Development Relations and Correspondences. In: Ehrig, Hartmut and Grosse-Rhode, Martin, eds. INT'02: Integration of Software Specification Techniques, ETAPS 2002 Satellite Workshop. INIST-CNRS p. 8. (Full text available)

Preview Preview

Boiten, Eerke Albert (1991) Intersections of Bags and Sets of Extended Substructures -- a Class of Problems. In: Möller, Bernhard, ed. Constructing Programs from Specifications : Proceedings of the IFIP TC2/WG 2.1 Working Conference. North-Holland, Amsterdam pp. 33-48. ISBN 0-444-89184-6. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (1991) Intersections of Sets and Bags of Extended Substructures, and Can Bag Comprehension be Used at All? Technical report. Dept. of Informatics, University of Nijmegen (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (1989) Inverting the Flow of Computation in Tree-like Recursive Functions. In: Apers, P.M.G. and Bosman, D. and van Leeuwen, J., eds. Computer Science in the Netherlands 1989. Stichting Mathematisch Centrum, Amsterdam pp. 33-56. ISBN 90-6196-382-6. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (2002) Loose Specification and Refinement in Z. In: 2nd Interenational Conference of B and Z Users, January 2002, Grenoble, France. (doi:https://doi.org/10.1007/3-540-45648-1_12) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Möller, Bernhard, eds. (2002) Mathematics of Program Construction: Sixth International Conference. Lecture Notes in Computer Science, 2386 . Springer, Berlin/Heidelbeg/Paris, 267 pp. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (1993) Parsing in ISBES. In: Bjorner, D. and Broy, M. and Pottosin, I.V., eds. Lecture Notes in Computer Science. Formal Methods in Programming and Their Applications. Lecture Notes in Computer Science, 735. Springer-Verlag Berlin, Berlin pp. 423-433. ISBN 3-540-57316-X. (Full text available)

Preview

Derrick, John and Boiten, Eerke Albert and Woodcock, Jim and von Wright, Joakim, eds. (2002) REFINE 2002: The BCS FACS Refinement Workshop. Electronic Notes in Theoretical Computer Science, 70 . Elsevier Science Publishers (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (1991) Solving a combinatorial problem by transformation of abstract data types. In: van Leeuwen, J., ed. Computing Science in the Netherlands 1991. Stichting Mathematisch Centrum, Amsterdam pp. 99-108. ISBN 90-6196-403-2. (Full text available)

Preview Preview

Boiten, Eerke Albert (2004) Travelling Salesman Heuristics: Exercises in Haskell. Technical report. University of Kent (Full text available)

Preview Preview

Boiten, Eerke Albert (2004) Turtle Graphics: Exercises in Haskell. Technical report. University of Kent (Full text available)

Preview Preview

Boiten, Eerke Albert (1992) Views of Formal Program Development. Doctor of Philosophy (PhD) thesis, University of Nijmegen, Faculty of Mathematics and Informatics. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert (1997) Z Unification Tools in Generic Formaliser. Technical report. University of Kent at Canterbury (Full text available)

Preview Preview

Boiten, Eerke Albert (1991) The many disguises of accumulation. Technical report. Dept. of Informatics, University of Nijmegen (Full text available)

Preview Preview

Boiten, Eerke Albert and Bowman, Howard and Derrick, John and Linington, Peter F. and Steen, Maarten (2000) Viewpoint Consistency in ODP. Computer Networks, 34 (3). pp. 503-537. ISSN 1389-1286. (Full text available)

Preview

Boiten, Eerke Albert and Bowman, Howard and Derrick, John and Steen, Maarten (1995) Cross Viewpoint Consistency in Open Distributed Processing (Intra language consistency). Technical report. UKC, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Boiten, Eerke Albert and Bowman, Howard and Derrick, John and Steen, Maarten (1996) Issues in multiparadigm viewpoint specification. In: Finkelstein, A. and Spanoudakis, G., eds. ISAW '96 Joint proceedings of the second international software architecture workshop (ISAW-2) and international workshop on multiple perspectives in software development (Viewpoints '96) on SIGSOFT '96 workshops. ACM pp. 162-166. ISBN 0-89791-867-3. (Full text available)

Preview Preview

Boiten, Eerke Albert and Bowman, Howard and Derrick, John and Steen, Maarten (1997) Viewpoint consistency in Z and LOTOS: A case study. In: Fitzgerald, John and Jones, Cliff B. and Lucas, Peter, eds. Lecture Notes in Computer Science. FME '97: Industrial Applications and Strengthened Foundations of Formal Methods, 4th International Symposium of Formal Methods Europe. Lecture Notes in Computer Science, 1313. Springer-Verlag Berlin pp. 644-664. ISBN 3-540-63533-5. (doi:https://doi.org/10.1007/3-540-63533-5_34) (Full text available)

Preview +1 more...

Boiten, Eerke Albert and Butler, Michael (2006) Guest Editorial: Editorial for the FAC Special Issue based on derivative papers from "Refine ’05". Formal Aspects of Computing, 18 (3). p. 263. ISSN 0934-5043. (doi:https://doi.org/10.1007/s00165-006-0009-0) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Derrick, John (2005) Formal Program Development with Approximations. In: Treharne, Helen and King, Steve and Henson, Martin C. and Schneider, Steve A., eds. Lecture Notes in Computer Science. ZB 2005: Formal Specification and Development in Z and B, 4th International Conference of B and Z Users. Lecture Notes in Computer Science, 3455. Springer-Verlag Berlin pp. 374-392. ISBN 3-540-25559-1. (doi:https://doi.org/10.1007/11415787_22) (Full text available)

Preview

Boiten, Eerke Albert and Derrick, John (1998) Grey Box Data Refinement. In: Grundy, J. and Schwenke, M. and Vickers, T., eds. International Refinement Workshop & Formal Methods Pacific '98. Discrete Mathematics and Theoretical Computer Science. Springer-Verlag, Canberra pp. 45-59. ISBN 981-4021-16-4. (Full text available)

Preview

Boiten, Eerke Albert and Derrick, John (1998) IO - refinement in Z. In: 3rd Northern Formal MethodsWorkshop,, 1998. (Full text available)

Preview

Boiten, Eerke Albert and Derrick, John (2002) Integration of Specifications through Development Relations. In: Ehrig, Hartmut and Kramer, Berndt and Ertas, Atila, eds. Proceedings of IDPT: the Sixth Biennial World Conference on Integrated Design and Process Technology. p. 8. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Derrick, John (2000) Liberating data refinement. In: Backhouse, Roland C. and Oliveira, Jose Nuno, eds. Mathematics of Program Construction. Lecture Notes in Computer Science, 1837. Springer pp. 144-166. ISBN 3-540-67727-5. (doi:https://doi.org/10.1007/10722010_11) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Derrick, John (2009) Modelling divergence in Relational Concurrent Refinement. In: Leuschel, Michael and Wehrheim, Heike, eds. IFM 2009: Integrated Formal Methods. LNCS, 5423. Springer Verlag, Berlin Germany pp. 183-199. ISBN 978-3-642-00254-0. (doi:https://doi.org/10.1007/978-3-642-00255-7<sub>1</sub>3) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Derrick, John (2005) Proceedings of the REFINE 2005 Workshop. Electronic Notes in Theoretical Computer Science, 137 (2). pp. 1-242. ISSN 1571-0661. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Derrick, John (2002) Unifying concurrent and relational refinement. Electronic Notes in Theoretical Computer Science, 70 (3). pp. 94-131. ISSN 1571-0661. (doi:https://doi.org/10.1016/S1571-0061(05)80488-8) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Derrick, John (2003) A relational framework for the integration of specifications. Journal of Integrated Design and Process Science, 7 (3). pp. 39-48. ISSN 1092-0617. (Full text available)

Preview

Boiten, Eerke Albert and Derrick, John and Bowman, Howard and Steen, Maarten (1996) Consistency and refinement for partial specification in Z. In: UNSPECIFIED. (Full text available)

Preview Preview

Boiten, Eerke Albert and Derrick, John and Bowman, Howard and Steen, Maarten (1997) Coupling schemas: data refinement and view(point)composition. In: Duke, David J. and Evans, A.S., eds. BCS-FACS Northern formal methods Workshop. Workshops in Computing, 2. Springer-Verlag ISBN 3-540-76215-9. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Derrick, John and Bowman, Howard and Steen, Maarten (1995) Unification and multiple views of data in Z. In: van Vliet, J.C., ed. Computer Science in the Netherlands 1995. Stichting Mathematisch Centrum, Amsterdam pp. 73-85. ISBN 90-6196-460-1. (Full text available)

Preview Preview

Boiten, Eerke Albert and Derrick, John and Schellhorn, Gerhard (2008) Preface: REFINE 2008 Proceedings. Electronic Notes in Theoretical Computer Science, 214 . ISSN 1571-0661. (doi:https://doi.org/10.1016/j.entcs.2008.06.001) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Derrick, John and Schellhorn, Gerhard (2008) Relational Concurrent Refinement II: Internal Operations and Outputs. Formal Aspects of Computing, 21 (1-2). pp. 65-102. ISSN 0934-5043. (doi:https://doi.org/10.1007/s00165-007-0066-z) (Full text available)

Preview

Boiten, Eerke Albert and Derrick, John and Smith, Graeme (2005) Editorial: Special issue on Integrated Formal Methods. Formal Aspects of Computing, 17 (4). ISSN 0934-5043. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Derrick, John and Smith, Graeme (2008) Preface: Proceedings of the BCS-FACS Refinement Workshop (REFINE 2007). Electronic Notes in Theoretical Computer Science, 201 . ISSN 1571-0661. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Derrick, John and Smith, Graeme (2007) Refine 2007 Participants' Proceedings. Technical report. University of Kent, Canterbury, Canterbury, Kent (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Geerling, A.M. and Partsch, H.A. (1993) Transformational derivation of (parallel) programs using skeletons. In: Computer Science in the Netherlands 1993, 1993, Utrecht. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Grundy, Dan (2008) Reduction and refinement. Electronic Notes in Theoretical Computer Science, 201C . pp. 31-44. ISSN 1571-0661. (doi:https://doi.org/10.1016/j.entcs.2008.02.014) (Full text available)

Preview

Boiten, Eerke Albert and Hoogendijk, P.F. (1996) Nested collections and polytypism. Technical report. Department of Computing Science, Eindhoven University (Full text available)

Preview Preview

Boiten, Eerke Albert and Partsch, H.A. and Tuijnman, D. and Völker, N. (1992) How to produce correct software -- an introduction to formal specification and program development by transformations. Computer Journal, 35 (6). pp. 547-554. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and Schneider, Steve A. (2014) Editorial: Special Issue on Cryptography and Formal Methods. Formal Aspects of Computing, 26 (1). pp. 1-2. ISSN 0934-5043 (Print) 1433-299X (Online). (doi:https://doi.org/10.1007/s00165-013-0290-7) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert and van den Brand, M.G.J. and van Diepen, N.W.P. and Koster, C.H.A. and Partsch, H.A. and Völker, N. (1992) USTOPIA Requirements -- Thoughts on a User-friendly System for Transformation Of Programs In Abstracto. Periodica Polytechnica: Electrical Engineering, 35 (2). pp. 101-123. ISSN 0324-6000. (Full text available)

Preview

Bolognesi, Tommaso and Derrick, John (1998) Constraint-oriented style for object-oriented formal specification. IEE Proceedings: Software, 145 (2-3). pp. 61-69. ISSN 1462-5970. (doi:https://doi.org/10.1049/ip-sen:19986907) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bordbar, Behzad (1998) Weakly almost period functions on N with a negative base. Journal of the London Mathematical Society, (57). pp. 706-720. ISSN 0024-6107. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bordbar, Behzad and Derrick, John and Waters, A. Gill (2003) A UML approach to the design of open distributed systems. In: George, Chris and Miao, Huaikou, eds. Formal Methods and Software Engineering. Lecture Notes in Computer Science, 2495. Springer pp. 561-572. ISBN 978-3-540-00029-7. (doi:https://doi.org/10.1007/3-540-36103-0_56) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bordbar, Behzad and Derrick, John and Waters, A. Gill (2002) Using UML to specify QoS constraints in ODP. Computer Networks, 40 (2). pp. 279-304. ISSN 1389-1286. (doi:https://doi.org/10.1016/S1389-1286(02)00255-4) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bordbar, Behzad and Giacomini, Luisa and Holding, David J. (2000) Design of Distributed Manufacturing Systems using UML and Petri Nets. In: Proceedings of 6th International Federation of Automatic Control (IFAC). Workshop on Algorithms and Architectures for Real-Time Control. Elsevier, Palma de Mallorca, Spain pp. 105-110. ISBN 0-08-043685-4. (Full text available)

Preview

Bordbar, Behzad and Giacomini, Luisa and Holding, David J. (2000) Hybrid Control Systems: a Design Case Study. In: IEEE CCA/CACSD. IEEE, Alaska, USA pp. 947-952. ISBN 0-7803-6562-3. (doi:https://doi.org/10.1109/CCA.2000.897592) (Full text available)

Preview

Bordbar, Behzad and Giacomini, Luisa and Holding, David J. (2000) UML and Petri Nets for Design and Analysis of Distributed Systems. In: IEEE CCA/CACSD. IEEE, Alaska, USA pp. 610-615. ISBN 0-7803-6562-3. (doi:https://doi.org/10.1109/CCA.2000.897497) (Full text available)

Preview

Bordbar, Behzad and Giacomini, Luisa and Holding, David J. (2000) A UML-based Approach to the Modelling and Supervisory Control of Manufacturing Machinery. In: IEE Control Seminars on Model Validation for Plant Control and Condition Monitoring. IEE Digest, London pp. 31-33. (doi:https://doi.org/10.1049/ic:20000237) (Full text available)

Preview

Bordbar, Behzad and Giacomini, Luisa and Holding, David J. (2000) Verification of a Hybrid Model of a Manufacturing System using Rectangular Petri Nets. In: Proceedings of the 6th International Workshop on Discrete Event Systems. , Ghent, Belgium (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bordbar, Behzad and Pym, J.S. (2000) The Set of Idempotents in the Weakly Almost Periodic Compactification of the Integers is not Closed. Transactions of the American Mathematical Society, 352 (2). pp. 823-842. ISSN 0002-9947. (Full text available)

Preview

Bordbar, Behzad and Pym, J.S. (1998) The weakly almost periodic compactification of a direct sum of finite groups. Mathematical Proceedings of the Cambridge Philosophical Society, 124 (3). pp. 421-449. ISSN 0305-0041. (doi:https://doi.org/10.1017/S0305004198002540) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bovey, John D. (1995) Building a Thesaurus for a Collection of Cartoon Drawings. Journal of Information Science, 21 (2). pp. 115-122. ISSN 1352-7460. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard (2001) Formal Methods Elsewhere. Electronic Notes in Theoretical Computer Science, 43 . pp. 162-163. ISSN 1571-0661. (doi:https://doi.org/10.1016/S1571-0661(05)81053-9) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard (1998) An Interpretation of Cognitive Theory in Concurrency Theory. Technical report. University of Kent (Full text available)

Preview

Bowman, Howard (1998) A LOTOS Based Tutorial on Formal Methods for Object Oriented Distributed Systems. New Generation Computing, 16 (4). pp. 343-372. ISSN 0288-3635. (doi:https://doi.org/10.1007/BF03037429) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard (1999) Modelling Concurrent Cognitive Architectures Using Process Calculi. In: Bagnara, Sebastiano, ed. European Conference on Cognitive Science 1999. Istituto di Psicologia, CNR pp. 161-166. ISBN 88-85059-10-4. (Full text available)

Preview Preview

Bowman, Howard (1999) Modelling Timeouts without Timelocks. In: ARTS'99, 5th International AMAST Workshop on Real-time and Probabilistic Systems. (doi:https://doi.org/10.1007/3-540-48778-6_20) (Full text available)

Preview Preview

Bowman, Howard (1999) On Time and Action Lock Free Description of Timed Systems. Technical report. (Full text available)

Preview Preview

Bowman, Howard (2001) Time and Action Lock Freedom Properties of Timed Automata. In: Kim, Myungchul and Chin, Byoungmoon and Kang, Sungwon and Lee, Danhyung, eds. Formal Techniques for Networked and Distributed Systems. Kluwer Academic Publishers pp. 119-134. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Blair, Gordon S. and Blair, Lynne and Chetwynd, Amanda G. (1995) Formal description of distributed multimedia systems: An assessment of potential techniques. Computer Communications, 18 (12). pp. 964-977. ISSN 0140-3664. (doi:https://doi.org/10.1016/0140-3664(96)81596-9) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Blair, Gordon S. and Blair, Lynne and Chetwynd, Amanda G. (1993) Time Versus Abstraction In Formal Description. In: Tenney, Richard L. and Amer, Paul D. and Uyar, M.Umit, eds. Formal Description Techniques, Vi. Elsevier Science Publ B V pp. 467-482. ISBN 0-444-81773-5. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Blair, Lynne and Blair, Gordon S. and Chetwynd, Amanda G. (1994) A Formal Description Technique Supporting Expression of Quality of Service and Media Synchronisation. In: Hutchison, D. and Danthine, A. and Leopold, H. and Coulson, G., eds. Multimedia Transport and Teleservices, International COST 237 Workshop. Lecture Notes in Computer Science, 882. Springer-Verlag pp. 145-167. ISBN 3-540-58759-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Boiten, Eerke Albert and Derrick, John and Steen, Maarten (1995) Strategies for Consistency Checking. Technical report. University of Kent, Computing Laboratory, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Bowman, Howard and Boiten, Eerke Albert and Derrick, John and Steen, Maarten (1996) Strategies for Consistency Checking, the Choice of Unification. Technical report. UKC, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Bowman, Howard and Boiten, Eerke Albert and Derrick, John and Steen, Maarten (1999) Strategies for consistency checking based on unification. Science of Computer Programming, 33 (3). pp. 261-298. ISSN 0167-6423. (doi:https://doi.org/10.1016/S0167-6423(98)00017-3) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Boiten, Eerke Albert and Derrick, John and Steen, Maarten (1996) Viewpoint consistency in ODP, a general interpretation. In: Najm, Elie and Stefani, J.-B., eds. First IFIP International Workshop on Formal Methods for Open Object-Based Distributed Systems. First IFIP International Workshop on Formal Methods for Open Object-Based Distributed Systems. Chapman & Hall pp. 189-204. ISBN 0-412-79770-4. (Full text available)

Preview Preview

Bowman, Howard and Briscoe-Smith, C. and Derrick, John and Strulo, B. (1997) On Behavioural Subtyping in LOTOS. In: Bowman, Howard and Derrick, John, eds. FMOODS'97, Second IFIP International Conference on Formal Methods for Open Object-based Distributed Systems. Chapman and Hall pp. 335-351. ISBN 0-412-82040-4. (Full text available)

Preview +1 more...

Bowman, Howard and Bryans, Jeremy W. and Derrick, John (2001) Analysis of a Multimedia Stream using Stochastic Process Algebra. Computer Journal, 44 (4). pp. 230-245. ISSN 0010-4620. (doi:https://doi.org/10.1093/comjnl/44.4.230) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Bryans, Jeremy W. and Derrick, John (1998) Analysis of a Multimedia Stream using Stochastic Process Algebra. In: Priami, C., ed. Sixth International Workshop on Process Algebras and Performance Modelling. , Nice pp. 51-69. (Full text available)

Preview

Bowman, Howard and Bryans, Jeremy W. and Derrick, John (2000) Towards Stochastic Model Checking with Generalised Distributions. In: UKPEW 2000, 16th United Kingdom Performance Engineering Workshop. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Cameron, Helen and King, Peter and Thompson, Simon (2003) Mexitl: Multimedia in Executable Interval Temporal Logic. Formal Methods in System Design, 22 (1). pp. 5-38. ISSN 0925-9856. (doi:https://doi.org/10.1023/A:1021736013555) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Cameron, Helen and King, Peter and Thompson, Simon (1997) Mexitl: Multimedia in Executable Interval Temporal Logic. Technical report. University of Kent (Full text available)

Preview Preview

Bowman, Howard and Cameron, Helen and King, Peter and Thompson, Simon (1997) Specification and Prototyping of Structured Multimedia Documents using Interval Temporal Logic. In: International Conference on Temporal Logic. Applied Logic Series. Kluwer (Full text available)

Preview +1 more...

Bowman, Howard and Derrick, John (1997) Extending LOTOS with Time: True Concurrency Perspective. In: Bertran, Miquel and Rus, Teodor, eds. ARTS'97, AMAST Workshop on Real-Time Systems, Concurrent and Distributed Software. Lecture Notes in Computer Science, 1231. Springer-Verlag pp. 382-399. ISBN 3-540-63010-4. (doi:https://doi.org/10.1007/3-540-63010-4) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Derrick, John (1999) A Junction between State Based and Behavioural Specification. In: Ciancarini, Paolo and Fantechi, Alessandro and Gorrieri, Robert, eds. Formal Methods for Open Object-based Distributed Systems. Kluwer pp. 213-239. ISBN 0-7923-8429-6. (doi:https://doi.org/10.1007/978-0-387-35562-7_18) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Derrick, John (1995) Modelling Distributed Systems using Z. In: UNSPECIFIED. (Full text available)

Preview Preview

Bowman, Howard and Derrick, John (1994) Towards a Formal Model of Consistency in ODP. Technical report. University of Kent, Computing Laboratory, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Bowman, Howard and Derrick, John (1995) A True Concurrency Semantics for Quality of Service Specification and Validation. In: Sarikaya, Behcet and Saito, Senro, eds. MMNet'95, International Conference on Multimedia and Networking. IEEE Computer Society Press pp. 173-182. ISBN 0-8186-7090-8. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Derrick, John and Brinksma, E. (2000) Guest Editors Introduction: Formal Methods for Object Oriented Distributed Systems. IEEE Transactions on Software Engineering, 26 (7). pp. 577-578. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Derrick, John and Brinksma, E. (2000) Selected papers from the Second IFIP Int'l Conference on Formal Methods for Open Object Based Distributed Systems, 1997. IEEE Transactions on Software Engineering, 26 (7). pp. 577-578. ISSN 0098-5589. (doi:https://doi.org/10.1109/TSE.2000.859528) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Derrick, John and Jones, Richard E. (1994) Modelling Garbage Collection Algorithms --- Extend abstract. In: Proceedings of Principles of Distributed Computing'94. (Full text available)

Preview Preview

Bowman, Howard and Derrick, John and Linington, Peter F. and Steen, Maarten (1995) FDTs for ODP. Computer Standards and Interfaces, 17 (5-6). pp. 457-479. ISSN 0920-5489. (doi:https://doi.org/10.1016/0920-5489(95)00021-L) (Full text available)

Preview Preview

Bowman, Howard and Derrick, John and Steen, Maarten (1995) Some Results on Cross Viewpoint Consistency Checking. In: UNSPECIFIED. (Full text available)

Preview Preview

Bowman, Howard and Faconti, Giorgio (1999) Analysing Cognitive Behaviour using LOTOS and Mexitl. Formal Aspects of Computing, 11 (2). pp. 132-159. (doi:https://doi.org/10.1007/s001650050045) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Faconti, Giorgio and Katoen, J-P. and Latella, D. and Massink, M. (1998) Automatic Verification of a Lip Synchronisation Protocol using UPPAAL. Formal Aspects of Computing, 10 (5-6). pp. 550-575. ISSN 1433-299X. (doi:https://doi.org/10.1007/s001650050032) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Faconti, Giorgio and Katoen, J-P. and Latella, D. and Massink, M. (1998) Automatic Verification of a Lip-Synchronisation Algorithm Using UPPAAL - Extended Version. In: Groote, J.F. and Luttik, B. and van Warnel, J., eds. FMICS'98, Third Internatinoal Workshop on Formal Methods for Industrial Crtical Systems. CWI pp. 97-124. ISBN 90-6196-480-6. (Full text available)

Preview

Bowman, Howard and Faconti, Giorgio and Massink, M. (1998) Specification and Verification of Media Constraints using UPPAAL. In: 5th Eurographics Workshop on the Design, Specification and Verification of Interactive Systems, DSV-IS 98. Eurographics Series. Springer-Verlag pp. 261-277. ISBN 3-211-83212-2. (Full text available)

Preview Preview

Bowman, Howard and Faconti, Giorgio and Massink, M. (1999) Towards Integrated Cognitive and Interface Analysis. Technical report. (Full text available)

Preview Preview

Bowman, Howard and Faconti, Giorgio and Massink, M. (2000) Towards Integrated Cognitive and Interface Analysis. In: Bowman, Howard, ed. Proceedings of Formal Methods Elsewhere 2000, Pisa, Italy. Elsevier Science pp. 97-112. (doi:https://doi.org/10.1016/S1571-0661(04)80896-X) (Full text available)

Preview

Bowman, Howard and Gomez, Rodolfo (2006) Concurrency Theory, Calculi and Automata for Modelling Untimed and Timed Concurrent Systems. Springer, London, 459 pp. ISBN 1-85233-895-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Gomez, Rodolfo (2006) How to stop time stopping. Formal Aspects of Computing, 18 (4). pp. 459-493. ISSN 0934-5043. (Full text available)

Preview

Bowman, Howard and Gomez, Rodolfo and Su, Li (2004) How to stop time stopping (preliminary version). Technical report. University of Kent, Canterbury, Kent, CT2 7NF, UK (Full text available)

Preview

Bowman, Howard and Katoen, J-P. (1998) A True Concurrency Semantics for ET-LOTOS. In: CSD'98 International Conference on Application of Concurrency to System Design. IEEE Computer Society. IEEE Computer Society Press pp. 228-238. ISBN 0-8186-8350-3. (doi:https://doi.org/10.1109/CSD.1998.657554) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Steen, Maarten and Boiten, Eerke Albert and Derrick, John (1999) A Formal Framework for Viewpoint Consistency (full version). Technical report. , Canterbury, Kent, CT2 7NZ (Full text available)

Preview Preview

Bowman, Howard and Steen, Maarten and Boiten, Eerke Albert and Derrick, John (2002) A Formal Framework for Viewpoint Consistency. Formal Methods in System Design, 21 (2). pp. 111-166. ISSN 0925-9856. (doi:https://doi.org/10.1023/A:1016000201864) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Thompson, Simon (2000) A Complete Axiomatization of Interval Temporal Logic with Projection. Technical report. University of Kent (Full text available)

Preview

Bowman, Howard and Thompson, Simon (2003) A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection. Journal of Logic and Computation, 13 (2). pp. 195-239. ISSN 0955-792X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bowman, Howard and Thompson, Simon (1997) A Tableau Method for Interval Temporal Logic. Technical report. University of Kent at Canterbury (Full text available)

Preview Preview

Bowman, Howard and Thompson, Simon (1998) A Tableaux Method for Interval Temporal Logic with Projection. In: TABLEAUX'98, International Conference on Analytic Tableaux and Related Methods. Lecture Notes In Computer Science, 1397 (1397). Springer-Verlag pp. 108-123. ISBN 3-540-64406-7. (Full text available)

Preview

Brassel, Bernd and Chitil, Olaf and Hanus, Michael and Huch, Frank (2004) Observing Functional Logic Computations. In: Jayaraman, B., ed. Proc. of the Sixth International Symposium on Practical Aspects of Declarative Languages (PADL'04). LNCS 3057, 3057. Springer pp. 193-208. ISBN 3-540-22253-7. (Full text available)

Preview

Briscoe-Smith, C. (2000) Behavioural Subtyping in Process Algebra. Doctor of Philosophy (PhD) thesis, University of Kent at Canterbury. (Full text available)

Brooks, Stephen P. and Morgan, Byron J. T. (1994) Automatic Starting Point Selection For Function Optimization. Statistics and Computing, 4 (3). pp. 173-177. ISSN 0960-3174. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Brown, Christopher and Thompson, Simon (2007) Refactorings that Split and Merge Programs. In: Draft Proceedings of the 19th International Symposium on Implementation and Application of Functional Languages, IFL 2007. , Freiburg, Germany. (Full text available)

Preview

Bryans, Jeremy W. and Blair, Lynne and Bowman, Howard and Derrick, John (2000) Specification and Analysis of Automata-based Designs. In: Grieskamp, Wolfgang and Stanten, Thomas and Stoddart, Bill, eds. Integrated Formal Methods (IFM 2000). Lecture Notes in Comuter Science, 1945. Springer pp. 176-193. ISBN 3-540-41196-8. (Full text available)

Preview Preview

Bryans, Jeremy W. and Bowman, Howard and Derrick, John (2000) A Model Checking Algorithm for Stochastic Systems. Technical report. University of Kent, Canterbury, Kent (Full text available)

Preview Preview

Bryans, Jeremy W. and Bowman, Howard and Derrick, John (2003) Model Checking Stochastic Automata. ACM Transactions on Computational Logic, 4 (4). pp. 452-492. ISSN 1529-3785. (doi:https://doi.org/10.1145/937555.937558) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bryans, Jeremy W. and Davies, Jim and Schneider, Steve A. (1994) Real-time CSP and ET-LOTOS. Technical report. Reading University, Presented at the COST 247 WG 6.1 working group meeting in Brighton (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bryans, Jeremy W. and Davies, Jim and Schneider, Steve A. (1995) Towards a Denotational Semantics for Timed LOTOS. In: Lecture Notes in Computer Science. Springer-Verlag Berlin (doi:https://doi.org/10.1007/3-540-60218-6_20) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bryans, Jeremy W. and Derrick, John (1999) Stochastic specification and verification. In: 3rd Irish Workshop in Formal Methods. Electronic Workshops in Computing. Springer (Full text available)

Preview Preview

Bujorianu, Manuela L. and Bujorianu, Marius C. (2001) Constructive Foundations of Stochastic Analysis in Linear Logic. In: BCTCS 17 British Colloquium for Theoretical Computer Science. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bujorianu, Marius C. (2004) Integration of Specification Languages Using Viewpoints. In: Boiten, Eerke Albert and Derrick, John and Smith, Graeme, eds. Integrated Formal Methods, 4th International Conference, IFM 2004. Springer pp. 421-440. ISBN 3-540-21377-5. (doi:https://doi.org/10.1007/b96106) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bujorianu, Marius C. and Bujorianu, Manuela L. (2001) An Abstract Domain for Probabilistic Hybrid Systems. European Association for Theoretical Computer Science, Bulletin of the European Association for Theoretical Computer Science, Issue 74. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bujorianu, Marius C. and Bujorianu, Manuela L. (2002) Constructive Potential Theory: A Linear Logic Approach. In: Berarducci, A. and Cutland, N.J., eds. NS 2002 Non-standard Methods and Applications in Mathematics. University of Pisa, Pisa, Italy (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bujorianu, Marius C. and Bujorianu, Manuela L. (2002) Constructive Potential Theory: Foundations and Applications. Technical report. University of Kent, Canterbury, Kent, UK (Full text available)

Preview Preview

Bujorianu, Marius C. and Bujorianu, Manuela L. (2002) Linear Logic: from Stochastic Analysis to Software Testing. In: British colloquium on theoretical computer science 18, 7th-10th April 2002, HP laboratories Bristol. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bujorianu, Marius C. and Bujorianu, Manuela L. (2001) Logics, Viewpoints and Tests: Towards a Trinity. Other. Computing Laboratory, UKC (Unpublished) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bujorianu, Marius C. and Bujorianu, Manuela L. (2001) On the Hilbert Machines Quantitative Computational Model. In: QAPL'01 Workshop on Quantitative Aspects of Programming Laguages. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bujorianu, Marius C. and Bujorianu, Manuela L. (2001) Order Theoretic Topologies and Hybrid Systems. In: 5th Galway Colloquium on General Topology, 27-29 June 2001, University of Hull. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bujorianu, Marius C. and Maharaj, Savitri and Bujorianu, Manuela L. (2002) Towards a formalization of viewpoints testing. In: Hierons, R. and Jéron, T., eds. Formal Approaches To Testing of Software 2002 (FATES'02). Research Report. INRIA, 35042 Rennes, France (Full text available)

Preview

C

Cameron, Helen and King, Peter and Bowman, Howard and Thompson, Simon (1998) Synchronization in Multimedia Documents. In: Andre, Jacques, ed. Electronic Publishing 98. Lecture Notes In Computer Science, 1357. Springer pp. 355-369. ISBN 3-540-64298-6. (Full text available)

Preview Preview

Cameron, Helen and King, Peter and Thompson, Simon (2003) Modelling Reactive Multimedia: Events and Behaviours. Multimedia Tools and Applications, 19 (1). pp. 53-77. ISSN 1380-7501. (doi:https://doi.org/10.1023/A:1021168913400) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Florissi, C. and Soares, Patricia G. and Melo, T.C.S (1987) Implementation of a Relational Language for Microcomputers. In: 7th Conference of the Brazilian Computer Society. pp. 441-451. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Meira, Silvio Lemos (1989) Denotational Models of Software Systems. In: 9th Conference of the Brazilian Computer Society. pp. 187-204. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Naumann, David A. (2002) Forward Simulation for Data Refinement of Classes. In: Eriksson, Lars-Henrik and Lindsay, Peter A., eds. FME 2002: Formal Methods - Getting IT Right. Lecture Notes in Computer Science, 1. Springer-Verlag, Berlin pp. 471-490. ISBN 978-3-540-43928-8. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Naumann, David A. (2002) On a Specification-oriented Model for Object-orientation. In: Proceedings of the 6th Brazilian Symposium on Programming Languages. pp. 114-127. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Naumann, David A. (2000) Simulation and Class Refinement for Java. In: Drossopoulou, Sophia and Eisenback, S., eds. ECOOP 2000 Workshop on Formal Techniques for Java Programs. Technical Report 269. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Naumann, David A. (2000) A Weakest Precondition Semantics for Refinement of Object-oriented Programs. IEEE Transactions on Software Engineering, 26 (8). pp. 713-728. ISSN 0098-5589. (doi:https://doi.org/10.1007/3-540-48118-4_26) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Naumann, David A. (1999) A Weakest Precondition Semantics for an Object-oriented Language of Refinement. In: FM'99: World Congress on Formal Methods in the Development of Computing Systems, Sep 20-24, 1999, Toulouse, France. (doi:https://doi.org/10.1007/3-540-48118-4_26) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Sampaio, Augusto C.A. and Woodcock, Jim (1999) An Inconsistency in Procedures, Parameters and Substitution in the Refinement Calculus. Science of Computer Programming, 33 (1). pp. 87-96. ISSN 0167-6423. (doi:https://doi.org/10.1016/S0167-6423(97)00015-4) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Sampaio, Augusto C.A. and Woodcock, Jim (1998) Procedures and Recursion in the Refinement Calculus. Journal of the Brazilian Computer Society, 5 (1). pp. 1-15. ISSN 0104-6500. (doi:https://doi.org/10.1590/S0104-65001998000200002) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Sampaio, Augusto C.A. and Woodcock, Jim (2002) Refinement of Actions in Circus. In: Proceedings of REFINE'2002. Electronic Notes in Theoretical Computer Science, 70. Elsevier B.V pp. 132-162. (doi:https://doi.org/10.1016/S1571-0661(05)80489-X) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Woodcock, Jim (2002) A Weakest Precondition Semantics for Circus. In: Proceedings of the Communicating Processing Architectures 2002. IOS Press ISBN 4-274-90539-X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Woodcock, Jim (1998) A Weakest Precondition Semantics for Z. Computer Journal, 41 (1). pp. 1-15. ISSN 0010-4620. (doi:https://doi.org/10.1093/comjnl/41.1.1) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cavalcanti, Ana L. C. and Woodcock, Jim (1998) ZRC - A Refinement Calculus for Z. Formal Aspects of Computing, 10 (3). pp. 267-289. (doi:https://doi.org/10.1007/s001650050016) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cesarini, Francesco and Thompson, Simon (2009) Erlang Programming. O'Reilly, 494 pp. ISBN 0-596-51818-8. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Charles, Nathan and Bowman, Howard and Thompson, Simon (1997) From ACT-ONE to Miranda, a Translation Experiment. Computer Standards and Interfaces, 19 (1). pp. 31-49. ISSN 0920-5489. (doi:https://doi.org/10.1016/S0920-5489(97)00005-6) (Full text available)

Preview Preview

Cheng, Russell C.H. (1994) Selecting Input Models. In: Tew, J.D. and Manivannan, M.S. and Sadowski, D.A. and Seila, A.F., eds. 1994 Winter Simulation Conference Proceedings. I E E E pp. 184-191. ISBN 0-7803-2109-X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Chitil, Olaf (1997) Adding an Optimisation Pass to the Glasgow Haskell Compiler. Other. RWTH Aachen, Germany (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Chitil, Olaf (1997) Common Subexpression Elimination in a Lazy Functional Language. In: Clack, Chris and Davie, Tony and Hammond, Kevin, eds. Draft Proceedings of the 9th International Workshop on Implementation of Functional Languages. pp. 501-516. (Full text available)

Preview

Chitil, Olaf (2001) Compositional Explanation of Types and Algorithmic Debugging of Type Errors. In: Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP'01). ACM, Firenze, Italy pp. 193-204. ISBN 1-58113-415-0. (doi:https://doi.org/10.1145/507635.507659) (Full text available)

Preview

Chitil, Olaf (2000) Deforestation of Functional Programs through Type Inference. In: Goerigk, Wolfgang, ed. 17 Workshops der GI-Fachgruppe 2.1.4. Programmiersprachen und Rechenkonzepte mit Schwerpunkt Softwarecomponenten. Bericht Nr. 2007 des Instituts für Informatik und Praktische Mathematik der Christian-Albrechts-Universität zu Kiel pp. 121-130. (Full text available)

Preview

Chitil, Olaf (1999) Denotational Semantics for Teaching Lazy Functional Programming. In: Proceedings of the Workshop on Functional and Declarative Programming in Education. Rice Technical Report 99-346. (Full text available)

Preview

Chitil, Olaf (1995) Denotationelle und operationelle Semantiken für konstruktorbasierte funktionale Programmiersprachen erster Ordnung. Other masters thesis, RWTH Aachen. (Full text available)

Preview

Chitil, Olaf (2009) Functional Programming. In: Wah, Benjamin W., ed. Encyclopedia of Computer Science and Engineering. John Wiley & Sons, Hoboken, NJ, pp. 1334-1344. ISBN 978-0-471-38393-2. (Full text available)

Preview

Chitil, Olaf (2005) Hat-Explore: Source-Based Trace Exploration. In: Runciman, Colin, ed. Hat Day 2005: work in progress on the Hat tracing system for Haskell. Tech. Report YCS-2005-395. University of York, UK (Full text available)

Preview

Chitil, Olaf (2006) Pretty Printing with Delimited Continuations. Technical report. University of Kent, Kent, UK (Full text available)

Preview

Chitil, Olaf (2005) Pretty Printing with Partial Continuations. In: Butterfield, Andrew, ed. Draft Proceedings of the 17th International Workshop on Implementation and Application of Functional Languages, IFL 05. (Full text available)

Preview

Chitil, Olaf (2005) Pretty printing with lazy dequeues. Transactions on Programming Languages and Systems, 27 (1). pp. 163-184. ISSN 0164-0925. (doi:https://doi.org/10.1145/1053468.1053473) (Full text available)

Preview

Chitil, Olaf (2006) Promoting Non-Strict Programming. In: Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006. Eotvos Lorand University, Budapest, Hungary pp. 512-516. ISBN 963-463-876-7. (Full text available)

Preview

Chitil, Olaf (2001) A Semantics for Tracing. In: Arts, Thomas and Mohnen, Markus, eds. Draft Proceedings of the 13th International Workshop on Implementation of Functional Languages, IFL 2001. , Älvsjö, Sweden pp. 249-254. (Full text available)

Preview

Chitil, Olaf (1996) The Sigma-Semantics: A Comprehensive Semantics for Functional Programs. Technical report. RWTH Aachen, Aachen, Germany AIB-07-1996. (doi:AIB-07-1996) (Full text available)

Preview

Chitil, Olaf (1997) The Sigma-Semantics: A Comprehensive Semantics for Functional Programs. Fundamenta Informaticae, 31 (3,4). pp. 253-294. ISSN 1875-8681. E-ISSN 0169-2968. (doi:https://doi.org/10.3233/FI-1997-313404) (Full text available)

Preview

Chitil, Olaf (2004) Source-Based Trace Exploration. In: Draft Proceedings of the 16th International Workshop on Implementation of Functional Languages, IFL 2004. Technical Report 0408, University of Kiel pp. 239-244. (Full text available)

Preview

Chitil, Olaf (2005) Source-Based Trace Exploration. In: Grelck, Clemens and Huch, Frank and Michaelson, Greg and Trinder, Phil, eds. Implementation and Application of Functional Languages, 16th International Workshop, IFL 2004. LNCS 3474. Springer pp. 126-141. ISBN 978-3-540-26094-3. E-ISBN 978-3-540-32038-8. (doi:https://doi.org/10.1007/11431664_8) (Full text available)

Preview

Chitil, Olaf (1999) Type Inference Builds a Short Cut to Deforestation. In: ACM SIGPLAN Notices. ACM Press, Broadway, New York, USA pp. 249-260. (Full text available)

Preview

Chitil, Olaf (2000) Type-Inference Based Deforestation of Functional Programs. Doctor of Philosophy (PhD) thesis, RWTH Aachen. (Full text available)

Preview

Chitil, Olaf (2000) Type-Inference Based Short Cut Deforestation (Nearly) without Inlining. In: Clack, Chris and Koopman, Pieter, eds. Implementation of Functional Languages, 11th International Workshop, IFL'99 Lochem, The Netherlands, September 7-10, 1999 Selected Papers. LNCS 1868. Springer pp. 19-35. ISBN 978-3-540-67864-9. E-ISBN 978-3-540-44658-3. (doi:https://doi.org/10.1007/10722298) (Full text available)

Preview

Chitil, Olaf (1999) Type-Inference Based Short Cut Deforestation (nearly) without Inlining. In: Clack, Chris and Koopman, P., eds. Draft Proceedings of the 11th International Workshop on Implementation of Functional Languages. pp. 17-32. (Full text available)

Preview

Chitil, Olaf and Davie, Thomas (2008) Comprehending Finite Maps for Algorithmic Debugging of Higher-Order Functional Programs. In: PPDP '08: Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming. ACM pp. 205-216. ISBN 978-1-60558-117-0. (doi:https://doi.org/10.1145/1389449.1389475) (Full text available)

Preview

Chitil, Olaf and Huch, Frank (2007) Monadic, prompt lazy assertions in Haskell. In: Shao, Zhong, ed. Programming Languages and Systems, 5th Asian Symposium, APLAS 2007. LNCS 4807, 4807. Springer pp. 38-53. ISBN 3-540-76636-7. (doi:https://doi.org/10.1007/978-3-540-76637-7_4) (Full text available)

Preview

Chitil, Olaf and Huch, Frank (2006) A Pattern Logic for Prompt Lazy Assertions in Haskell. In: Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006. Eotvos Lorand University, Budapest, Hungary ISBN 963-463-876-7. (Full text available)

Preview

Chitil, Olaf and Huch, Frank (2007) A Pattern Logic for Prompt Lazy Assertions. In: Horváth, Zoltán and Zsok, Viktoria and Butterfield, Andrew, eds. Implementation and Application of Functional Languages, 18th International Workshop, IFL 2006. Lecture Notes in Computer Science, 4449. Springer, Germany pp. 126-144. ISBN 97835407412909. (doi:https://doi.org/10.1007/978-3-540-74130-5) (Full text available)

Preview

Chitil, Olaf and Luo, Yong (2006) Proving the Correctness of Algorithmic Debugging for Functional Programs. In: Pre-Proceedings of the Seventh Symposium on Trends in Functional Programming, TFP 2006. (Full text available)

Preview

Chitil, Olaf and Luo, Yong (2007) Structure and Properties of Traces for Functional Programs. In: Mackie, Ian, ed. Proceedings of the 3rd International Workshop on Term Graph Rewriting, Termgraph 2006. ENTCS, 176. Elsevier pp. 39-63. (doi:https://doi.org/10.1016/j.entcs.2006.10.032) (Full text available)

Preview

Chitil, Olaf and Luo, Yong (2006) Towards a Theory of Tracing for Functional Programs based on Graph Rewriting. In: Mackie, Ian, ed. Draft Proceedings of the 3rd International Workshop on Term Graph Rewriting, Termgraph 2006. Termgraph (Full text available)

Preview

Chitil, Olaf and McNeill, Dan and Runciman, Colin (2004) Lazy Assertions. In: Trinder, Phil and Michaelson, Greg and Pena, Ricardo, eds. Implementation of Functional Languages: 15th International Workshop, IFL 2003. LNCS 3145, 3145. Springer pp. 1-19. ISBN 3-540-23727-5. (Full text available)

Preview

Chitil, Olaf and Runciman, Colin and Wallace, Malcolm (2001) Freja, Hat and Hood --- A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs. In: Mohnen, Markus and Koopman, P., eds. Proceedings of the 12th International Workshop on Implementation of Functional Languages (IFL 2000). LNCS 2011. Springer, Aachen, Germany pp. 176-193. ISBN 3-540-41919-5. (doi:https://doi.org/10.1007/3-540-45361-X_11) (Full text available)

Preview

Chitil, Olaf and Runciman, Colin and Wallace, Malcolm (2000) Tracing and Debugging of Lazy Functional Programs - A Comparative Evaluation of Three Systems. In: Mohnen, Markus and Koopman, P., eds. Draft Proceedings of the 12th International Workshop on Implementation of Functional Languages. , Aachen, Germany pp. 47-62. (Full text available)

Preview

Chitil, Olaf and Runciman, Colin and Wallace, Malcolm (2002) Transforming Haskell for Tracing. In: Ricardo, Peña and Thomas, Arts, eds. Draft papers of 14th International Workshop, IFL 2002, Madrid, Spain, September 16-18, 2002. (Full text available)

Preview

Chitil, Olaf and Runciman, Colin and Wallace, Malcolm (2003) Transforming Haskell for Tracing. In: Ricardo, Peña and Thomas, Arts, eds. Lecture Notes in Computer Science. Implementation of Functional Languages: 14th International Workshop, IFL 2002. LNCS 2670. Springer-Verlag Berlin, Berlin pp. 165-181. ISBN 978-3-540-40190-2. E-ISBN 978-3-540-44854-9. (doi:https://doi.org/10.1007/3-540-44854-3_11) (Full text available)

Preview

Claessen, Koen and Runciman, Colin and Chitil, Olaf and Hughes, John and Wallace, Malcolm (2003) Testing and Tracing Lazy Functional Programs using QuickCheck and Hat. In: 4th Summer School in Advanced Functional Programming. 4th International School, AFP 2002. LNCS 2638. Springer pp. 59-99. ISBN 978-3-540-40132-2. E-ISBN 978-3-540-44833-4. (doi:https://doi.org/10.1007/978-3-540-44833-4_3) (Full text available)

Preview

Clear, David and Ibbetson, Alan L. and Collinson, Peter (1994) Exporting Home on Demand to PCS. In: Proceedings of the Eight Systems Administration Conference (LISA VIII). Usenix Assoc pp. 139-147. ISBN 1-880446-64-2. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cobbah, W.G.K. and Fairhurst, Michael (2000) Computer analysis of handwriting dynamics during dopamimetic tests in Parkinson's disease. In: Vajda, F., ed. Proceedings: 26TH Euromicro Conference. Ieee Computer Soc A414-A418. ISBN 0-7695-0781-6. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cohen, Dave and Watson, Phil (1991) An efficient representation of arithmetic for term rewriting. In: Book, Ronald V., ed. Rewrite Techniques and Applications, Proceedings of the 4th Conference on Rewrite Techniques and Applications, Como, Italy, 1991. Lecture Notes in Computer Science, 488. Springer Verlag pp. 240-251. (doi:https://doi.org/10.1007/3-540-53904-2_100) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Colchester, Alan C. F. and Ourselin, Sébastien and Zhu, Yonggen and Bardinet, Eric and He, Yang and Roche, Alexis and Al-Sarraj, Safa and Nailon, Bill and Ironside, James and Ayache, Nicholas (2000) 3-D reconstruction of macroscopic optical brain slice images. In: 3rd International Conference on Medical Image Computing and Computer-Assisted Intervention, Pittsburgh, Pennsylvania. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cole, James and Derrick, John and Milosevic, Zoran and Raymond, Kerry (2001) Author Obliged to Submit Paper before 4 July: Policies in an Enterprise Specification. In: Sloman, Morris and Lobo, Jorge and Lupu, Emil C., eds. Policies for Distributed Systems and Networks. Lecture Notes in Computer Science, 1995. Springer-Verlag pp. 1-17. ISBN 3-540-41610-2. (Full text available)

Preview Preview

Cooper, S. Barry and Lempp, Steffen and Watson, Philip (1989) Weak density and cupping in the d-r.e. degrees. Israel Journal of Mathematics, 67 (1). pp. 137-152. (doi:https://doi.org/10.1007/BF02937291) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cornélioa, Márcio and Cavalcanti, Ana L. C. and Sampaio, Augusto C.A. (2002) Refactoring by Transformation. In: Proceedings of REFINE'2002. Electronic Notes in Theoretical Computer Science, 70. Elsevier Science B V pp. 311-330. (doi:https://doi.org/10.1016/S1571-0661(05)82564-2) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Coutinho, S.L. and Reis, T.P.C. and Cavalcanti, Ana L. C. (1999) A Tool for Teaching Refinement. In: 13th Brazilian Symposium on Software Engineering - Tools Session. pp. 61-64. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cross, M. and Keech, M. and Liddell, Heather and Steel, John and Walshaw, C and Welch, Peter H. (1995) Implementing a strategy for the promotion of high performance computing in the UK. In: Hertzberger, Bob and Serazzi, Giuseppe, eds. Hight-Performance Computing and Networking. Springer-Verlag Berlin p. 941. ISBN 3-540-59393-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

D

Daniels, Anthony C. (1997) Fran in action! Other. (Unpublished) (Full text available)

Preview Preview

Daniels, Anthony C. (1999) Fran poster. Other. (Unpublished) (Full text available)

Preview Preview

Daniels, Anthony C. (2000) Recursive Functions and Reactive Behaviours: The Essence of Fran. Other. Kent University (Unpublished) (Full text available)

Preview Preview

Daniels, Anthony C. (1999) A Semantics for Functions and Behaviours. Doctor of Philosophy (PhD) thesis, The University of Nottingham. (Full text available)

Preview Preview

Davie, Thomas and Chitil, Olaf (2006) Display of Functional Values for Debugging. In: Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006. Eotvos Lorand University, Budapest, Hungary pp. 326-337. ISBN 963-463-876-7. (Full text available)

Preview

Davie, Thomas and Chitil, Olaf (2005) Hat-Delta --- One Right Does Make a Wrong. In: Runciman, Colin, ed. Hat Day 2005: work in progress on the Hat tracing system for Haskell. Tech. Report YCS-2005-395, Dept. of Computer Science, University of York, UK pp. 6-11. (Full text available)

Preview

Davie, Thomas and Chitil, Olaf (2006) One Right Does Make a Wrong. In: Pre-Proceedings of the Seventh Symposium on Trends in Functional Programming, TFP 2006. (Full text available)

Preview

Davies, Jim and Bryans, Jeremy W. and Schneider, Steve A. (1996) Real-time LOSTOS and Timed Observations. In: UNSPECIFIED. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Dealmeida, F.A. and Welch, Peter H. (1994) A Parallel Emulator for a Multi-Processor Dataflow Machine. In: DeGloria, A. and Jane, M.R. and Marini, D., eds. Transputer Applications and Systems ''94, Proceedings of the 1994 World Transputer Congress. I O S Press pp. 259-272. ISBN 90-5199-177-0. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Delaney, Aidan and Taylor, John and Thompson, Simon (2008) Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages. In: Stapleton, Gem and Howse, John and Lee, John, eds. Diagrammatic Representation and Inference: 5th International Conference, Diagrams 2008, Herrsching, Germany, September 19-21, 2008. Lecture Notes in Computer Science (5223). pp. 172-187. ISBN 978-3-540-87729-5. (doi:https://doi.org/10.1007/978-3-540-87730-1<sub>1</sub>8) (Full text available)

Preview

Dent, Alan and Hanna, Keith (1993) Reasoning about Array Structures Using a Dependently Typed Logic. In: Proc Computer Hardware Description Languages (CHDL-93). Elsevier Science Publishers pp. 195-212. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Derrick, John (2003) Timed CSP and Object-Z. In: Bert, Didier and Bowen, Jonathan P. and King, Steve and Walden, Marina, eds. ZB 2002: Formal Specification and Development in Z and B. Lecture Notes in Computer Science, 2651. Springer-Verlag pp. 300-318. ISBN 3-540-40253-5. (doi:https://doi.org/10.1007/3-540-44880-2_19) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Derrick, John (2000) A single complete refinement rule for Z. Journal of Logic and Computation, 10 (5). pp. 663-675. ISSN 0955-792X. (doi:https://doi.org/10.1093/logcom/10.5.663) (Full text available)

Preview Preview

Derrick, John and Akehurst, David H. and Boiten, Eerke Albert (2002) A framework for UML consistency. In: Kuzniarz, L. and Reggio, G. and Sourrouille, J.L. and Huzar, Z., eds. UML 2002 Workshop on Consistency Problems in UML-based Software Development. pp. 30-45. (Full text available)

Preview

Derrick, John and Boiten, Eerke Albert (2002) Combining Component specifications in Object-Z and CSP. Formal Aspects of Computing, 13 (Part 2). pp. 111-127. ISSN 0934-5043. (doi:https://doi.org/10.1007/s001650200002) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Derrick, John and Boiten, Eerke Albert (2008) More relational refinement: traces and partial relations. Electronic Notes in Theoretical Computer Science, 214 . pp. 255-276. ISSN 1571-0661. (doi:https://doi.org/10.1016/j.entcs.2008.06.012) (Full text available)

Preview

Derrick, John and Boiten, Eerke Albert (2001) Refinement in Z and Object-Z: Foundations and Advanced Applications. Formal Approaches to Computing and Information Technology . Springer ISBN 1-85233-245-X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Derrick, John and Boiten, Eerke Albert (2014) Refinement in Z and Object-Z: Foundations and Advanced Applications (2nd revised edition). Springer, London Heidelberg New York Dordrecht, 510 pp. ISBN 978-1-4471-5354-2. E-ISBN 978-1-4471-5355-9. (doi:https://doi.org/10.1007/978-1-4471-5355-9) (Full text available)

Preview

Derrick, John and Boiten, Eerke Albert (2000) Refinement of objects and operations in Object-Z. In: Smith, Scott F. and Talcott, Carolyn L., eds. Formal Methods for Open Object-based Distributed Systems IV. Kluwer Academic Publishers pp. 257-277. ISBN 0-7923-7923-3. (Full text available)

Preview

Derrick, John and Boiten, Eerke Albert (2007) Relational Concurrent Refinement with Internal Operations. Electronic Notes in Theoretical Computer Science, 187 . pp. 35-53. ISSN 1571-0661. (doi:https://doi.org/10.1016/j.entcs.2006.08.043) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Derrick, John and Boiten, Eerke Albert (1999) Separating component and context specification using Promotion. In: Araki, Keijiro and Galloway, Andrew and Taguchi, Kenji, eds. International Conference on Integrated Formal Methods 1999 (IFM'99). Springer pp. 293-312. ISBN 18523310710. (Full text available)

Preview Preview

Derrick, John and Boiten, Eerke Albert (1999) Testing Refinements of State-based Formal Specifications. Software Testing, Verification and Reliability, 9 (1). pp. 27-50. (Full text available)

Preview Preview

Derrick, John and Boiten, Eerke Albert and Bowman, Howard and Steen, Maarten (1998) Specifying and Refining Internal Operations in Z. Formal Aspects of Computing, 10 (2). pp. 125-159. ISSN 0934-5043 (Print) 1433-299X (Online). (doi:https://doi.org/10.1007/s001650050007) (Full text available)

Preview Preview

Derrick, John and Boiten, Eerke Albert and Bowman, Howard and Steen, Maarten (1996) Supporting ODP - Translating LOTOS into Z. In: Najm, Elie and Stefani, J.-B., eds. First IFIP International Workshop on Formal Methods for Open Object-Based Distributed Systems. Chapman & Hall, Paris pp. 399-406. ISBN 0-412-79770-4. (Full text available)

Preview Preview

Derrick, John and Boiten, Eerke Albert and Bowman, Howard and Steen, Maarten (1997) Translating LOTOS to Object-Z. In: Duke, David J. and Evans, A.S., eds. 2nd BCS-FACS Northern Formal Methods Workshop. Workshops in Computing. Springer-Verlag ISBN 3-540-76215-9. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Derrick, John and Boiten, Eerke Albert and Bowman, Howard and Steen, Maarten (1997) Weak refinement in Z. In: Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation. (doi:https://doi.org/10.1007/BFb0027298) (Full text available)

+1 more...

Derrick, John and Bowman, Howard and Boiten, Eerke Albert and Steen, Maarten (1996) Comparing LOTOS and Z refinement relations. In: Formal Description Techniques IX: Theory, application and tools, IFIP TC6 WG6.1 International Conference on Formal Description Techniques IX / Protocol Specification, Testing and Verification XVI. Chapman & Hall, Kaiserslautern, Germany pp. 501-516. ISBN 0-412-79490-X. (Full text available)

Preview Preview

Derrick, John and Bowman, Howard and Steen, Maarten (1995) Maintaining Cross Viewpoint Consistency using Z. In: UNSPECIFIED. (Full text available)

Preview Preview

Derrick, John and Bowman, Howard and Steen, Maarten (1995) Viewpoints and Objects. In: UNSPECIFIED. (Full text available)

Preview Preview

Derrick, John and Smith, Graeme (2004) Linear temporal logic and Z refinement. In: Rattray, Charles and Maharaj, Savitri and Shankland, Carron, eds. Algebraic Methodology and Software Technology (AMAST 2004). Lecture Notes in Computer Science, 3116. Springer pp. 117-131. ISBN 3-540-22381-9. (doi:https://doi.org/10.1007/b98770) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Derrick, John and Smith, Graeme (2003) Structural Refinement of Systems Specified in Object-Z and CSP. Formal Aspects of Computing, 15 (1). pp. 1-27. ISSN 0934-5043. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Derrick, John and Smith, Graeme (2000) Structural refinement in Object-Z / CSP. In: Grieskamp, Wolfgang and Stanten, Thomas and Stoddart, Bill, eds. Integrated Formal Methods (IFM 2000). Lecture Notes in Computer Science, 1945. Springer pp. 194-213. ISBN 3-540-41196-8. (Full text available)

Preview Preview

Derrick, John and Sultana, R. (1993) The Specification in Z of the REX Protocol. Technical report. University of Kent, Canterbury, UK, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Derrick, John and Wehrheim, Heike (2003) Using coupled simulations in non-atomic refinement. In: Bert, Didier and Bowen, Jonathan P. and King, Steve and Walden, Marina, eds. ZB 2003: Formal Specification and Development in Z and B. Lecture Notes in Computer Science, 2651. Springer pp. 127-147. ISBN 3-540-40253-5. (doi:https://doi.org/10.1007/3-540-44880-2_10) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Dick, A.J.J. and Watson, Phil (1991) Order-sorted term rewriting. Computer Journal, 34 (1). pp. 16-19. ISSN 0010-4620. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Duran, Adolfo and Sampaio, Ana and Cavalcanti, Augusto (2002) Refinement Algebra for Formal Bytecode Generation. In: Proceedings of the 4th International Conference on Formal Engineering Methods - ICFEM 2002. Springer-Verlag pp. 347-358. ISBN 978-3-540-00029-7. (doi:https://doi.org/10.1007/3-540-36103-0_36) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

de Carvalho, Andre C.P.L.F. and Fairhurst, Michael and Bisset, D.L. (1994) An Integrated Boolean Neural-Network for Pattern-Classification. Pattern Recognition Letters, 15 (8). pp. 807-813. ISSN 0167-8655. (doi:https://doi.org/10.1016/0167-8655(94)90009-4) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

de Carvalho, Andre C.P.L.F. and Fairhurst, Michael and Bisset, D.L. (1994) A Modular Boolean Architecture for Pattern Recognition. In: 1994 IEEE International Conference on Neural Networks. I E E E pp. 4349-4352. ISBN 0-7803-1901-X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

E

Evans, A.S. and Holton, D.R.W. and Lai, L.M. and Watson, Phil (1997) A comparison of real-time formal specification languages. In: Duke, David J. and Evans, A.S., eds. Proceedings of the Northern Formal Methods Workshop, Ilkley, September 1996. Electronic Workshops in Computer Science. Springer Verlag ISBN 3-540-76117-9. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

F

Faridani, A. and Dimond, Keith R. (1994) A Transputer-Based Vision System for Mobile Robots. In: Arabnia, Hamid R., ed. Transputer Research and Applications 7. I O S Press pp. 68-78. ISBN 90-5199-187-8. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Felleisen, Matthias and Hanus, Michael and Thompson, Simon (1999) Proceedings of the 1999 Workshop on Functional and Declarative Programming in Education. Technical report. Rice University (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Findlay, G. and Hirst, Timothy R. (1993) The Role of DSBA in Enterotoxin Biogenesis and Cell Viability. In: Freer, J. and Aitken, Robert and Alouf, J.E and Boulnois, G. and Falmagne, P. and Fehrenbach, F. and Montecucco, C. and Piemont, Y. and Rappuoli, R. and Wadstrom, Torkel and Witholt, B., eds. Bacterial Protein Toxins - Sixth European Workshop. Gustav Fischer Verlag pp. 212-213. ISBN 3-437-11535-9. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Freitas, Leonardo (2002) JACK: A process algebra implementation in Java. Other masters thesis, Centro de Informatica, Universidade Federal de Pernambuco. (Full text available)

Preview

Freitas, Leonardo and Cavalcanti, Ana L. C. and Sampaio, Augusto C.A. (2002) JACK: A Framework for Process Algebra Implementation in Java. In: Proceedings of XVI Simpósio Brasileiro de Engenharia de Software. Sociedade Brasileira de Computacao, http://www.sbc.org.br/sbes pp. 1-16. (Full text available)

Preview

G

Gaizauskas, Robert and Cunningham, Hamish and Wilks, Yorick and Rodgers, Peter and Humphreys, Kevin (1996) GATE -- an Environment to Support Research and Development in Natural Language Engineering. In: Proceedings of the 8th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-96). IEEE Computer Society pp. 58-66. (Full text available)

Preview

Gaizauskas, Robert and Rodgers, Peter (1997) NL Module Evaluation in GATE. In: SALT '97 Workshop on Evaluation in Speech and Language Technology. (Full text available)

Gaizauskas, Robert and Rodgers, Peter and Humphreys, Kevin (2001) Visual Tools for Natural Language Processing. Journal of Visual Languages and Computing, 12 (4). pp. 375-412. ISSN 1045-926X. (doi:https://doi.org/10.1006/jvlc.2000.0203) (Full text available)

Preview

Giacomini, Luisa and Bordbar, Behzad and Holding, David J. (2000) Hybrid Sliding Mode Control for a Set of Interconnected Nonlinear. In: Proceedings of the 39th IEEE Conference on Decision and Control. IEEE Conference on Decision and Control - Proceedings, 1-5. , Sydney Convention and Exhibition Centre pp. 2180-2185. ISBN 0-7803-6638-7. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Gomez, Rodolfo (2009) A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata. In: Proc. of the 7th Int. Conf. on Formal Modelling and Analysis of Timed Systems (FORMATS'09), 14-16 September, Budapest, Hungary. LNCS. Springer-Verlag ISBN 978-3-642-04367-3. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Gomez, Rodolfo (2009) Compositional detection of Zeno behavior in Timed Automata with Deadlines. Technical report. UKC (Full text available)

Preview

Gomez, Rodolfo (2009) From LIDL(m) to Timed Automata. Technical report. UKC (Full text available)

Preview

Gomez, Rodolfo (2006) Verification of Real-Time Systems: Improving Tool Support. Doctor of Philosophy (PhD) thesis, University of Kent. (Full text available)

Preview

Gomez, Rodolfo (2008) Verification of Timed Automata with Deadlines in Uppaal. Technical report. UKC (Full text available)

Preview

Gomez, Rodolfo and Augusto, Juan Carlos (2004) Durative Events in Active Databases. In: ICEIS 2004, Proceedings of the 6th International Conference on Enterprise Information Systems. , Porto, Portugal pp. 306-311. (Full text available)

Preview

Gomez, Rodolfo and Augusto, Juan Carlos and Acuña, Silvia.T. (2003) An Algorithm to Translate PARADIGM specifications to PLTL. In: Proceedings of the 3ras. Jornadas Iberoamericanas de Ingenieria de Software e Ingenieria de Conocimiento (JIISIC'03). , Valdivia, Chile pp. 53-63. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Gomez, Rodolfo and Ausguto, Juan Carlos (2006) Expressiveness of Temporal Query Languages: On the Modelling of Intervals, Interval Relationships and States. Artificial Intelligence Review, 26 (4). pp. 269-289. ISSN 0269-2821. (doi:https://doi.org/10.1007/s10462-007-9051-4) (Full text available)

Preview

Gomez, Rodolfo and Bowman, Howard (2006) Compositional Detection of Zeno Behaviour in Timed Automata. Technical report. Computing Laboratory, CT2 7NF Canterbury, Kent, UK (Full text available)

Preview

Gomez, Rodolfo and Bowman, Howard (2005) Discrete Timed Automata. Technical report. UKC (Full text available)

Preview

Gomez, Rodolfo and Bowman, Howard (2003) Discrete Timed Automata and MONA: Description, Specification and Verification of a Multimedia Stream. In: Konig, H. and Heiner, M. and Wolisz, A., eds. Formal Techniques for Networked and Distributed Systems - FORTE 2003. Proceedings of the 23rd IFIP WG 6.1 International Conference. LNCS, 2767 (2767). Springer, Berlin, Germany pp. 177-192. ISBN 3-540-20175-0. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Gomez, Rodolfo and Bowman, Howard (2007) Efficient Detection of Zeno Runs in Timed Automata. In: Raskin, J.-F. and Thiagarajan, P.S., eds. Formal Modeling and Analysis of Timed Systems: 5th International Conference, Formats 2007, Salzburg, Austria, October 3-5, 2007, Proceedings. Lecture Notes in Computer Science, 4763. Springer, Salzburg, Austria pp. 195-210. ISBN 3-540-75453-9. (Full text available)

Preview

Gomez, Rodolfo and Bowman, Howard (2003) A MONA-based Decision Procedure for Propositional Interval Temporal Logic. Other. Kent University, Vienna, Austria (Unpublished) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Gomez, Rodolfo and Bowman, Howard (2004) PITL2MONA: Implementing a Decision Procedure for Propositional Interval Temporal Logic. Journal of Applied Non-Classical Logics, 14 (1-2). pp. 105-148. ISSN 1166-3081. (Full text available)

Preview

Griffin, Darren K. and Mitchell, David and Thompson, Simon (2009) Podcasting by synchronising PowerPoint and voice: What are the pedagogical benefits? Computers and Education, 53 (2). pp. 532-539. ISSN 0360-1315. (doi:https://doi.org/10.1016/j.compedu.2009.03.011) (Full text available)

Preview

H

Hanna, Keith (1998) Automatic Verification of Mixed-Level Logic Circuits. In: Gopalakrishna, O. and Windley, P., eds. Formal Methods in Computer-Aided Design. Lecture Notes in Computer Science, 1522. Springer-Verlag, Berlin, Proceedings FMCAS 98 pp. 133-148. ISBN 3-540-65191-8. (doi:https://doi.org/10.1007/3-540-49519-3_10) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith (1999) Implementing Theorem Provers in a Purely Functional Style. Journal of Functional Programming, 9 (2). pp. 147-166. (doi:https://doi.org/10.1017/S095679689900338X) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith (2002) Interactive Visual Functional Programming. In: Jones, Simon L. Peyton, ed. Proc. Intnl Conf. on Functional Programming. International Conference on Functional Programming, 37. ACM pp. 100-112. ISBN 1-58113-487-8. (doi:https://doi.org/10.1145/581478.581493) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith (1994) Reasoning about Real Digital Circuits. In: Proc Higher Order Logic Theorem Proving and its Applications. Springer-Verlag (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith and Daeche, Neil (1986) Purely Functional Implementation of a Logic. In: Proc. 8th Intnl. Conf. on Automated Deduction. Springer Verlag pp. 598-607. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith and Daeche, Neil (1987) Specification and Verification of Digital Systems. In: Proc Conf on Logic and its Application to Computer Science. pp. 73-143. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith and Daeche, Neil (1985) Specification and Verification using Higher-Order Logic. In: Computer Hardware Description Languages and their Applications. North Holland pp. 418-433. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith and Daeche, Neil (1986) Specification and Verification using Higher-Order Logic: A Case Study. In: Formal Aspects of VLSI Design. North Holland pp. 179-213. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith and Daeche, Neil (1993) Strongly-Typed Theory of Structures and Behaviours. In: Correct Hardware Design and Verification Methods. Springer-Verlag pp. 39-54. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith and Daeche, Neil (1992) The Veritas Design Logic; a User''s View. In: Proc. Theorem Provers in Circuit Design. North Holland pp. 301-310. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith and Daeche, Neil and Longley, Mark (1989) Formal Synthesis of Digital Systems. In: Claesen, Luc J. M., ed. Proc IFIP Intnl. Workshop on Applied Formal Methods for Correct VLSI Design. Elsevier pp. 532-548. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith and Daeche, Neil and Longley, Mark (1989) Veritas: A Specification Language based on Type Theory. In: Proc. Workshop on Hardware Specification, Verification and Synthesis, Mathematical Aspects. Springer Verlag pp. 358-379. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith and Howells, Gareth (1994) Parallel Theorem Proving. In: Runciman, Colin and Wakeling, David, eds. Applications of Functional Programming. UCL Press, pp. 221-235. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanna, Keith and Howells, Gareth (1994) The Veritas Proof Assistant. In: Runciman, Colin and Wakeling, David, eds. Applications of Functional Programming. UCL Press, pp. 125-204. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hanus, Michael and Krishnamurthy, Shriram and Thompson, Simon (2002) Functional and Declarative Programming in Education 2002. In: Functional and Declarative Programming in Education (FDPE 2002). (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hartel, Pieter H. and Feeley, Marc and Jones, Richard E. and Thomas, Stephen P. (1996) Benchmarking Implementations of Functional Languages with `Pseudoknot', a Float-Intensive Benchmark. Journal of Functional Programming, 6 (4). pp. 621-655. ISSN 0956--7968. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Heaton, Andrew and Hill, Pat and King, Andy (1998) Analysis of Logic Programs with Delay. In: Fuchs, Norbert, ed. Logic Program Synthesis and Transformation. Lecture Notes in Computer Science, 1463 . Springer-Verlag, pp. 148-167. ISBN 978-3-540-65074-4. (doi:https://doi.org/10.1007/3-540-49674-2_8) (Full text available)

Preview

Heaton, Andrew and King, Andy (2000) Abstracting Builtins for Groundness Analysis. University of Kent, School of Computing, Computing Laboratory, 8 pp. (Full text available)

Preview

Hierons, R. and Derrick, John (2000) Editorial: Special issue on specification-based testing. Software Testing Verification & Reliability, 10 (4). pp. 201-202. ISSN 0960-0833. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hill, Pat and King, Andy (1998) Detecting and Exploiting Determinacy in Logic Programs. Computational Logic Newsletter, 4 (1). pp. 100-101. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hill, Steve (1994) Continuation Passing Combinators for Parsing Precedence Grammars. Technical report. University of Kent, Computing Laboratory, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Hill, Steve (1994) The Functional Simulation of a Simple Microprocessor. Technical report. University of Kent, Computing Laboratory, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Hill, Steve (1995) The Lazy Z-Buffer. Information Processing Letters, 55 (2). pp. 65-70. ISSN 0020-0190. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hill, Steve (1994) The Lazy Z-Buffer. Technical report. University of Kent, Computing Laboratory, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Hill, Steve (1995) Parallel imperative functional programming. In: Nixon, Paddy, ed. Transputer and Occam Developments. I O S Press pp. 33-46. ISBN 90-5199-222-X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hill, Steve and Thompson, Simon (1995) Miranda in Isabelle. In: Paulson, Lawrence C., ed. Preceedings of the first Isabelle Users Workshop. University Of Cambridge Computer Laboratory Technical Reports Series (397). pp. 122-135. (Full text available)

Preview Preview

Hobbs, M.H.W. and Rodgers, Peter (1998) Representing Space: A Hybrid Genetic Algorithm for Aesthetic Graph Layout. In: FEA'98 Frontiers in Evolutionary Algorithms in Proceedings of JCIS'98 The Fourth Joint Conference on Information Sciences. pp. 415-418. (Full text available)

Preview

Hojjatoleslami, Ali and Kittler, Josef (1998) Region Growing: A New Approach. IEEE Transactions on Image Processing, 7 (7). 1079 -1084. ISSN 1057-7149. (doi:https://doi.org/10.1109/83.701170) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hopkins, Tim (1992) Remark on Algorithm-540. Acm Transactions on Mathematical Software, 18 (3). pp. 343-344. ISSN 0098-3500. (doi:https://doi.org/10.1145/131766.131773) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hopkins, Tim and Morse, David R. (1992) Cumulative Index to the ACM Algorithms. Technical report. , University of Kent, Canterbury, UK (Full text available)

Preview Preview

Howe, Jacob M. (2001) Proof Search in Lax Logic. Mathematical Structures in Computer Science, 11 (4). pp. 573-588. ISSN 0960-1295. (doi:https://doi.org/10.1017/S0960129501003334) (Full text available)

Preview Preview

Howe, Jacob M. (1999) Proof Search in Lax Logic. Technical report. (Full text available)

Preview Preview

Howe, Jacob M. (1997) Two Loop Detection Mechanisms: A Comparison. In: Galmiche, D., ed. TABLEAUX'97, Automated Reasoning with Analytic Tableaux and Related Methods. Lecture Notes in Artificial Intelligence, 1227. Springer-Verlag pp. 188-200. ISBN 3-540-62920-3. (doi:https://doi.org/10.1007/BFb0027400) (Full text available)

Preview +1 more...

Howe, Jacob M. and King, Andy (2002) Correctness of Set-Sharing with Linearity. University of Kent, School of Computing, Canterbury, 5 pp. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2001) Positive Boolean Functions as Multiheaded Clauses. In: Codognet, Philippe, ed. International Conference on Logic Programming. Lecture Notes in Computer Science, 2237 . Springer-Verlag, London, pp. 120-134. ISBN 3-540-42935-2. (doi:https://doi.org/10.1007/3-540-45635-X_16) (Full text available)

Preview

Howe, Jacob M. and King, Andy (1999) A Semantic Basis for Specialising Domain Constraints. University of Kent, School of Computing, Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK, 12 pp. (Full text available)

Preview

Howe, Jacob M. and King, Andy (1999) Specialising Finite Domain Programs using Polyhedra. In: Bossi, Annalisa, ed. Lecture Notes In Computer Science. Lecture Notes in Computer Science, 1817 . Springer-Verlag, pp. 118-135. ISBN 978-3-540-67628-7. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2001) Widening BDDs. University of Kent, School of Computing, 9 pp. (Full text available)

Preview

Howells, Gareth and Fairhurst, Michael and Bisset, D.L. (1994) BCN - an Architecture for Weightless Ram-Base Neural Networks. In: 1994 IEEE International Conference on Neural Networks. I E E E pp. 1386-1390. ISBN 0-7803-1901-X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Howells, Gareth and Fairhurst, Michael and Bisset, D.L. (1995) PCN: The Probabilistic Convergence Network. In: IEEE International Conference on Neural Networks Proceedings. IEEE pp. 1211-1214. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Howells, Gareth and Fairhurst, Michael and Rahman, Fuad (2000) An exploration of a new paradigm for weightless RAM-based neural networks. Connection Science, 12 (1). pp. 65-90. ISSN 0954-0091. (doi:https://doi.org/10.1080/095400900116203) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

J

Johnson, Christopher W. and Telford, Alastair J. (1996) Extending the Application of formal methods to analyse human error and system failure during accident investigations. Software Engineering Journal, 11 (6). pp. 355-365. ISSN 0268-6961. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Johnson, Colin G. and Marsh, Duncan (1996) Modelling Robot Manipulators in a CAD Environment Using B-Splines. In: Bourbakis, Nikolaos G., ed. Proceedings of the 1996 IEEE Joint Symposia on Intelligence and Systems. IEEE Press pp. 194-201. ISBN 0-8186-7728-7. (Full text available)

Preview Preview

Jones, Richard E. (1996) Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley and Sons, 403 pp. ISBN 0-471-94148-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Jones, Richard E. (2000) Memory Management Session Overview. In: Kirby, G.N.C. and Dearle, A. and Sjoberg, D.I.K., eds. Persistent Object Systems: Design, Implementation, and Use. Lecture Notes in Computer Science, 2135. Springer, Lillehammer, Norway pp. 84-86. ISBN 3-540-42735-X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Jones, Richard E. (1989) On the Implementation of Functional Programming Languages. Other masters thesis, UKC Computing Laboratory. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Jones, Richard E. (1990) Tail Recursion Without Space Leaks. Technical report. UKC, University of Kent, Canterbury, UK 72*. (doi:72*) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Jones, Richard E. (1992) Tail recursion without Space Leaks. Journal of Functional Programming, 2 (1). pp. 73-79. ISSN 0956--7968. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Jones, Richard E. (1993) Zed --- a Z specification language Type 1 font. UNSPECIFIED. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Jones, Richard E. (1995) Zed --- a Z specification language font for PostScript Type 1 and TrueType. UNSPECIFIED. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Jones, Richard E. and Jul, Eric (1999) Garbage Collection. UNSPECIFIED. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Jones, Richard E. and Jul, Eric (2000) Introduction to Memory Management and Garbage Collection. ACM SIGPLAN. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Jones, Richard E. and Lins, Rafael D. (1992) Cyclic Weighted Reference Counting without Delay. Technical report. UKC, University of Kent, Canterbury, UK 28-92*. (doi:28-92*) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Jones, Richard E. and Lins, Rafael D. (1993) Cyclic Weighted Reference Counting without Delay. In: Proceedings of PARLE'93. pp. 712-715. ISBN 0-387-56891-3. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

K

Kaganovsky, Alexander (1999) Exact Complex Arithmetic in an Imaginary Radix System. Technical report. (Full text available)

Preview Preview

Kahrs, Stefan (1996) About the completeness of type systems. In: UNSPECIFIED. (Full text available)

Preview Preview

Kahrs, Stefan (1993) Compilation of combinatory reduction systems. In: Heering, Jan and Meinke, Karl and Möller, Bernhard and Nipkow, Tobias, eds. Selected Papers from the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting. Lecture Notes in Computer Science, 816. Springer pp. 169-188. ISBN 3-540-58233-9. (Full text available)

Preview

Kahrs, Stefan (1995) Confluence of Curried Term-Rewriting Systems. Journal of Symbolic Computation, 19 . pp. 601-623. (Full text available)

Preview Preview

Kahrs, Stefan (1994) First-class polymorphism for ML. In: UNSPECIFIED. (Full text available)

Preview Preview

Kahrs, Stefan (2006) Gene Expression Programming with Pre-Order Traversals. In: Sirlantzis, Konstantinos, ed. Proceedings of the 6th International Conference on Recent Advances in Soft Computing. pp. 84-89. ISBN 1-902671-42-2. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kahrs, Stefan (2006) Genetic Programming with Primitive Recursion. In: Keijzer, Maarten, ed. Proceedings of the 8th annual conference on Genetic and evolutionary computation. ACM Press, New York, New York (USA) pp. 941-942. ISBN 1-59593-186-4. (doi:https://doi.org/10.1145/1143997.1144160) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kahrs, Stefan (2007) Infinitary rewriting: meta-theory and convergence. Acta Informatica, 44 (2). pp. 91-121. ISSN 0001-5903. (doi:https://doi.org/10.1007/s00236-007-0043-2) (Full text available)

Preview

Kahrs, Stefan (1997) Lecture Notes on Formal Program Development. Technical report. University of Edinburgh (Full text available)

Preview Preview

Kahrs, Stefan (1996) Limits of ML-definability. In: UNSPECIFIED. (Full text available)

Preview Preview

Kahrs, Stefan (1993) Mistakes and Ambiguities in the definition of Standard ML. Technical report. University of Edinburgh (Full text available)

Preview Preview

Kahrs, Stefan (2009) Modularity of Convergence in Infinitary Rewriting. In: Treinen, Ralf, ed. Rewriting Techniques and Applications. Lecture Notes in Computer Science, 5595. Springer pp. 179-193. ISBN 978-3-642-02347-7. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kahrs, Stefan (1992) Polymorphic Type Checking by Interpretation of Code. Technical report. (Full text available)

Preview Preview

Kahrs, Stefan (2001) Red-black trees with types. Journal of Functional Programming, 11 (4). pp. 425-432. (doi:https://doi.org/10.1017/S0956796801004026) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kahrs, Stefan (1995) Towards a domain theory for termination proofs. In: UNSPECIFIED. (Full text available)

Preview Preview

Kahrs, Stefan (1992) Unlimp -- uniqueness as a leitmotiv for implementation. In: UNSPECIFIED. (Full text available)

Preview Preview

Kahrs, Stefan (2003) Well-Going Programs Can Be Typed. In: Hofmann, Martin, ed. Typed Lambda Calculi and Applications Proceedings. LNCS, 2701 (2701). Springer pp. 167-179. ISBN 3-540-40332-9. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kahrs, Stefan (1995) The variable containment problem. In: UNSPECIFIED. (Full text available)

Preview Preview

Kahrs, Stefan and Sannella, Don and Tarlecki, Andrzej (1994) The definition of Extended ML. Technical report. University of Edinburgh (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Kahrs, Stefan and Sannella, Don and Tarlecki, Andrzej (1997) The semantics of Extended ML: A gentle introduction. Theoretical Computer Science, 173 (2). pp. 445-484. ISSN 0304-3975. (Full text available)

Preview Preview

Kalli, Kyriacos and Rao, Yun Jiang and Webb, David J. and Jackson, David A. (1995) Potential of fibre optic point and distributed fibre optic sensors for structural monitoring. In: Augousti, A.T., ed. Sensors and their Aplications VII. Iop Publishing Ltd pp. 184-189. ISBN 0-7503-0331-X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kelner, J. and Cavalcanti, Ana L. C. and Pardo, A. (1989) LindA: A Language for Automated Authoring of Hypertexts. In: 3rd Brazilian Symposium on Sofrware Engineering. pp. 124-136. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kemp, Bob and King, Andy and Soper, Paul (1994) Continuation Compilation for Concurrent Logic Programming. In: Crespo, Alfons, ed. Symposium on Artificial Intelligence in Real-time Control. Pergamon, pp. 299-306. ISBN 0-08-042236-5. (Full text available)

Preview

Kemp, Zarine P. (1995) Multimedia and Spatial Information Systems. IEEE Multimedia, 2 (4). pp. 68-76. ISSN 1070-986X. (doi:https://doi.org/10.1109/93.482297) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kemp, Zarine P. and Kowalczyk, Arek (1994) Incorporating the Temporal Dimension in a GIS. In: Worboys, Michael F., ed. Innovations in GIS - Selected Papers from the First National Conferece on Gis Research UK. Taylor & Francis Ltd pp. 89-103. ISBN 0-7484-0140-7. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kettle, Neil (2008) Anytime Algorithms for ROBDD Symmetry Detection and Approximation. Doctor of Philosophy (PhD) thesis, Computing Laboratory. (Full text available)

Preview

Kettle, Neil and King, Andy (2006) An Anytime Symmetry Detection Algorithm for ROBDDs. In: Onodera, H., ed. Asia and South Pacific Design Automation Conference. IEEE Press, pp. 243-248. ISBN 0-7803-9451-8. (doi:https://doi.org/10.1145/1118299.1118364) (Full text available)

Preview

Kettle, Neil and King, Andy (2006) Proof of New Decompositional Results for Generalized Symmetries (appendix for journal paper). University of Kent, School of Computing, University of Kent, Canterbury, Kent, CT2 7NF, 10 pp. (Full text available)

Preview

Kettle, Neil and King, Andy (2006) Proof of New Implicational Relationships between Generalized Symmetries (appendix for journal paper). University of Kent, School of Computing, University of Kent, Canterbury, Kent, CT2 7NF, 11 pp. (Full text available)

Preview

King, Andrew C. (2002) Removing GC Synchronisation. In: OOPSLA'02 ACM Conference on Object-Oriented Systems, Languages and Applications (Companion)R. SIGPLAN. ACM, Seattle, WA pp. 112-113. ISBN 1-58113-626-9. (Full text available)

Preview

King, Andy (1994) A Framework for Freeness Analysis. In: Tick, Evan and Succi, G., eds. Implementations of Logic Programming Systems. Implementations of Logic Programming Systems . Kluwer Academic Publishers, Dordrecht, pp. 137-149. ISBN 0-7923-9457-7. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

King, Andy, ed. (2008) Logic-Based Program Synthesis and Transformation. Lecture Notes in Computer Science (4915). Springer-Verlag, 219 pp. ISBN 978-3-540-78768-6. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

King, Andy (2008) Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry. In: Arenas, Puri and Zanardini, Damiano, eds. Proceedings on Logic-Based Methods in Programming Envrionments. CoRR, Udine pp. 1-7. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

King, Andy (1995) Share x Free Revisited. University of Kent, School of Computing, University of Kent, Canterbury, UK (Full text available)

Preview

King, Andy (1994) A Synergistic Analysis for Sharing and Groundness which traces Linearity. In: Sannella, Don, ed. European Symposium on Programming. Lecture Notes in Computer Science, 788 . Springer-Verlag, pp. 363-378. ISBN 3-540-57880-3. (Full text available)

Preview

King, Andy and Bryans, Jeremy W. (1998) Using Probability to Reason about Soft Deadlines. University of Kent, School of Computing, 7 pp. (Full text available)

Preview

King, Andy and Longley, Mark (1995) Abstract Matching Can Improve on Abstract Unification. University of Kent, School of Computing, University of Kent, Canterbury, UK (Full text available)

Preview

King, Andy and Lu, Lunjin (2001) A Backward Analysis for Constraint Logic Programs (appendix for journal paper). University of Kent, School of Computing, University of Kent at Canterbury, Kent, CT2 7NF, UK, 20 pp. (Full text available)

Preview

King, Andy and Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs (appendix for conference submission). University of Kent, School of Computing, University of Kent (Full text available)

Preview

King, Andy and Shen, Kish and Benoy, Florence (1997) Lower-bound Time-Complexity Analysis of Logic Programs. In: Maluszynski, Jan, ed. International Symposium on Logic programming. MIT Press, pp. 261-276. ISBN 0-262-63180-6. (Full text available)

Preview

King, Andy and Soper, Paul (1994) Depth-k Sharing and Freeness. In: Van Hentenryck, Pascal, ed. International Conference on Logic Programming. MIT Press Series in Logic Programming . MIT Press, pp. 553-568. ISBN 0-262-72022-1. (Full text available)

Preview

King, Andy and Soper, Paul (1991) Reducing Scheduling Overheads for Concurrent Logic Programs. In: Boley, Harold and Richter, Michael, eds. Processing Declarative Knowledge. Lecture Notes in Artificial Intelligence (567). Springer-Verlag, pp. 279-286. ISBN 3-540-55033-X. (Full text available)

Preview

King, Andy and Soper, Paul (1992) Serialisation Analysis of Concurrent Logic Programs. In: Kirchner, Hélène and Levi, Giorgio, eds. Algebraic and Logic Programming. Lecture Notes in Computer Science, 632 . Springer, pp. 322-334. ISBN 3-540-55873-X. (Full text available)

Preview

King, Peter and Schmitz, Patrick and Thompson, Simon (2004) Behavioural Reactivity and Real Time Programming in XML: Functional Programming meets SMIL animation. In: Vion-Dury, Jean-Yves, ed. ACM Symposium on Document Engineering 2004. ACM New York, NY, USA pp. 57-66. ISBN 1-58113-938-1. (doi:https://doi.org/10.1145/1030397.1030411) (Full text available)

Preview

Kittler, Josef and Hojjatoleslami, Ali and Windeatt, T. (1997) Strategies for combining classifiers employing shared and distinct pattern representations. Pattern Recognition Letters, 18 (11-13). pp. 1373-1377. ISSN 0167-8655. (doi:https://doi.org/10.1016/S0167-8655(97)00095-0) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

L

Laemmel, Ralf and Thompson, Simon and Kaiser, Markus (2008) Programming errors in traversal programs over structured data. In: Vinju, Jurgen and Johnstone, Adrian, eds. 8th Workshop on Language Description, Tools and Applications. ENTCS. Springer (doi:https://doi.org/10.1016/j.entcs.2009.09.045) (Full text available)

Preview

Lai, Luming and Watson, Phil (1997) A case study in Timed CSP: the railroad crossing problem. In: Maler, O., ed. Proceedings of the International Workshop on Hybrid and Real-Time Systems (HART 97). Lecture Notes in Computer Science, 1201. Springer Verlag pp. 69-74. ISBN 3-540-62600-X. (doi:https://doi.org/10.1007/BFb0014714) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Lange, Steffen and Watson, Phil (1994) Machine discovery in the presence of incomplete or ambiguous data. In: Jantke, Klaus P., ed. Algorithmic Learning Theory, Proceedings of the 5th International Workshop, Rheinhardsbrunn, Germany, 1994. Lecture Notes in Artificial Intelligence, 872. Springer Verlag pp. 438-452. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Li, Huiqing (2006) Refactoring Haskell Programs. Doctor of Philosophy (PhD) thesis, University of Kent. (Full text available)

Preview

Li, Huiqing and Reinke, Claus and Thompson, Simon (2003) Tool Support for Refactoring Functional Programs. In: Jeuring, Johan, ed. ACM SIGPLAN 2003 Haskell Workshop. pp. 27-38. ISBN 1-58113-758-3. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2008) Clone Detection and Removal for Erlang/OTP within a Refactoring Environment. In: Achten, P. and Koopman, P. and Morazán, M.T., eds. Draft Proceedings of the Ninth Symposium on Trends in Functional Programming(TFP). , The Netherlands (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2009) Clone Detection and Removal for Erlang/OTP within a Refactoring Environment. In: ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM'09). , Savannah, Georgia, USA (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2009) Clone Detection and Removal for Erlang/OTP within a Refactoring Environment. In: Penta, Massimiliano Di and Knodel, Jens, eds. Third International Workshop on Detection of Software Clones. , Kaiserslautern, Germany 1pp. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2006) A Comparative Study of Refactoring Haskell and Erlang Programs. In: Penta, Massimiliano Di and Moonen, Leon, eds. Sixth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2006). IEEE Computer Society, Washington DC pp. 197-206. ISBN 0-7695-2353-6. (doi:https://doi.org/10.1109/SCAM.2006.8) (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2005) Formalisation of Haskell Refactorings. In: UNSPECIFIED. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2007) Testing Erlang Refactorings with QuickCheck. In: The 19th International Symposium on Implementation and Application of Functional Languages, IFL 2007, LNCS. Lecture Notes In Computer Science, 5083. Springer, Freiburg, Germany pp. 19-36. ISBN 978-3-540-85372-5. (doi:https://doi.org/10.1007/978-3-540-85373-2_2) (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2008) Tool Support for Refactoring Functional Programs. In: Partial Evaluation and Program Manipulation. Assoc of Computing Machinery, San Francisco, California, USA ISBN 978-1-59593-977-7. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2008) Tool Support for Refactoring Functional Programs. In: Dig, Danny and Fuhrer, Robert and Johnson, Ralph, eds. Proceedings of the Second ACM SIGPLAN Workshop on Refactoring Tools. Assoc Computing Machinery, Nashville, Tennessee, USA 4pp. ISBN 978-1-59593-977-7. (Full text available)

Preview

Li, Huiqing and Thompson, Simon and Lövei, László and Horváth, Zoltán and Kozsik, Tamás and Víg, Anikó and Nagy, Tamás (2006) Refactoring Erlang Programs. In: The Proceedings of 12th International Erlang/OTP User Conference. , Stockholm, Sweden (Full text available)

Preview

Li, Huiqing and Thompson, Simon and Orosz, George and Töth, Melinda (2008) Refactoring with Wrangler, updated: Data and process refactorings, and integration with Eclipse. In: Horváth, Zoltán and Teoh, Tee, eds. Proceedings of the Seventh ACM SIGPLAN Erlang Workshop. ACM Press, NY, USA 12pp. ISBN 978-1-60558-065-4. (Full text available)

Preview

Li, Huiqing and Thompson, Simon and Orosz, György and Töth, Melinda (2008) Refactoring with Wrangler, updated. In: UNSPECIFIED. (Full text available)

Preview

Li, Huiqing and Thompson, Simon and Reinke, Claus (2005) The Haskell Refactorer, HaRe, and its API. Electronic Notes in Theoretical Computer Science, 141 (4). pp. 29-34. ISSN 1571-0661. (Full text available)

Preview

Li, Jia and Li, Huiqing and Jia, Xiumei (2004) A Naive Bayes Learning Based Website Reconfiguration System. In: Proceedings of the 2004 International Conference on Machine Learning and Applications. IEEE pp. 18-25. ISBN 0-7803-8823-2. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Li, Xuan and King, Andy and Lu, Lunjin (2006) Correctness of Closure Collapsing (appendix to conference submission). Lecture Notes in Computer Science, 4079/2. Report number: https://doi.org/10.1007/11799573_13. University of Kent, School of Computing, University of Kent, Canterbury, CT2 7NF ISBN 978-3-540-36635-5. (doi:https://doi.org/10.1007/11799573_13) (Full text available)

Preview

Linington, Peter F. and Derrick, John and Bowman, Howard (1996) The specification and conformance of ODP systems. In: 9th International Workshop on Testing of Communicating Systems. Chapman & Hall, Darmstadt, Germany pp. 93-114. (Full text available)

Preview Preview

Lins, Rafael D. (1989) Cyclic Reference Counting with Local Mark-Scan. Technical report. UKC, University of Kent, Canterbury, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Lins, Rafael D. (1992) Generational Cyclic Reference Counting. Technical report. Elsevier Science BV, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Lins, Rafael D. (1992) A Multi-Processor Shared Memory Architecture. Technical report. UKC, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Lins, Rafael D. (1992) Partial Categorical Multi-Combinators and Church-Rosser Theorems. Technical report. University of Kent, Canterbury, UK (Full text available)

Preview Preview

Lins, Rafael D. (1994) Partial Categorical Multi-Combinators and Church-Rosser Theorems. Technical report. University of Kent, Canterbury, UK, University of Kent, Canterbury, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Lins, Rafael D. (1991) A Shared Memory Architecture for Parallel Cyclic Reference Counting. Technical report. UKC, University of Kent, Canterbury, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Lins, Rafael D. and Jones, Richard E. (1991) Cyclic Weighted Reference Counting. Technical report. UKC, University of Kent, Canterbury, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Lins, Rafael D. and Jones, Richard E. (1993) Cyclic Weighted Reference Counting. In: WP & FP'93 Workshop on Parallel and Distributed Processing, Sofia, Bulgaria. pp. 369-382. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Lins, Rafael D. and Lira, Bruno O. (1992) GammaCMC: A Novel Way of Compiling Functional Languages. Technical report. Chapman Hall Limited, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Lins, Rafael D. and Thompson, Simon (1990) Implementing SASL using Categorical Multi-combinators. Technical report. UKC, University of Kent, Canterbury, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Lins, Rafael D. and Thompson, Simon and Jones, Simon L. Peyton (1994) On the Equivalence Between CMC and TIM. Journal of Functional Programming, 1 (4). (doi:https://doi.org/10.1017/S0956796800000939) (Full text available)

Preview Preview

Lins, Rafael D. and Vasques, M.A. (1991) A Comparative Study of Algorithms for Cyclic Reference Counting. Technical report. UKC, University of Kent, Canterbury, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Lu, Lunjin and King, Andy (2002) Backward Type Inference Generalises Type Checking. In: Hermenegildo, Manuel V. and Puebla, German, eds. Static Analysis Symposium. Lecture Notes in Computer Science, 2477 . Springer-Verlag, Berlin, pp. 85-101. ISBN 978-3-540-44235-6. (doi:https://doi.org/10.1007/3-540-45789-5_9) (Full text available)

Preview

Luo, Yong (2005) New eta-reduction and Church-Rosser. Technical report. Computing Laboratory, University of Kent, University of Kent, Canterbury, Kent, UK (Full text available)

Preview

Luo, Yong (2005) A Type Theory with Partially Defined Functions. Technical report. UKC, University of Kent, Canterbury, Kent, UK (Full text available)

Preview

Luo, Yong (2005) Yet Another Normalisation Proof for Martin-Lof's Logical Framework - Terms with correct arities are strongly normalising. Technical report. , University of Kent, Canterbury, Kent, UK (Full text available)

Luo, Yong and Chitil, Olaf (2007) Algorithmic Debugging for Locally Defined Functions. Technical report. University of Kent, Canterbury, Canterbury (Full text available)

Preview

Luo, Yong and Chitil, Olaf (2007) Algorithmic Debugging with Cyclic Traces of Lazy Functional Programs. Technical report. Computing Laboratory, University of Kent, Canterbury, Kent (Full text available)

Preview

Luo, Yong and Chitil, Olaf (2007) Algorithmic debugging and trusted functions. Technical report. Computing Laboratory, University of Kent, Canterbury, Kent (Full text available)

Preview

Luo, Yong and Chitil, Olaf (2006) Replacing Unevaluated Parts in the Traces of Functional Programs. In: Draft Proceedings of the 18th International Symposium on Implementation and Application of Functional Languages, IFL 2006. Eotvos Lorand University, Budapest, Hungary pp. 304-325. ISBN 963-463-876-7. (Full text available)

Preview

Luo, Yong and Chitil, Olaf (2007) Replacing unevaluated parts in the traces of functional programs. Technical report. University of Kent, Canterbury, Kent, Canterbury, Kent (Full text available)

Preview

M

Martin, Jon and King, Andy (1996) Typed Norms for Typed Logic Programs. In: Gallagher, John, ed. Logic Program Synthesis and Transformation. Lecture Notes in Computer Science, 1207 . Springer-Verlag, pp. 224-238. ISBN 3-540-62718-9. (doi:https://doi.org/10.1007/3-540-62718-9_13) (Full text available)

Preview

Martin, Jonthan C. and King, Andy (1997) Generating Efficient, Terminating Logic Programs. In: Bidoit, Michel and Dauchet, Max, eds. Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development. Lecture Notes in Computer Science, 1214 . Springer Verlag, pp. 173-184. ISBN 3-540-62781-2. (Full text available)

Preview

Martin, U.H. and Cohen, Dave and Lai, M.K.F. and Norrie, K.J. and Watson, Phil (1990) Case studies in equational reasoning. Technical report. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Meira, SRL and Cavalcanti, Ana L. C. (1992) MooZ Case Studies. In: Barden, Rosalind and Stepney, Susan and Cooper, David, eds. Object Orientation in Z, Workshops in Computing. Springer-Verlag, pp. 37-58. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Meira, Silvio Lemos (1991) Modular Extensions to Z. Technical report. UKC, University of Kent, Canterbury, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Meira, Silvio Lemos (1991) On the Use of Structured Inductive Semantics in Source-to-Source Translation of Programming Languagues. Technical report. UKC, University of Kent, Canterbury, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Meira, Silvio Lemos and Cavalcanti, Ana L. C. (1990) Modular Object-Oriented Z Specifications. In: Nicholls, JE, ed. Z User Workshop. Springer-Verlag, Oxford, UK pp. 173-192. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Meira, Silvio Lemos and Cavalcanti, Ana L. C. and Santos, Cåssio Souza (1994) The Unix Filing System: A MooZ Specification. In: Lano, Kevin and Haughton, Howard, eds. Object Oriented Specification Case Studies. Prentice-Hall, pp. 80-109. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Meneses, L.C.S. and Soares, S. and Meneses, J.B. and Moura, Hermano and Cavalcanti, Ana L. C. (2000) A Framework for Defining Object-oriented Languages using Action Semantics. In: 4th Brazilian Symposium on Programming Languages. pp. 172-185. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Miarka, Ralph (2002) Inconsistency and Underdefinedness in Z Specifications. Doctor of Philosophy (PhD) thesis, University of Kent. (Full text available)

Preview Preview

Miarka, Ralph and Boiten, Eerke Albert and Derrick, John (2000) Guards, Preconditions, and Refinement in Z. In: Bowen, Jonathan P. and Dunne, Steve and Galloway, Andy and King, Steve, eds. ZB2000: Formal Specification and Development in Z and B / First International Conference of B and Z Users. Lecture Notes in Computer Science, 1878. Springer-Verlag Berlin pp. 286-303. ISBN 354067948. (doi:https://doi.org/10.1007/3-540-44525-0_17) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Miarka, Ralph and Derrick, John and Boiten, Eerke Albert (2002) Handling Inconsistencies in Z using Quasi-Classical Logic. In: Berto, Didier and Bowen, Jonathan P. and Henson, Martin C. and Robinson, Ken, eds. ZB2002: Formal Specification and Development in Z and B / Second International Conference of B and Z Users. Lecture Notes in Computer Science, 2272. Springer-Verlag Berlin Heidelberg, Grenoble, France pp. 204-225. ISBN 3-540-43166-7. (doi:https://doi.org/10.1007/3-540-45648-1_11) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Moreau, Luc and Dickman, Peter and Jones, Richard E. (2005) Birrell's Distributed Reference Listing Revisited. ACM Transactions on Programming Languages and Systems (TOPLAS), 27 (6). pp. 1-52. ISSN 0164-0925. (Full text available)

Preview

Moseley, Ralph (2002) Transcending Static Deployment of Circuits: Dynamic Run-Time Systems and Mobile Hardware Processes for FPGAs. Doctor of Philosophy (PhD) thesis, Computing Laboratory. (Full text available)

Preview

Musicante, Martin A. and Lins, Rafael D. (1992) GMC A Graph Categorical Multi-Combinator Machine. Technical report. , University of Kent, Canterbury, UK (Full text available)

Preview Preview

Mutton, Paul and Rodgers, Peter (2002) Demonstration of a Preprocessor for the Spring Embedder. In: Zeytovnian, R. and Kobourov, R.K. and Goodrich, M.T. and Kobourov, S.G., eds. GD 2002, LNCS 2528. Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence. Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin pp. 374-375. ISBN 978-3-540-00158-4. (Full text available)

Preview

Mutton, Paul and Rodgers, Peter (2002) Spring Embedder Preprocessing for WWW Visualization. In: Proceedings Information Visualization 2002. IEEE, Canada/USA pp. 744-749. ISBN 0-7695-1656-4. (doi:https://doi.org/10.1109/IV.2002.1028861) (Full text available)

Preview

N

Nalbantis, D. and Walczowski, Les T. and Waller, Winston A.J. (1996) O-2 ADL: An object-oriented analog VLSI design language. In: Zhang, Qingling and Tang, Ting-Ao and Yu, Huihua, eds. 1996 2nd International Conference on Asic, Proceedings. Shanghai Scientific & Technical Literature Publ pp. 27-30. ISBN 7-5439-0940-5. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Nguyen-Viet, Chau (2004) Transformation in HaRe. Technical report. kent uni, University of Kent, Canterbury, Kent, UK (Full text available)

Preview

Nuka, Gift and Woodcock, Jim (2006) Mechanising a Unifying Theory. In: Unifying Theories of Programming. Lecture Notes in Computer Science, 4010 . Springer, Berlin, pp. 217-35. ISBN 978-3-540-34750-7. (doi:https://doi.org/10.1007/11768173_13) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

O

Oliveira, Marcel V. M. (2002) ArcAngel: a Tactic Language for Refinement and its Tool Support. Other masters thesis, Centro de Informatica, Universidade Federal de Pernambuco, Brazil. (Full text available)

Oliveira, Marcel V. M. and Cavalcanti, Ana L. C. (2000) Tactics of Refinement. In: 14th Brazilian Symposium on Software Engineering. pp. 117-132. (Full text available)

Preview

Oliver, Ian (2001) Animating Object Oriented Conceptual Models. Doctor of Philosophy (PhD) thesis, Computing Laboratory. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

of Program Construction group, Mathematics (1995) Fixed-Point Calculus. Information Processing Letters, 53 (3). pp. 131-136. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

P

Partsch, H.A. and Boiten, Eerke Albert (1991) A Note on Similarity of Specifications and Reusability of Transformational Developments. In: Möller, Bernhard, ed. Constructing Programs from Specifications : Proceedings of the IFIP TC2/WG 2.1 Working Conference. North-Holland, Amsterdam pp. 71-89. ISBN 0-444-89184-6. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Patrascoiu, Octavian and Thompson, Simon and Rodgers, Peter (2005) Tableaux for Diagrammatic Reasoning. In: Cox, Philip and Smedley, Trevor, eds. Proceedings of the 2005 International Workshop on Visual Languages and Computing. pp. 279-286. ISBN 1-891706-17-9. (Full text available)

Preview

Pearson, Justin and Bryans, Jeremy W. (1998) Constraint Oriented Specification with CSP and Real Time Temporal Logic. Technical report. University of Kent (Full text available)

Preview Preview

Poll, Erik (1998) Behavioural Subtyping for a Type-Theoretic Model of Objects. In: FOOL5: Fifth International Workshop on Foundations of Object-Oriented Languages. (Full text available)

Preview Preview

Poll, Erik (1998) Expansion Postponement for Normalising Pure Type Systems. Journal of Functional Programming, 8 (1). pp. 89-96. ISSN 0956-7968. (Full text available)

Preview Preview

Poll, Erik (1998) Subtyping and Inheritance for Categorical Datatypes. In: Theories of Types and Proofs (TTP) - Kyoto. RIMS Lecture Notes 1023. (Full text available)

Preview Preview

Poll, Erik (1997) Subtyping and Inheritance for Inductive Types. In: Proceedings of TYPES'97 Workshop on Subtyping, inheritance and modular development of proofs, Durham, UK. (Full text available)

Preview +1 more...

Poll, Erik (1997) System F with Width-subtyping and Record Updating. In: Theoretical Aspects of Computer Software (TACS'97), Sendai, Japan. Lecture Notes In Computer Science, 1281. Springer LNCS pp. 439-457. ISBN 3-540-63388-X. (Full text available)

Preview +1 more...

Poll, Erik and Thompson, Simon (1998) Adding the axioms to Axiom: Towards a system of automated reasoning in Aldor. Technical report. Kent University (Full text available)

Preview Preview

Poll, Erik and Thompson, Simon (1999) The Type System of Aldor. Technical report. , Kent CT2 7NF, UK (Full text available)

Preview Preview

Printezis, Tony and Jones, Richard E. (2002) GCspy: An Adaptable Heap Visualisation Framework. In: Proceedings of OOPSLA'02 ACM Conference on Object-Oriented Systems, Languages and Applications. SIGPLAN Notices. ACM Press, Seattle, WA. pp. 343-358. ISBN 1581124711. (doi:https://doi.org/10.1145/582419.582451) (Full text available)

Preview

Printezis, Tony and Jones, Richard E. (2002) GCspy: An Adaptable Heap Visualisation Framework. Technical report. Computing Laboratory, UKC, Canterbury 1426. (doi:1426) (Full text available)

Preview Preview

R

Ramalho, Geber L. and Barros, Flavia and Cavalcante, Sergio and Cavalcanti, Ana L. C. (1999) Cyber Rally: An Experience of Democratic Use of the Internet. In: 8th International Conference on Human-Computer Interaction: Communication, Cooperation, and Application Design, 22-26 August 1999, Munich, Germany. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Ratnarajah, Nagulan and Simmons, Andy and Davydov, Oleg and Hojjatoleslami, Ali (2010) A Novel White Matter Fibre Tracking Algorithm Using Probabilistic Tractography and Average Curves. Medical Image Computing and Computer-Assisted Intervention, 6361 . pp. 666-673. ISSN 0302-9743. (doi:https://doi.org/10.1007/978-3-642-15705-9_81) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Reinke, Claus (2001) GHood -- Graphical Visualisation and Animation of Haskell Object Observations. In: Hinze, Ralf, ed. ACM Sigplan Haskell Workshop, Firenze, Italy. Electronic Notes in Theoretical Computer Science, 59. Elsevier Science (Full text available)

Preview Preview

Rizzo, Mike (1994) Using Producer and Consumer Manipulators to Extend Stream I/O Formatting in C++. Sigplan Notices, 29 (3). pp. 33-35. ISSN 0362-1340. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Roberts, Jonathan C. and Boukhelifa, Nadia and Rodgers, Peter (2002) Multiform Glyph Based Search Result Visualization. In: Proceeding of the Conference on Information Visualization 2002. IEEE pp. 549-554. (doi:https://doi.org/10.1109/IV.2002.1028828) (Full text available)

Preview

Rodgers, Peter (2000) Constructs for Programming with Graph Rewrites. In: Ehrig, Hartmut and Taentzer, Gabi, eds. GRATRA 2000: Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems. pp. 59-66. (Full text available)

Preview

Rodgers, Peter (2000) An XML Specification for Grrr Programs. In: University of Paderborn GT Exchange Formats. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Rodgers, Peter and Gaizauskas, Robert and Humphreys, Kevin and Cunningham, Hamish (1997) Visual Execution and Data Visualisation in Natural Language Processing. In: VL'97 IEEE Symposium on Visual Languages. VL. IEEE Computer Society pp. 342-347. ISBN 0-8186-8144-6. (Full text available)

Preview

Rodgers, Peter and King, P.J.H. (1997) A Graph Rewriting Visual Language for Database Programming. Journal of Visual Languages and Computing, 8 (6). pp. 641-674. ISSN 1045-926X. (doi:https://doi.org/10.1006/jvlc.1997.0033) (Full text available)

Preview

Rodgers, Peter and Vidal, Natalia (2000) A Demonstration of the Grrr Graph Rewriting Programming Language. In: Proceedings of Agtive99: Applications of Graph Transformations with Industrial Relevance. Lecture Notes In Computer Science (LNCS), 1779. Springer-Verlag pp. 473-480. (Full text available)

Preview

Rodgers, Peter and Vidal, Natalia (2000) Graph Algorithm Animation with Grrr. In: Agtive99: Applications of Graph Transformations with Industrial Relevance. Lecture Notes in Computer Science, 1779. Springer-Verlag pp. 379-394. (Full text available)

Preview

Rodgers, Peter and Vidal, Natalia (1999) Pragmatic Graph Rewriting Modifications. In: Proceedings of the 1999 IEEE Symposium on Visual Languages. IEEE Computer Society pp. 206-207. ISBN 0-7695-0216-4. (doi:https://doi.org/10.1109/VL.1999.795904) (Full text available)

Preview

Rodrigues, Helena C.C.D. and Jones, Richard E. (1997) Cyclic Distributed Garbage Collection with Group Merger. Technical report. University of Kent at Canterbury 17-97. (doi:17-97) (Full text available)

Preview Preview

Rodrigues, Helena C.C.D. and Jones, Richard E. (1998) Cyclic Distributed Garbage Collection with Group Merger. In: Jul, Eric, ed. Proceedings of 12th European Conference on Object-Oriented Programming, ECOOP98. Lecture Notes in Computer Science, 1445. Springer, Brussels pp. 249-273. ISBN 3-540-64737-6. (Full text available)

Preview Preview

Russell, Dan (2001) FAD: A Functional Analysis and Design Methodology. Doctor of Philosophy (PhD) thesis, Computing Laboratory, University of Kent at Canterbury. (Full text available)

Preview Preview

Ryder, Chris (2001) Iguana: A management support tool using Haskell and LDAP. Technical report. , University of Kent at Canterbury (Full text available)

Preview Preview

Ryder, Chris (2004) Software Measurement for Functional Programming. Doctor of Philosophy (PhD) thesis, Computing Lab, University of Kent. (Full text available)

Preview

Ryder, Chris and Thompson, Simon (1999) Aldor meets Haskell. Technical report. Computing Laboratory, University of Kent (Full text available)

Preview Preview

Ryder, Chris and Thompson, Simon (2005) Porting HaRe to the GHC API. Technical report. Computing Laboratory, University of Kent, University of Kent, Canterbury, Kent, UK (Full text available)

Preview

Ryder, Chris and Thompson, Simon (2005) Software Metrics: Measuring Haskell. In: UNSPECIFIED. (Full text available)

Preview

S

Sampaio, Augusto C.A. and Woodcock, Jim and Cavalcanti, Ana L. C. (2002) Refinement in Circus. In: Eriksson, Lars-Henrik and Lindsay, Peter A., eds. FME 2002: Formal Methods - Getting IT Right. Lecture Notes in Computer Science, 1. Springer-Verlag, Berlin pp. 451-470. ISBN 978-3-540-43928-8. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Sanches, R. and Sette, S.S. and Cavalcanti, Ana L. C. and Florissi, C. and Soares, Patricia G. and Melo, T.C.S (1987) A Language for a Relational Database Management System. In: 2nd Brazilian Symposium on Databases. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Sannella, Don and Tarlecki, Andrzej and Kahrs, Stefan (1994) Interfaces and Extended ML. SIGPLAN Notices, 29 (8). pp. 111-118. (Full text available)

Preview Preview

Schmitz, Patrick and Thompson, Simon and King, Peter (2003) Presentation Dynamism in XML. In: Twelfth International World Wide Web Conference. W3C, Budapest, Hungary (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Schneider, Steve A. and Bryans, Jeremy W. and Davies, Jim (1994) A Failures Semantics for ET-LOTOS. Technical report. , Presented at the COST 247 - WG 6.1 working group meeting in Brighton (Full text available)

Preview

Shen, Kish and Costa, Vitor Santos and King, Andy (1998) Distance: a New Metric for Controlling Granularity for Parallel Execution. In: Jaffar, Joxan, ed. Joint International Conference and Symposium for Logic Programming. MIT Press, pp. 85-99. ISBN 0-262-60031-5. (Full text available)

Preview

Sheriff, A. and Cavalcanti, Ana L. C. and Moura, Hermano (2002) An Action Semantics for Timed CSPm. In: Proceedings of the 6th Brazilian Symposium on Programming Languages. pp. 100-113. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Silva, Josep and Chitil, Olaf (2006) Combining Algorithmic Debugging and Program Slicing. In: Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming. Proceedings of the 8th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming. ACM Press, New York, New York (USA) pp. 157-166. ISBN 1-59593-388-3. (doi:https://doi.org/10.1145/1140335.1140355) (Full text available)

Preview

Simon, Axel and Chitil, Olaf and Huch, Frank (2000) Typeview: A Tool for Understanding Type Errors. In: Mohnen, Markus and Koopman, P., eds. Draft Proceedings of the 12th International Workshop on Implementation of Functional Languages. , Aachen, Germany pp. 63-69. (Full text available)

Preview

Simon, Axel and King, Andy (2002) Analyzing String Buffers in C. In: Kirchner, Hélène and Ringeissen, Christophe, eds. International Conference on Algebraic Methodology and Software Technology. Lecture Notes in Computer Science, 2422 . Springer, pp. 365-379. ISBN 3-540-44144-1. (doi:https://doi.org/10.1007/3-540-45719-4_25) (Full text available)

Preview

Simon, Axel and King, Andy and Howe, Jacob M. (2002) Two Variables per Linear Inequality as an Abstract Domain. In: Leuschel, Michael, ed. Logic Based Program Synthesis and Transformation. Lecture Notes in Computer Science, 2664 . Springer-Verlag, Berlin, pp. 71-89. ISBN 978-3-540-40438-5. (doi:https://doi.org/10.1007/3-540-45013-0_7) (Full text available)

Preview

Smart, Nigel P. (1996) How difficult is it to solve a Thue equation? In: Cohen, H., ed. Algorithmic Number Theory. Springer-Verlag Berlin pp. 363-373. ISBN 3-540-61581-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Smaus, Jan-Georg (1999) Modes and Types in Logic Programming. Doctor of Philosophy (PhD) thesis, University of Kent at Canterbury. (Full text available)

Preview Preview

Smaus, Jan-Georg (1999) Proving Termination of Input-Consuming Logic Programs. In: The 16th International Conference on Logic Programming 1999 (ICLP 99), Nov 29-Dec 04, 1999, Las Cruces, NM. (Full text available)

Preview Preview

Smaus, Jan-Georg (1999) Proving Termination of Input-Consuming Logic Programs. Technical report. , Kent, CT2 7NF, UK (Full text available)

Preview Preview

Smaus, Jan-Georg (1996) Resolution K-Transformations. Other masters thesis, Universitaet des Saarlandes (Max-Planck-Institut fuer Informatik). (Full text available)

Preview Preview

Smaus, Jan-Georg (1998) Well-Terminating, Input-Driven Logic Programs. Technical report. University of Kent (Full text available)

Preview Preview

Smaus, Jan-Georg and Hill, Pat and King, Andy (1999) Mode Analysis Domains for Typed Logic Programs. In: Bossi, Annalisa, ed. Logic Programming, Synthesis and Transformation. Lecture Notes in Computer Science, 1817 . Springer-Verlag, pp. 82-101. ISBN 3-540-67628-7. (Full text available)

Preview

Smaus, Jan-Georg and Hill, Pat and King, Andy (1998) Preventing Instantiation Errors and Loops for Logic Programs with Several Modes Using block Declarations. In: Flener, Pierre, ed. Logic Programming, Synthesis and Transformation. Lecture Notes in Computer Science, 1559 . Springer, pp. 182-196. ISBN 3-540-65765-7. (Full text available)

Preview

Smaus, Jan-Georg and Hill, Pat and King, Andy (1998) Termination of Logic Programs with block Declarations Running in Several Modes. In: Palamidessi, Catuscia, ed. International Symposium on Programming Languages: Implementations, Logics and Programs. Lecture Notes in Computer Science, 1490 . Springer-Verlag, see also http://www.springer.de/comp/lncs/index.html, pp. 182-196. ISBN 3-540-65012-1. (Full text available)

Preview

Smith, Graeme and Derrick, John (2002) Abstract Specification in Object-Z and CSP. In: George, Chris and Miao, Huaikou, eds. Formal Methods and Software Engineering. Lecture Notes in Computer Science, 2495. Springer, Berlin pp. 108-119. ISBN 3-540-00029-1. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Smith, Graeme and Derrick, John (2001) Specification, refinement and verification of concurrent systems - an integration of Object-Z and CSP. Formal Methods in System Design, 18 (3). pp. 249-284. ISSN 0925-9856. (doi:https://doi.org/10.1023/A:1011269103179) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Smith, Neil (1996) The UK national Web cache - The state of the art. In: Computer Networks and ISDN Systems. Elsevier Science BV, Amsterdam, Netherlands pp. 1407-1414. (doi:https://doi.org/10.1016/0169-7552(96)00029-3) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Soares, Patricia G. and Lins, Rafael D. (1992) Some Performance Figures for the G-Machine and its Optimisations. Technical report. Elsevier Science BV, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Stapleton, Gem and Howse, John and Taylor, John and Thompson, Simon (2004) The Expressiveness of Spider Diagrams Augmented with Constants. In: 2004 IEEE Symposium on Visual Languages / Human Centered Computing 2004. IEEE pp. 90-98. ISBN 0-7803-8696-5. (doi:https://doi.org/10.1109/VLHCC.2004.57) (Full text available)

Preview

Stapleton, Gem and Howse, John and Taylor, John and Thompson, Simon (2004) The Expressiveness of Spider Diagrams. Journal of Logic and Computation, 14 (6). pp. 857-880. ISSN 0955-792X. (doi:https://doi.org/10.1093/logcom/14.6.857) (Full text available)

Preview

Stapleton, Gem and Howse, John and Taylor, John and Thompson, Simon (2004) What Can Spider Diagrams Say? In: Blackwell, Alan and Marriott, Kim and Shimojima, Atsushi, eds. Diagrammatic Representation and Inference. Lecture Notes in Computer Science, 2980. Springer pp. 179-186. ISBN 3-540-21268-X. (doi:https://doi.org/10.1007/978-3-540-25931-2_12) (Full text available)

Preview

Stapleton, Gem and Taylor, John and Thompson, Simon and Howse, John (2009) The expressiveness of spider diagrams augmented with constants. Journal of Visual Languages and Computing, 20 . pp. 30-49. (doi:https://doi.org/10.1016/j.jvlc.2008.01.005) (Full text available)

Preview

Stapleton, Gem and Thompson, Simon and Fish, Andrew and Howse, John and Taylor, John (2005) A New Language for the Visualization of Logic and reasoning. In: Cox, Philip and Smedley, Trevor, eds. Proceedings of the 2005 International Workshop on Visual Languages and Computing. pp. 287-292. ISBN 1-891706-17-9. (Full text available)

Preview

Steen, Maarten (1998) Consistency and Composition of Process Specifications. Doctor of Philosophy (PhD) thesis, University of Kent at Canterbury. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Steen, Maarten and Bowman, Howard and Derrick, John (1995) Composition of LOTOS specifications. In: UNSPECIFIED. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Steen, Maarten and Bowman, Howard and Derrick, John and Boiten, Eerke Albert (1997) Disjunction of LOTOS specifications. In: Mizuno, Tadanori and Shiratori, Norio and Higashino, Teruo and Togashi, Atsushi, eds. Formal Description Techniques and Protocol Specification, Testing and Verification: FORTE X / PSTV XVII '97. Chapman & Hall, Osaka, Japan pp. 177-192. ISBN 0-412-82060-9. (Full text available)

Preview

Steen, Maarten and Derrick, John (1999) Applying the UML to the ODP Enterprise Viewpoint. Technical report. University of Kent at Canterbury (Full text available)

Preview Preview

Steen, Maarten and Derrick, John (1999) Formalising ODP Enterprise Policies. In: 3rd International Enterprise Distributed Object Computing Conference (EDOC '99). IEEE Publishing pp. 84-93. ISBN 0-7803-5784-1. (doi:https://doi.org/10.1109/EDOC.1999.792052) (Full text available)

Preview Preview

Steen, Maarten and Derrick, John (2000) ODP Enterprise Viewpoint Specification. Computer Standards and Interfaces, 22 (3). pp. 165-189. ISSN 0920-5489. (doi:https://doi.org/10.1016/S0920-5489(00)00031-3) (Full text available)

Preview

Steen, Maarten and Derrick, John and Boiten, Eerke Albert and Bowman, Howard (1999) Consistency of partial process specifications. In: Haeberer, A.M., ed. Algebraic Methodology and Software Technology (AMAST '98). http://dx.doi.org/10.1007/3-540-49253-4_19, 1548. Springer-Verlag Berlin pp. 248-262. ISBN 3-540-65462-3. (doi:https://doi.org/10.1007/3-540-49253-4_19) (Full text available)

Preview Preview

Stone, R.D and Morse, David R. (1996) A software development tool for parallel and distributed systems. In: Oneill, B.C. and Transputer User, Grp, eds. Parallel Processing Developments. I O S Press pp. 207-219. ISBN 90-5199-261-0. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Su, Li (2003) Verification of Concurrent Systems. Technical report. University of Kent, University of Kent, Canterbury, Kent, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Su, Li and Bowman, Howard and Wyble, Brad (2006) Formal Modeling of Connectionism using Concurrency Theory, an Approach Based on Automata and Model Checking. Technical report. UKC (Full text available)

Preview

Sultana, Nik (2008) Verification of Refactorings in Isabelle/HOL. Other masters thesis, Computing Laboratory, University of Kent. (Full text available)

Preview

Sultana, Nik and Thompson, Simon (2008) A Certified Refactoring Engine. In: Achten, P. and Koopman, P. and Morazán, M.T., eds. Draft Proceedings of the Ninth Symposium on Trends in Functional Programming (TFP). (Full text available)

Preview

Sultana, Nik and Thompson, Simon (2008) Mechanical Verification of Refactorings. In: Workshop on Partial Evaluation and Program Manipulation. Assoc of Computing Machinery, NY, USA ISBN 978-1-59593-977-7. (Full text available)

Preview

Swierstra, S. Doaitse and Chitil, Olaf (2009) Linear, bounded, functional pretty-printing. Journal of Functional Programming, 19 (01). pp. 1-16. ISSN 0956-7968. (doi:https://doi.org/10.1017/S0956796808006990) (Full text available)

Preview

T

Taylor, Chris (2000) Comparison of ODP Viewpoint Specifications: A Case Study. Technical report. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Taylor, Chris (1993) A Formal Logical Analysis of Causal Relations. Doctor of Philosophy (PhD) thesis, University of Sussex. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Taylor, Chris and Boiten, Eerke Albert and Derrick, John (2001) Interpreting ODP Viewpoint Specification: Observations from a Case Study. Technical report. UKC, University of Kent at Canterbury, UK (Full text available)

Preview Preview

Taylor, Chris and Boiten, Eerke Albert and Derrick, John (2002) Interpreting ODP viewpoint specifications: Observations from a Case Study. In: Jacobs, Bart and Rensink, Arend, eds. Formal Methods for Open Object-Based Distributed Systems V. IFIP International Federation for Information Processings, 5. Kluwer Academic Publishers, Dordrecht pp. 61-76. ISBN 978-0-7923-7683-5. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Taylor, Chris and Boiten, Eerke Albert and Derrick, John (2002) ODP computational-to-information viewpoint mappings: a translation of CORBA IDL to Z. IEE Proceedings: Software, 149 (2). pp. 57-64. ISSN 1462-5970. (doi:https://doi.org/10.1049/ip-sen:20020318) (Full text available)

Preview

Taylor, Chris and Derrick, John and Boiten, Eerke Albert (2000) A Case Study in Partial Specification: Consistency and Refinement for Object-Z. In: Formal Engineering Methods, 2000. ICFEM 2000. Third IEEE International Conference on. IEEE pp. 177-185. ISBN 0-7695-0822-7. (doi:https://doi.org/10.1109/ICFEM.2000.873818) (Full text available)

Preview

Telford, Alastair J. (1995) Static Analysis of Martin-L''of's Intuitionistic Type Theory. Doctor of Philosophy (PhD) thesis, The Computing Laboratory, University of Kent at Canterbury. (Full text available)

Preview Preview

Telford, Alastair J. and Johnson, Christopher W. (1996) Cross-viewpoint Consistency in Accident Investigations. Technical report. Department of Computer Science, University of Glasgow, Glasgow (Full text available)

Preview Preview

Telford, Alastair J. and Thompson, Simon (1996) Abstract Interpretation of Constructive Type Theory. Technical report. UKC, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Telford, Alastair J. and Turner, David A. (1997) Ensuring Streams Flow. In: Johnson, Michael, ed. Algebraic Methodology and Software Technology, 6th International Conference, AMAST '97, Sydney Australia, December 1997. Lecture Notes in Computer Science, 1349. Springer-Verlag pp. 509-523. ISBN 3-540-63888-1. (Full text available)

Preview Preview

Telford, Alastair J. and Turner, David A. (1999) Ensuring Termination in ESFP. In: 15th British Colloquium in Theoretical Computer Science. , Keele (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Telford, Alastair J. and Turner, David A. (1997) Ensuring the Productivity of Infinite Structures. Technical report. University of Kent, Canterbury, Kent, CT2 7NF, UK (Full text available)

Preview +1 more...

Telford, Alastair J. and Turner, David A. (2000) A Hierarchy of Languages with Strong Termination Properties. Technical report. University of Kent, The Computing Laboratory, The University, Canterbury, Kent, CT2 7NF (Full text available)

Preview

Thomas, M. and Kirkwood, C. and Matthews, Brian and Watson, Phil (1993) Verification techniques for LOTOS: final report. Technical report. Department of Computing Science, University of Glasgow (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thomas, Muffy and Watson, Phil (1991) Generalising diverging sequences of rewrite rules by synthesising new sorts. In: Jones, Simon L. Peyton and Hutton, Graham and Holst, Carsten Kehler, eds. Functional Programming, Glasgow 1990, Proceedings of the 1990 Glasgow Workshop on Functional Programming. Workshops in Computing. Springer Verlag pp. 268-273. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thomas, Muffy and Watson, Phil (1992) Solving divergence in Knuth-Bendix completion by enriching signatures. In: Nivat, M. and Rattray, Charles and Rus, Teodor and Scollo, G., eds. Algebraic Methodology and Software Technology, Proceedings of the 2nd International Conference, Iowa City, U.S.A., 1991. Workshops in Computing. Springer Verlag pp. 377-390. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thomas, Muffy and Watson, Phil (1993) Solving divergence in Knuth-Bendix completion by enriching signatures. Theoretical Computer Science, 112 . pp. 145-185. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thomas, Stephen P. (1993) The Pragmatics of Closure Reduction. Doctor of Philosophy (PhD) thesis, University of Kent at Canterbury. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thomas, Stephen P. and Jones, Richard E. (1994) Garbage Collecting Shared Environment Closure Reducers. Technical report. Computing Laboratory, University of Kent at Canterbury https://doi.org/10.1016/0020-0190(95)00131-U. (doi:https://doi.org/10.1016/0020-0190(95)00131-U) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thompson, Simon (1992) Are subsets necessary in Martin-Lof type theory? In: Myers Jr, J.P. and O'Donnell, M.J., eds. Lecture Notes in Computer Science. Lecture Notes in Computer Science, 613. Springer-Verlag pp. 46-57. ISBN 3-540-55631-1. (Full text available)

Preview Preview

Thompson, Simon (1997) Constructive interval temporal logic in Alf. In: Barringer, Howard, ed. International Conference on Temporal Logic. Applied Logic. Kluwer pp. 377-390. (Full text available)

Preview Preview

Thompson, Simon (1992) Formulating Haskell. Technical report. University of Kent, Canterbury, UK (Full text available)

Preview Preview

Thompson, Simon (1998) A Functional Reactive Animation of a Lift using Fran. Technical report. Cambridge University Press (Full text available)

Preview Preview

Thompson, Simon (1996) Haskell: The Craft of Functional Programming. Addison Wesley ISBN 0-201-40357-9. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thompson, Simon (1999) Haskell: the Craft of Functional Programming. International Computer Science Series . Addison-Wesley, Harlow, UK ISBN 0-201-34275-8. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thompson, Simon (1997) Higher-order + Polymorphic = Reusable. Other. University of Kent (Unpublished) (Full text available)

+1 more...

Thompson, Simon (1987) Interactive Functional Programs: a Method and a Formal Semantics. Technical report. Computing Laboratory, University of Kent, Canterbury, UK (Full text available)

Preview

Thompson, Simon (2001) Logic and Dependent Types in the Aldor Computer Algebra System. In: Kerber, Manfred and Kohlhase, Michael, eds. Symbolic Computation and Automated Reasoning. A K Peters pp. 205-219. ISBN 1-56881-145-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thompson, Simon (1989) A Logic for Miranda. Formal Aspects of Computing, (1). (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thompson, Simon (1995) A Logic for Miranda, Revisited. Formal Aspects of Computing, (7). (Full text available)

Preview Preview

Thompson, Simon (1995) Miranda: The Craft of Functional Programming. Addison Wesley ISBN 0-201-42279-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thompson, Simon (1995) Programming Language Semantics using Miranda. Technical report. UKC, University of Kent, Canterbury, UK (Full text available)

Preview Preview

Thompson, Simon (1999) Proof. In: Hammond, Kevin and Michaelson, Greg, eds. Research Directions in Parallel Functional Programming. Springer Verlag, pp. 93-119. ISBN 1-85233-092-9. (Full text available)

Preview

Thompson, Simon (1986) Proving properties of functions defined on lawful types. Technical report. Computing Laboratory, University of Kent, University of Kent, Canterbury, UK (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thompson, Simon (2004) Refactoring Functional Programs. In: Vene, Varmo and Uustalu, Tarmo, eds. Advanced Functional Programming: 5th International School, AFP 2004, Tartu, Estonia, August 14-21, 2004. Lecture Notes in Computer Science, LNCS 3. Springer Verlag, Berlin pp. 331-357. ISBN 3-540-28540-7. (Full text available)

Preview

Thompson, Simon (2000) Regular Expressions and Automata using Haskell. Technical report. University of Kent (Full text available)

Preview Preview

Thompson, Simon (1995) Regular Expressions and Automata using Miranda. Other. UKC (Unpublished) (Full text available)

Preview Preview

Thompson, Simon (1991) Type Theory and Functional Programming. Addison Wesley ISBN 0-201-41667-0. (Full text available)

Preview

Thompson, Simon (1997) em Where do I begin? A problem solving approach to teaching functional programming. In: Apt, Krzysztof and Hartel, Pieter H. and Klint, Paul, eds. First International Conference on Declarative Programming Languages in Education. Springer-Verlag (Full text available)

Preview +1 more...

Thompson, Simon and King, Peter (2007) Declarative Extensions of XML Languages. Technical report. University of Kent, Canterbury, Kent (Full text available)

Preview

Thompson, Simon and King, Peter and Schmitz, Patrick (2007) Declarative extensions of XML languages. In: King, Peter and Simske, Steven, eds. Proceedings of the 2007 ACM symposium on Document engineering. ACM Press pp. 89-91. ISBN 978-1-59593-776-6. (Full text available)

Preview

Thompson, Simon and Reinke, Claus (2003) A Case Study in Refactoring Functional Programs. In: Ierusalimschy, Roberto and Figueiredo, Lucilia and Valente, Marcio Tulio, eds. VII Brazilian Symposium on Programming Languages. pp. 1-16. ISBN 85-88442-45-0. (Full text available)

Preview

Thompson, Simon and Reinke, Claus (2001) Refactoring Functional Programs. Technical report. Computing Laboratory, University of Kent, Canterbury, Kent (Full text available)

Preview

W

Walczowski, Les T. and Jastrzebski, Adam K. and Barnaby, J.E. (1994) A Multi- Mode System for Gaas Circuis. In: 1994 IEEE International Symposium on Circus and Systems, VOL 1 - Computer Aided Design (CAD). I E E E A427-A430. ISBN 0-7803-1915-X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Wallace, Malcolm and Chitil, Olaf and Brehm, Thorsten and Runciman, Colin (2001) Multiple-View Tracing for Haskell: a New Hat. In: 2001 ACM SIGPLAN Haskell Workshop. (Full text available)

Preview

Waller, Winston A.J. and Aziz, S.M. (1994) A C-Testable Parallel Multipler Using Differencial Casecode Voltage Swish (DCVS) Logic. In: Yanagawa, T. and Ivey, P.A., eds. VLSI 93. Elsevier Science Publ B V pp. 133-142. ISBN 0-444-89911-1. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, P.R. (1988) Concerning T-degrees of d-r.e. sets and e-reducibility of Sigma<sub>2</sub> sets. Doctor of Philosophy (PhD) thesis, University of Kent, Canterbury. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1997) Embeddings in the strong reducibilities between 1 and npm. Mathematical Logic Quarterly, 43 (4). pp. 559-568. ISSN 0942-5616. (doi:https://doi.org/10.1002/malq.19970430411) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Inductive Learning with Corroboration. In: Algorithmic Learning Theory, Proceedings of the 10th International Conference, Dec 06-08, 1999, Tokyo, Japan. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1995) Inductive learning of recurrence-term languages from positive data. In: Jantke, Klaus P. and Lange, Steffen, eds. Algorithmic learning for knowledge-based systems. Lecture Notes in Artificial Intelligence, 961 . Springer Verlag, pp. 292-315. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Inductive learning with corroboration. Technical report. (Full text available)

Preview Preview

Watson, Phil (1990) On restricted forms of enumeration reducibility. Annals of Pure and Applied Logic, 49 . pp. 75-96. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of "Generalization and specialization strategies for learning r.e. languages". Review of: Generalization and specialization strategies for learning r.e. languages by Jain, Sanjay and Sharma, Arun. Mathematical Reviews, (99m:68). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of "Learning with refutation". Review of: Learning with refutation by Jain, Sanjay. Mathematical Reviews, (99m:68). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of 'Approximation methods in inductive inference'. Review of: Approximation methods in inductive inference by Moser, W.R.. Mathematical Reviews, (99g:68). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of 'Learning via queries and oracles'. Review of: Learning via queries and oracles by Stephan, Frank. Mathematical Reviews, (99f:03). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of 'On the relative sizes of learnable sets'. Review of: On the relative sizes of learnable sets' by Fortnow, Lance and Freivalds, Rusins and Gasarch, William I. and Kumme, Martin and Kurtz, Stuart A. and Smith, Carl H. and Stephan, Frank. Mathematical Reviews, (99c:68). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (1999) Review of 'The structure of intrinsic complexity of learning'. Review of: The structure of intrinsic complexity of learning by Jain, Sanjay and Sharma, Arun. Mathematical Reviews, (99k:03). (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (2000) Review of Aizenstein, H. et al, `On learning read-k-satisfy-j DNF'. Mathematical Reviews, (2000a:). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (2000) Review of Ambainis A. et al, `Ordinal mind change complexity of language identification'. Mathematical Reviews, (2000e:). (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (2000) Review of Case J., `The power of vacillation in language learning'. Mathematical Reviews, (2000e:). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil (2000) Review of Schaefer M., `A guided tour of minimal indices and shortest descriptions'. Mathematical Reviews, (2000b:). ISSN 0025-5629. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Watson, Phil and Dick, A.J.J. (1989) Least sorts in order-sorted term rewriting. Technical report. British Computer Society https://doi.org/10.1093/comjnl/34.1.16. (doi:https://doi.org/10.1093/comjnl/34.1.16) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Welch, Peter H. and Wood, David C. (1997) Higher levels of process synchronisation. In: Bakkers, A.W.P., ed. Parallel Programming and Java. Concurrent Systems Engineering Series, 50 . I O S Press, pp. 104-129. ISBN 90-5199-336-6. (Full text available)

Preview

Wilson, Eve (1994) Using Corpora as a Resource in Language Teaching. In: Computers and Education. Elsevier pp. 41-51. (doi:https://doi.org/10.1016/0360-1315(94)90031-0) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Woodcock, Jim and Cavalcanti, Ana L. C. (2002) The Semantics of Circus. In: ZB 2002: Formal Specification and Development in Z and B. Lecture Notes in Computer Science, 1. Springer-Verlag, Berlin pp. 184-203. ISBN 978-3-540-43166-4. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Z

Zammit, Vincent (1997) A Comparative Study of Coq and HOL. In: Gunter, Elsa. L and Felty, Amy, eds. Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs'97, Murray Hill, NJ, USA. Lecture Notes in Computer Science, 1275. Springer pp. 323-337. ISBN 3-540-63379-0. (Full text available)

Preview Preview

Zammit, Vincent (1996) A Mechanisation of Computability Theory in HOL. In: von Wright, Joakim and Grundy, Jim and Harrison, John, eds. Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science, 1125. Springer-Verlag, Turku, Finland pp. 431-446. ISBN 3-540-61587-3. (Full text available)

Preview Preview

Zammit, Vincent (1999) On the Readability of Machine Checkable Formal Proofs. Doctor of Philosophy (PhD) thesis, UNSPECIFIED. (Full text available)

Preview Preview

Zammit, Vincent (1997) A Proof of the S-m-n theorem in Coq. Technical report. University of Kent, The University of Kent, Canterbury, Kent, UK (Full text available)

Preview Preview