Items where division is "Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group"

UNSPECIFIED (1997) FMOODS'97, IFIP TC6 WG6.1 International Conference on Formal Methods for Open Object-based Distributed Systems. In: UNSPECIFIED. The full text of this publication is not available from this repository.

UNSPECIFIED (2008) Implementation and Application of Functional Languages: 19th International Workshop, IFL 2007, Freiburg, Germany, September 27-29, 2007. Revised Selected Papers. In: UNSPECIFIED. The full text of this publication is not available from this repository.

UNSPECIFIED (1998) Proceedings of the First International Symposium on Memory Management. In: UNSPECIFIED. The full text of this publication is not available from this repository.

Aichernig, B. and Boiten, E.A. and Derrick, J. and Groves, L. (2007) Preface: Proceedings of the 11th BCS-FACS Refinement Workshop, Macao, 2006. Electronic Notes in Theoretical Computer Science, 187 . p. 1. ISSN 1571-0661. The full text of this publication is not available from this repository.

Aichernig, B. and Boiten, E.A. and Butler, M. and Derrick, J. and Groves, L. (2009) Preface: Special Issue on REFINE 2006. Formal Aspects of Computing, 21 (1-2). ISSN 0934-5043. The full text of this publication is not available from this repository.

Akehurst, D.H. and Bordbar, B. and Derrick, J. and Waters, A.G. (2002) Design Support for Distributed Systems: DSE4DS. In: Procedings of the 7th Cabernet Radicals Workshop, 13-16 October 2002, Bertinoro, Italy.

Preview

Akehurst, D.H. and Bowman, H. and Bryans, J.W. and Derrick, J. (2000) A Manual for a ModelChecker for Stochastic Automata. Technical report.

Preview

Akehurst, D.H. and Derrick, J. and Waters, A.G. (2003) Design and Verification of Distributed Multi-media Systems. In: FMOODS 2003 - 6th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, NOV 19-21, 2003, PARIS, FRANCE.

Preview

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

Preview Preview

Anzellotti, G. and Battiti, R. and Lazzizzera, I. and Soncini, G. and Zorat, A. and Sartori, A. and Tecchiolli, G. and Lee, P. (1995) Totem - a Highly Parallel Chip for Ttiggering Apllications with Inductive Learning Based on the Reactive Tabu Search. In: 4th International Workshop on Software Engineering, Artificial Intelligence, and Expert Systems for High Energy and Nuclear Physics (AIHENP 95), Pisa, Italy. The full text of this publication is not available from this repository.

Arts, T. and Earle, C.B. and Derrick, J. (2003) Development of a Verified Erlang Program for Resource Locking. Software Tools for Technology Transfer (STTT), 5 (2). pp. 205-220. ISSN 1433-2779 . The full text of this publication is not available from this repository.

Arts, T. and Earle, C.B. and Derrick, J. (2002) Verifying Erlang code: a resource locker case-study. In: In Proc. Formal Methods Europe: Getting IT Right, Copenhagen, Denmark. The full text of this publication is not available from this repository.

Arts, Thomas and Earle, Clara Benac and Penas, Juan José Sánchez (2004) Translating Erlang to muCRL. In: Proceedings of the International Conference on Application of Concurrency to System Design (ACSD2004), JUN 16-18, 2004, Hamilton, Canada.

Preview Preview

Asveld, P.R.J. and Boiten, E.A. (1986) A Generator for Turing Machine Simulation Programs - user's manual. Technical report. Universiteit Twente The full text of this publication is not available from this repository.

Augusto, Juan Carlos and Gomez, R.S. (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 available from this repository.

Barnes, David J. and Hopkins, Tim (2000) The evolution and testing of a medium sized numerical package. In: International Workshop on Modern Software Tools for Scientific Computing (SciTools 98), Oslo, Norway. The full text of this publication is not available from this repository.

Barnes, David J. and Fincher, Sally and Thompson, Simon (1997) Introductory Problem Solving in Computer Science. In: 5th Annual Conference on the Teaching of Computing.

Preview

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

Preview Preview

Bassett, E.E. and Brooks, S.P. and Morgan, B.J.T. (1994) Minitab Macros for Mutivariate-Analysis. Computational Statistics & Data Analysis, 17 (1). pp. 100-101. ISSN 0167-9473. The full text of this publication is not available from this repository.

Battiti, R. and Lee, P. and Sartori, A. and Tecchiolli, G. (1995) Special-purpose parallel architectures for high-performance machine learning. In: International Conference and Exhibition on High-Performance Computing and Networking, Milan, Italy. The full text of this publication is not available from this repository.

Beckett, C. (1995) Combined Log System. In: 3rd International World-Wide Web Conference, Darmstadt, Germany.

Preview

Beezer, A.E and Mitchell, J.C and Colegate, R.M and Scally, D.J and Twyman, L.J and Willson, R.J (1995) Microcalorimetry in the Screening of Discovery Compounds and in the Investigation of Novel Drug-Delivery systems. In: 9th Conference of the International-Society-for-Biological-Calorimetry, Berlin-Schmerwitz, Germany. The full text of this publication is not available from this repository.

Benoy, F. and King, A. (1999) An Isomorphism between Abstract Polyhedral Cones and Definite Boolean Functions. Technical report. , University of Kent

Preview Preview

Benoy, Florence and King, A. and Mesnard, F. (2002) Computing Convex Hulls with a Linear Solver. Technical report. Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK.

Preview Preview

Benoy, Florence and King, Andy (1997) Inferring Argument Size Relationships with CLP(R). In: Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation. Lecture Notes in Computer Science, 1207. Springer-Verlag pp. 204-223. ISBN 3-540-62718-9 .

Preview Preview

Blackburn, Stephen M. and Jones, Richard and McKinley, Kathryn S. and Moss, J.Eliot B. (2002) Beltway: Getting Around Garbage Collection Gridlock. In: Hendren, Laurie J., ed. Conference on Programming Language Design and Implementation archive. Association for Computing Machinery, Berlin pp. 153-164. ISBN 1-58113-463-0.

Preview Preview

Blair, G.S. and Blair, L. and Bowman, H. and Chetwynd, A.G. (1997) Formal Specification of Distributed Multimedia Systems. University College London Press, 352 pp. ISBN 1-85728-677-4 PB. The full text of this publication is not available from this repository.

Blair, L. and Blair, G.S. and Bowman, H. and Chetwynd, A.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 available from this repository.

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 available from this repository.

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, Oct 11-14, 1998, San Diego, CA, . The full text of this publication is not available from this repository.

Boiten, E.A. (2003) Book review: Concepts in Programming Languages, by John Mitchell. Journal of Functional Programming, 13 (6). pp. 1087-1088. ISSN 0956-7968. The full text of this publication is not available from this repository.

Boiten, E.A. (1988) Een Syntax Assisted Editor. Other masters thesis, Universiteit Twente. The full text of this publication is not available from this repository.

Boiten, E.A. (1990) Factorisation of the Factorial -- an algorithm discovered by playing with transformations. Technical report. The full text of this publication is not available from this repository.

Boiten, E.A. (1992) Factorisation of the Factorial -- an example of inverting the flow of computation. Periodica Polytechnica Ser. El. Eng, 35 (2). pp. 77-99. The full text of this publication is not available from this repository.

Boiten, E.A. (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 available from this repository.

Boiten, E.A. (1991) Intersections of Bags and Sets of Extended Substructures -- a Class of Problems. In: UNSPECIFIED. The full text of this publication is not available from this repository.

Boiten, E.A. (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 available from this repository.

Boiten, E.A. (1989) Inverting the Flow of Computation in Tree-like Recursive Functions. In: UNSPECIFIED. The full text of this publication is not available from this repository.

Boiten, E.A. (1993) Parsing in ISBES. In: UNSPECIFIED. The full text of this publication is not available from this repository.

Boiten, E.A. (1992) Views of Formal Program Development. Doctor of Philosophy (Ph.D.) thesis, University of Nijmegen, Faculty of Mathematics and Informatics. The full text of this publication is not available from this repository.

Boiten, E.A. and Bowman, H. and Derrick, J. and Linington, P.F. and Steen, M.W.A. (2000) Viewpoint Consistency in ODP. Computer Networks, 34 (3). pp. 503-537. ISSN 1389-1286 . The full text of this publication is not available from this repository.

Boiten, E.A. and Derrick, J. (2000) Liberating data refinement. In: Backhouse, R.C. and Oliveira, J.N., eds. Proceedings of the 5th International Conference on Mathematics of Program Construction. Lecture Notes in Computer Science, 1837. Springer pp. 144-166. ISBN 3-540-67727-5. The full text of this publication is not available from this repository.

Boiten, E.A. and Derrick, J. (2009) Modelling divergence in Relational Concurrent Refinement. In: IFM 2009: Integrated Formal Methods. The full text of this publication is not available from this repository.

Boiten, E.A. and Derrick, J. (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 available from this repository.

Boiten, E.A. and Derrick, J. and Bowman, H. and Steen, M. (1997) Coupling schemas: data refinement and view(point) composition. In: Northern formal methods, 1997; Jul, Ilkley. The full text of this publication is not available from this repository.

Boiten, E.A. and Derrick, J. and Schellhorn, G. (2007) Relational Concurrent Refinement II: Internal Operations and Outputs. Formal Aspects of Computing, online . ISSN 0934-5043. The full text of this publication is not available from this repository.

Boiten, E.A. and Derrick, J. and Smith, G. (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 available from this repository.

Boiten, E.A. and Geerling, A.M. and Partsch, H.A. (1993) Transformational derivation of (parallel) programs using skeletons. In: UNSPECIFIED. The full text of this publication is not available from this repository.

Boiten, Eerke (2002) Loose Specification and Refinement in Z. In: Bert, D. and Bowen, J.P. and Henson, M.C. and Robinson, K., eds. ZB 2002:Formal Specification and Development in Z and B. Lecture Notes in Computer Science, 2272. Springer, Grenoble, France pp. 226-241. ISBN 3-540-43166-7. The full text of this publication is not available from this repository.

Boiten, Eerke and Grundy, Dan (2008) Reduction and refinement. Electronic Notes in Theoretical Computer Science, 201C . pp. 31-44. ISSN 1571-0661. The full text of this publication is not available from this repository.

Boiten, E. (1997) Z Unification Tools in Generic Formaliser. Technical report. University of Kent at Canterbury

Preview Preview

Boiten, E. and Bowman, H. and Derrick, J. and Steen, M. (1996) Issues in multiparadigm viewpoint specification. In: UNSPECIFIED.

Preview Preview

Boiten, E. and Bowman, H. and Derrick, J. and Steen, M. (1997) Viewpoint consistency in Z and LOTOS: A case study. In: UNSPECIFIED.

Preview +1 more...

Boiten, E. and Derrick, J. and Bowman, H. and Steen, M. (1996) Consistency and refinement for partial specification in Z. In: UNSPECIFIED.

Preview Preview

Boiten, E. and Derrick, J. and Bowman, H. and Steen, M. (1995) Unification and multiple views of data in Z. In: UNSPECIFIED.

Preview Preview

Boiten, E.A. (2008) From ABZ to cryptography (abstract). In: UNSPECIFIED. The full text of this publication is not available from this repository.

Boiten, E.A. (2002) Mathematics of Program Construction: Sixth International Conference. In: 6th International Conference on Mathematics of Program Construction, 27-28 May 2004, Ede, The Netherlands. The full text of this publication is not available from this repository.

Boiten, E.A. (2002) REFINE 2002: The BCS FACS Refinement Workshop. In: Derrick, J. and Boiten, E.A. and Woodcock, J.C.P. and von Wright, J., eds. REFINE 2002, The BCS FACS Refinement Workshop (Satellite Eventof FLoC 2002). Electronic Notes in Theoretical Computer Science, 70. Elsevier Science Publishers The full text of this publication is not available from this repository.

Boiten, E.A. (1991) Solving a combinatorial problem by transformation of abstract data types. In: Computing Science in the Netherlands 1991.

Preview Preview

Boiten, E.A. (1991) The many disguises of accumulation. Technical report. Dept. of Informatics, University of Nijmegen

Preview Preview

Boiten, E.A. and Bowman, H. and Derrick, J. and Steen, M. (1995) Cross Viewpoint Consistency in Open Distributed Processing (Intra language consistency). Technical report. UKC, University of Kent, Canterbury, UK

Preview Preview

Boiten, E.A. 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. The full text of this publication is not available from this repository.

Boiten, E.A. and Derrick, J. (2005) Formal Program Development with Approximations. In: UNSPECIFIED.

Preview

Boiten, E.A. and Derrick, J. (1998) Grey Box Data Refinement. In: International Refinement Workshop & Formal Methods Pacific '98, 1998; Sep, Canberra, Australia.

Preview

Boiten, E.A. and Derrick, J. (1998) IO - refinement in Z. In: Evans, A. and Duke, D. and Clark, T., eds. 3rd Northern Formal MethodsWorkshop, 1998. Electronic Workshops in Computing. Springer Verlag ISBN 1-902505-14-X.

Preview

Boiten, E.A. and Derrick, J. (2002) Integration of Specifications through Development Relations. In: Proceedings of IDPT: the Sixth Biennial World Conference on Integrated Design and Process Technology, 23-28th June 2002, Passadena, California. The full text of this publication is not available from this repository.

Boiten, E.A. and Derrick, J. (2002) Unifying concurrent and relational refinement. Electronic notes in theoretical computing, 70 (3). pp. 94-131. ISSN 1571-0661. The full text of this publication is not available from this repository.

Boiten, E.A. and Derrick, J. and Schellhorn, G. (2008) Preface: REFINE 2008 Proceedings. Electronic Notes in Theoretical Computer Science, 214 . ISSN 1571-0661. The full text of this publication is not available from this repository.

Boiten, E.A. and Derrick, J. and Smith, G. (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 available from this repository.

Boiten, E.A. and Derrick, J. and Smith, G. (2007) Refine 2007 Participants' Proceedings. Technical report. University of Kent, Canterbury, Canterbury, Kent The full text of this publication is not available from this repository.

Boiten, E.A. and Hoogendijk, P.F. (1996) Nested collections and polytypism. Technical report. Department of Computing Science, Eindhoven University

Preview Preview

Boiten, E.A. 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 available from this repository.

Boiten, E.A. 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 Ser. El. Eng., 35 (2). pp. 101-123. The full text of this publication is not available from this repository.

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

Preview Preview

Boiten, Eerke (2002) Integrating Specifications: Development Relations and Correspondences. In: Ehrig, Hartmut and Grosse-Rhode, Martin, eds. Integration of software specification techniques. International workshop No2, Grenoble , FRANCE. INIST-CNRS p. 8.

Preview Preview

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

Preview Preview

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

Preview Preview

Bolognesi, T. and Derrick, J. (1998) Constraint-oriented style for object-oriented formal specification. IEE Proceedings Software, 145 (2-3). pp. 61-69. ISSN 1462-5970. The full text of this publication is not available from this repository.

Bordbar, B. (1998) Weakly almost period functions on N with a negative base. J Lond Math Soc (57). pp. 706-720. The full text of this publication is not available from this repository.

Bordbar, B. 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. The full text of this publication is not available from this repository.

Bordbar, Behzad and Giacomini, L. and Holding, D.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. The full text of this publication is not available from this repository.

Bordbar, B. and Derrick, J. and Waters, G. (2003) A UML approach to the design of open distributed systems. In: Formal Methods and Software Engineering, October 21–25, 2002 , Shanghai, China. The full text of this publication is not available from this repository.

Bordbar, B. and Derrick, J. and Waters, G. (2002) Using UML to specify QoS constraints in ODP. Computer Networks, 40 (2). pp. 279-304. ISSN 1389-1286 . The full text of this publication is not available from this repository.

Bordbar, B. and Giacomini, L. and Holding, D.J. (2000) Hybrid Control Systems: a Design Case Study. In: Control Applications, 2000. Proceedings of the 2000 IEEE International Conference on. IEEE, Alaska, USA pp. 947-952. ISBN 0-7803-6562-3.

Preview

Bordbar, B. and Pym, J.S. (2000) The Set of Idempotents in the Weakly Almost Periodic Compactification of the Integers is not Closed. Trans Amer Math Soc, 352 (2). pp. 823-842. ISSN 1088-6850(e), 0002-9947(p).

Preview

Bordbar, Behzad and Giacomini, L. and Holding, D.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, 28 March 2000, London, UK, .

Preview

Bordbar, Behzad and Giacomini, L. and Holding, D.J. (2000) Design of Distributed Manufacturing Systems using UML and Petri Nets. In: Algorithms and Architectures for Real-Time Control (AARTC 2000). Workshop on Algorithms and Architectures for Real-Time Control. Elsevier, Palma de Mallorca, Spain pp. 105-110. ISBN 0-08-043685-4 .

Preview

Bordbar, Behzad and Giacomini, L. and Holding, D.J. (2000) UML and Petri Nets for Design and Analysis of Distributed Systems. In: Control Applications, 2000. Proceedings of the 2000 IEEE International Conference on. IEEE, Alaska, USA pp. 610-615. ISBN 0-7803-6562-3.

Preview

Bovey, J.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 available from this repository.

Bowman, H. and Derrick, J. 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 available from this repository.

Bowman, H. and Blair, L. and Blair, G.S. and Chetwynd, A.G. (1994) A Formal Description Technique Supporting Expression of Quality of Service and Media Synchronisation. In: Multimedia Transport and Teleservices, International COST 237 Workshop. The full text of this publication is not available from this repository.

Bowman, H. and Boiten, E.A. and Derrick, J. and Steen, M.W.A. (1999) Strategies for consistency checking based on unification. Science of Computer Programming, 33 (3). pp. 261-298. ISSN 0167-6423. The full text of this publication is not available from this repository.

Bowman, H. and Bryans, J.W. and Derrick, J. (2001) Analysis of a Multimedia Stream using Stochastic Process Algebra. The Computer Journal, 44 (4). pp. 230-245. ISSN 0010-4620 . The full text of this publication is not available from this repository.

Bowman, H. and Bryans, J.W. and Derrick, J. (2000) Towards Stochastic Model Checking with Generalised Distributions. In: UKPEW 2000, 16th United Kingdom Performance Engineering Workshop, July 24-25, 2000, Durham Univ. uk, . The full text of this publication is not available from this repository.

Bowman, H. and Cameron, H. and King, P. and Thompson, S.J. (2003) Mexitl: Multimedia in Executable Interval Temporal Logic. Formal Methods in System Design, 22 (1). pp. 5-38. ISSN 0925-9856 . The full text of this publication is not available from this repository.

Bowman, H. and Derrick, J. (1999) A Junction between State Based and Behavioural Specification. In: Formal Methods for Open Object-based Distributed Systems. The full text of this publication is not available from this repository.

Bowman, H. and Derrick, J. (1995) A True Concurrency Semantics for Quality of Service Specification and Validation. In: MMNet'95, International Conference on Multimedia and Networking. The full text of this publication is not available from this repository.

Bowman, H. and Derrick, J. 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. The full text of this publication is not available from this repository.

Bowman, H. and Faconti, G. (1999) Analysing Cognitive Behaviour using LOTOS and Mexitl. Formal Aspects of Computing, 11 (2). pp. 132-159. The full text of this publication is not available from this repository.

Bowman, H. and Gomez, R.S. (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 available from this repository.

Bowman, H. and Thompson, S.J. (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 available from this repository.

Bowman, H. (1998) A LOTOS Based Tutorial on Formal Methods for Object Oriented Distributed Systems. New Generation Computing, 16 (4). pp. 343-372. ISSN 0288-3635 . The full text of this publication is not available from this repository.

Bowman, H. (1998) An Interpretation of Cognitive Theory in Concurrency Theory. Technical report. University of Kent

Preview

Bowman, H. (2001) Formal Methods Elsewhere. Electronic Notes in Theoretical Computer Science, 43 . 162-163 . ISSN 1571-0661. The full text of this publication is not available from this repository.

Bowman, H. (1999) Modelling Concurrent Cognitive Architectures Using Process Calculi. In: European Conference on Cognitive Science 1999, 27th-30th October 1999, Siena, Italy.

Preview Preview

Bowman, H. (1999) Modelling Timeouts without Timelocks. In: Formal Methods for Real-Time and Probabilistic Systems. Lecture Notes in Computer Science, 1601. Springer-Verlag pp. 334-354.

Preview Preview

Bowman, H. (1999) On Time and Action Lock Free Description of Timed Systems. Technical report.

Preview Preview

Bowman, H. (2001) Time and Action Lock Freedom Properties of Timed Automata. In: Formal Techniques for Networked and Distributed Systems. The full text of this publication is not available from this repository.

Bowman, H. and Blair, G.S and Blair, L. and Chetwynd, A.G. (1995) Formal description of distributed multimedia systems: An assessment of potential techniques. Computer Communications, 18 (12). pp. 964-977. ISSN 0140-3664. The full text of this publication is not available from this repository.

Bowman, H. and Blair, G.S and Blair, L. and Chetwynd, A.G. (1993) Time Versus Abstraction In Formal Description. In: FORTE 93 - IFIP 6th International Conference on Formal Description Techniques, Boston, Ma. The full text of this publication is not available from this repository.

Bowman, H. and Boiten, E. and Derrick, J. and Steen, M. (1996) Viewpoint consistency in ODP, a general interpretation. In: UNSPECIFIED.

Preview Preview

Bowman, H. and Boiten, E.A. and Derrick, J. and Steen, M. (1995) Strategies for Consistency Checking. Technical report. University of Kent, Computing Laboratory, University of Kent, Canterbury, UK

Preview Preview

Bowman, H. and Boiten, E.A. and Derrick, J. and Steen, M. (1996) Strategies for Consistency Checking, the Choice of Unification. Technical report. UKC, University of Kent, Canterbury, UK

Preview Preview

Bowman, H. and Briscoe-Smith, C. and Derrick, J. and Strulo, B. (1997) On Behavioural Subtyping in LOTOS. In: Bowman, H. and Derrick, J., eds. Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems. Chapman and Hall pp. 335-351. ISBN 0-412-82040-4 .

Preview +1 more...

Bowman, H. and Bryans, J.W. and Derrick, J. (1998) Analysis of a Multimedia Stream using Stochastic Process Algebra. In: Sixth International Workshop on Process Algebras and Performance Modelling, 1998.

Preview

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

Preview Preview

Bowman, H. 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.

Preview +1 more...

Bowman, H. and Derrick, J. (1997) Extending LOTOS with Time: True Concurrency Perspective. In: Bertran, Miquel and Rus, Teodor, eds. Transformation-Based Reactive Systems Development. Lecture Notes in Computer Science, 1231. Springer-Verlag pp. 382-399. ISBN 3-540-63010-4 . The full text of this publication is not available from this repository.

Bowman, H. and Derrick, J. (1995) Modelling Distributed Systems using Z. In: UNSPECIFIED.

Preview Preview

Bowman, H. and Derrick, J. (1994) Towards a Formal Model of Consistency in ODP. Technical report. University of Kent, Computing Laboratory, University of Kent, Canterbury, UK

Preview Preview

Bowman, H. and Derrick, J. and Jones, Richard (1994) Modelling Garbage Collection Algorithms --- Extend abstract. In: Proceedings of Principles of Distributed Computing'94.

Preview Preview

Bowman, H. and Derrick, J. and Linington, P.F. and Steen, M. (1995) FDTs for ODP. Computer Standards and Interfaces, 17 (5-6). pp. 457-479. ISSN 0920-5489.

Preview Preview

Bowman, H. and Derrick, J. and Steen, M. (1995) Some Results on Cross Viewpoint Consistency Checking. In: UNSPECIFIED.

Preview Preview

Bowman, H. and Faconti, G. 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 . The full text of this publication is not available from this repository.

Bowman, H. and Faconti, G. and Katoen, J-P. and Latella, D. and Massink, M. (1998) Automatic Verification of a Lip-Synchronisation Algorithm Using UPPAAL - Extended Version. In: FMICS'98, Third Internatinoal Workshop on Formal Methods for Industrial Crtical Systems.

Preview

Bowman, H. and Faconti, G. 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, Jun 03-05, 1998, Abington, England, .

Preview Preview

Bowman, H. and Faconti, G. and Massink, M. (2000) Towards Integrated Cognitive and Interface Analysis. In: Proceedings of Formal Methods Elsewhere 2000, Pisa, Italy.

Preview

Bowman, H. and Faconti, G. and Massink, M. (1999) Towards Integrated Cognitive and Interface Analysis. Technical report.

Preview Preview

Bowman, H. and Gomez, R.S. (2006) How to stop time stopping. Formal Aspects of Computing, 18 (4). pp. 459-493. ISSN 0934-5043.

Preview

Bowman, H. and Gomez, R.S. and Su, Li (2004) How to stop time stopping (preliminary version). Technical report. University of Kent, Canterbury, Kent, CT2 7NF, UK

Preview

Bowman, H. and Katoen, J-P. (1998) A True Concurrency Semantics for ET-LOTOS. In: CSD'98 International Conference on Application of Concurrency to System Design, Mar 23-26, 1998, Fukushima, Japan. The full text of this publication is not available from this repository.

Bowman, H. and Steen, M.W.A. and Boiten, E.A. and Derrick, J. (2002) A Formal Framework for Viewpoint Consistency. Formal Methods in System Design, 21 (2). pp. 111-166. ISSN 0925-9856. The full text of this publication is not available from this repository.

Bowman, H. and Steen, M.W.A. and Boiten, E.A. and Derrick, J. (1999) A Formal Framework for Viewpoint Consistency (full version). Technical report. , Canterbury, Kent, CT2 7NZ

Preview Preview

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

Preview

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

Preview Preview

Bowman, H. and Thompson, Simon J. (1998) A Tableaux Method for Interval Temporal Logic with Projection. In: Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. Lecture Notes In Computer Science, 1397 (1397). Springer-Verlag pp. 108-123. ISBN 3-540-64406-7.

Preview

Brassel, Bernd and Chitil, Olaf and Hanus, Michael and Huch, Frank (2004) Observing Functional Logic Computations. In: Proc. of the Sixth International Symposium on Practical Aspects of Declarative Languages (PADL'04), JUN 18-19, 2004, Dallas, TX, .

Preview

Briscoe-Smith, C. (2000) Behavioural Subtyping in Process Algebra. Doctor of Philosophy (Ph.D.) thesis, University of Kent at Canterbury.

Brooks, S.P. and Morgan, B.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 available from this repository.

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, 27th-29th September 2007, Freiburg, Germany .

Preview

Bryans, J.W. and Davies, J.W. and Schneider, S.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 available from this repository.

Bryans, J.W. and Davies, J.W. and Schneider, S.A. (1995) Towards a Denotational Semantics for Timed LOTOS. In: Lecture Notes in Computer Science 962. The full text of this publication is not available from this repository.

Bryans, J. and Bowman, H. and Derrick, J. (2003) Model Checking Stochastic Automata. ACM Transactions on Computational Logic, 4 (4). pp. 452-492. ISSN 1529-3785. The full text of this publication is not available from this repository.

Bryans, J.W. and Blair, L. and Bowman, H. and Derrick, John (2000) Specification and Analysis of Automata-based Designs. In: Grieskamp, W. and Stanten, T. and Stoddart, B., eds. Integrated Formal Methods: Second International Conference, IFM 2000, Dagstuhl Castle, Germany, November 2000. Proceedings. Lecture Notes in Comuter Science, 1945. Springer pp. 176-193. ISBN 3-540-41196-8.

Preview Preview

Bryans, J.W. and Bowman, H. and Derrick, J. (2000) A Model Checking Algorithm for Stochastic Systems. Technical report. University of Kent, Canterbury, Kent

Preview Preview

Bryans, J.W. and Derrick, J. (1999) Stochastic specification and verification. In: 3rd Irish Workshop in Formal Methods.

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 available from this repository.

Bujorianu, Marius C. (2004) Integration of Specification Languages Using Viewpoints. In: Boiten, E.A. and Derrick, J. and Smith, G., eds. Integrated Formal Methods. Springer pp. 421-440. ISBN 3-540-21377-5. The full text of this publication is not available from this repository.

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 available from this repository.

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 available from this repository.

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 available from this repository.

Bujorianu, Marius C. and Bujorianu, Manuela L. (2002) Constructive Potential Theory: A Linear Logic Approach. In: NS 2002 Non-standard Methods and Applications in Mathematics, June 2002, Pisa, Italy. The full text of this publication is not available from this repository.

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

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 available from this repository.

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 available from this repository.

Bujorianu, Marius C. and Maharaj, S. and Bujorianu, Manuela L. (2002) Towards a formalization of viewpoints testing. In: Formal Approaches To Testing of Software 2002 (FATES'02), 24th August 2002, Brno, Czech Republic.

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. The full text of this publication is not available from this repository.

Cameron, Helen and King, Peter and Bowman, H. and Thompson, Simon (1998) Synchronization in Multimedia Documents. In: Andre, Jacques, ed. Proceedings of the 7th International Conference on Electronic Publishing, Held Jointly with the 4th International Conference on Raster Imaging and Digital Typography: Electronic Publishing, Artistic Imaging, and Digital Typography. Lecture Notes In Computer Science, 1357. Springer pp. 355-369. ISBN 3-540-64298-6 .

Preview Preview

Cavalcanti, A.L.C. and Naumann, C. (2002) Forward Simulation for Data Refinement of Classes. In: Eriksson, L. and Lindsay, P.A., eds. FME 2002: Formal Methods - Getting IT Right. Lecture Notes in Computer Science, 1. Springer-Verlag, Berlin pp. 471-490. ISBN 9783540439288. The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Naumann, C. (2002) On a Specification-oriented Model for Object-orientation. In: Proceedings of the 6th Brazilian Symposium on Programming Languages, June 5-7, 2002, Rio de Janeiro. The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Naumann, D. (1999) A Weakest Precondition Semantics for an Object-oriented Language of Refinement. In: FM'99 - Formal Methods. Lecture Notes in Computer Science, 1709. Springer-Verlag pp. 1439-1459. The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Naumann, D.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 . The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Naumann, D.A. (2000) Simulation and Class Refinement for Java. In: ECOOP 2000 Workshop on Formal Techniques for Java Programs, June 12, 2000, Sophia Antipolis, France. The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Sampaio, A. and Woodcock, J.C.P. (1999) An Inconsistency in Procedures, Parameters and Substitution in the Refinement Calculus. Science of Computer Programming, 33 (1). pp. 87-96. ISSN 0167-6423 . The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Sampaio, A.C.A and Woodcock, J.C.P. (2002) Refinement of Actions in Circus. In: Proceedings of REFINE'2002, July 2002, Copenhagen, Denmark. The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Woodcock, J.C.P. (2002) A Weakest Precondition Semantics for Circus. In: Proceedings of the Communicating Processing Architectures 2002, 15-18 September 2002, University of Reading, United Kingdom. The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Woodcock, J.C.P. (1998) ZRC - A Refinement Calculus for Z. Formal Aspects of Computing, 10 (3). pp. 267-289. The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Florissi, C. and Soares, PG and Melo, TCS (1987) Implementation of a Relational Language for Microcomputers. In: 7th Conference of the Brazilian Computer Society. The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Meira, SRL (1989) Denotational Models of Software Systems. In: 9th Conference of the Brazilian Computer Society. The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Sampaio, A. and Woodcock, JCP (1998) Procedures and Recursion in the Refinement Calculus. Journal of the Brazilian Computer Society, 5 (1). pp. 1-15. ISSN 0104-6500. The full text of this publication is not available from this repository.

Cavalcanti, A.L.C. and Woodcock, JCP (1998) A Weakest Precondition Semantics for Z. The Computer Journal, 41 (1). pp. 1-15. ISSN 0010-4620 . The full text of this publication is not available from this repository.

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 available from this repository.

Charles, Nathan and Bowman, H. and Thompson, Simon (1997) From ACT-ONE to Miranda, a Translation Experiment. Computer Standards and Interfaces, 19 (1). pp. 31-49. ISSN 0920-5489 .

Preview Preview

Charles, Philip and Howe, Jacob and King, Andy (2009) Integer Polyhedra for Program Analysis. In: Proceedings of the Fifth International Conference on Algorithmic Aspects in Information and Management, Jun 15-17, 2009, San Francisco, CA.

Preview

Cheng, R.C.H. (1994) Selecting Input Models. In: 1994 Winter Simulation Conference, Lake Buena Vista, Fl. The full text of this publication is not available from this repository.

Chitil, Olaf (1997) Adding an Optimisation Pass to the Glasgow Haskell Compiler. Other. University of Kent at Canterbury (Unpublished) The full text of this publication is not available from this repository.

Chitil, Olaf and Runciman, Colin and Wallace, Malcolm (2003) Transforming Haskell for Tracing. In: Ricardo, Peña and Thomas, Arts, eds. Implementation of Functional Languages. Lecture Notes in Computer Science. Springer, Berlin pp. 165-181. ISBN 3540401903. The full text of this publication is not available from this repository.

Chitil, Olaf (2001) A Semantics for Tracing. In: Draft Proceedings of the 13th International Workshop on Implementation of Functional Languages, IFL 2001.

Preview

Chitil, Olaf (1997) Common Subexpression Elimination in a Lazy Functional Language. In: Draft Proceedings of the 9th International Workshop on Implementation of Functional Languages.

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).

Preview

Chitil, Olaf (2000) Deforestation of Functional Programs through Type Inference. In: 17 Workshops der GI-Fachgruppe 2.1.4. Programmiersprachen und Rechenkonzepte mit Schwerpunkt Softwarecomponenten.

Preview

Chitil, Olaf (1999) Denotational Semantics for Teaching Lazy Functional Programming. In: Proceedings of the Workshop on Functional and Declarative Programming in Education, 29 September 1999, Paris, France.

Preview

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

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.

Preview

Chitil, Olaf (2005) Hat-Explore: Source-Based Trace Exploration. In: Runciman, Colin, ed. Implementation and Application of Functional Languages. Lecture Notes in Computer Science, 3474/2. Springer Berlin / Heidelberg pp. 126-141. ISBN 978-3-540-26094-3.

Preview

Chitil, Olaf (2006) Pretty Printing with Delimited Continuations Report 4-06. Technical report. University of Kent

Preview

Chitil, Olaf (2005) Pretty Printing with Partial Continuations. In: 17th International Workshop on Implementation and Application of Functional Languages, 19-21 September 2005, Dublin, Ireland.

Preview

Chitil, Olaf (2005) Pretty printing with lazy dequeues. Transactions on Programming Languages and Systems (TOPLAS), 27 (1). pp. 163-184. ISSN 0164-0925.

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.

Preview

Chitil, Olaf (2004) Source-Based Trace Exploration. In: Implementation and Application of Functional Languages. Lecture Notes in Computer Science. Technical Report 0408, University of Kiel pp. 239-244. ISBN 3-540-26094-3 .

Preview

Chitil, Olaf (2005) Source-based trace exploration. In: Implementation and Application of Functional Languages, 16th International Workshop, IFL 2004.

Preview

Chitil, Olaf (1996) The Sigma-Semantics: A Comprehensive Semantics for Functional Programs. Technical report. UKC

Preview

Chitil, Olaf (1997) The Sigma-Semantics: A Comprehensive Semantics for Functional Programs. Fundamenta Informaticae, 31 . pp. 253-294.

Preview

Chitil, Olaf (1999) Type Inference Builds a Short Cut to Deforestation. In: Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming (ICFP '99), September 27 - September 29, 1999 , Paris, France.

Preview

Chitil, Olaf (2000) Type-Inference Based Deforestation of Functional Programs. Doctor of Philosophy (Ph.D.) thesis, RWTH Aachen.

Preview

Chitil, Olaf (1999) Type-Inference Based Short Cut Deforestation (nearly) without Inlining. In: 11th International Workshop on Implementation of Functional Languages, September 7th-10th 1999, Lochem, Netherlands.

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.

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. Lecture Notes in Computer Science , 4449. Springer, Germany pp. 126-144. ISBN 978-3-540-7412909 .

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.

Preview

Chitil, Olaf and Huch, Frank (2007) Monadic prompt lazy assertions in Haskell. In: Shao, Zhong, ed. Programming Languages and Systems. Lecture Notes in Computer Science Vol. 4807, 4807. Springer pp. 38-53. ISBN 3540766367.

Preview

Chitil, Olaf and Luo, Yong (2007) Proving the Correctness of Algorithmic Debugging for Functional Programs. In: Trends in Functional Programming. Intellect. ISBN 9781841501888.

Preview

Chitil, Olaf and Luo, Yong (2007) Structure and Properties of Traces for Functional Programs. In: Mackie, Ian, ed. Electronic Notes in Theoretical Computer Science (ENTCS). ENTCS, 176. Elsevier pp. 39-63.

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

Preview

Chitil, Olaf and McNeill, Dan and Runciman, Colin (2004) Lazy Assertions. In: Implementation of Functional Languages: 15th International Workshop, IFL 2003, Sep 08-11, 2003, Edinburgh, England.

Preview

Chitil, Olaf and Runciman, C. and Wallace, M. (2001) Freja, Hat and Hood --- A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs. In: Proceedings of the 12th International Workshop on Implementation of Functional Languages (IFL 2000), AACHEN, GERMANY.

Preview

Chitil, Olaf and Runciman, C. and Wallace, M. (2000) Tracing and Debugging of Lazy Functional Programs - A Comparative Evaluation of Three Systems. In: Draft Proceedings of the 12th International Workshop on Implementation of Functional Languages.

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. The full text of this publication is not available from this repository.

Clear, C. and Ibbetson, A.L. and Collinson, P. (1994) Exporting Home on Demand to PCS. In: 8th Systems Administration Conference (LISA VIII), San Diego, Ca. The full text of this publication is not available from this repository.

Cobbah, W.G.K. and Fairhurst, M.C. (2000) Computer analysis of handwriting dynamics during dopamimetic tests in Parkinson's disease. In: 26th Euromicro Conference, Maastricht, Netherlands. The full text of this publication is not available from this repository.

Codish, M. and Heaton, A. and King, A. and Abo-Zaed, M. and Hill, P.M. (1998) Widening Positive Boolean functions for Goal-dependent Groundness Analysis. Technical report. University of Kent

Preview Preview

Codish, M. and Heaton, A. and King, Andy (1997) Widening Pos for Efficient and Scalable Groundness Analysis of Logic Programs. Technical report. University of Kent at Canterbury

Preview Preview

Cohen, D. and Watson, P. (1991) An efficient representation of arithmetic for term rewriting. In: Rewrite Techniques and Applications, Proceedings of the 4th Conference on Rewrite Techniques and Applications, Como, Italy, 1991. The full text of this publication is not available from this repository.

Colchester, A.C.F. and Ourselin, S. and Zhu, Y.G. and Bardinet, E. and He, Y. and Roche, A. and Al-Sarraj, S. and Nailon, B. and Ironside, J.W. and Ayache, N. (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 available from this repository.

Cole, J. and Derrick, J. and Milosevic, Z. and Raymond, K. (2001) Author Obliged to Submit Paper before 4 July: Policies in an Enterprise Specification. In: Policies for Distributed Systems and Networks.

Preview Preview

Cooper, S.B. and Lempp, S. and Watson, P. (1989) Weak density and cupping in the d-r.e. degrees. Israel Journal of Mathematics, 67 (1). pp. 137-152. The full text of this publication is not available from this repository.

Cornelio, ML and Cavalcanti, A.L.C. and Sampaio, A.C.A (2002) Refactoring by Transformation. In: Proceedings of REFINE'2002, 20th-21st July 2002, Copenhagen, Denmark. The full text of this publication is not available from this repository.

Coutinho, S.L. and Reis, T.P.C. and Cavalcanti, A.L.C. (1999) A Tool for Teaching Refinement. In: 13th Brazilian Symposium on Software Engineering - Tools Session. The full text of this publication is not available from this repository.

Cross, M. and Keech, M. and Liddell, H. and Steel, J. and Walshaw, C and Welch, P.H (1995) Implementing a strategy for the promotion of high performance computing in the UK. In: International Conference and Exhibition on High-Performance Computing and Networking, Milan, Italy. The full text of this publication is not available from this repository.

Daniels, Anthony C. (1999) A Semantics for Functions and Behaviours. Doctor of Philosophy (Ph.D.) thesis, The University of Nottingham.

Preview Preview

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

Preview Preview

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

Preview Preview

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

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, Budapest, Hungary.

Preview

Davie, Thomas and Chitil, Olaf (2005) Hat-Delta --- One Right Does Make a Wrong. In: Hat Day 2005: work in progress on the Hat tracing system for Haskell.

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. (Submitted)

Preview

Davies, J.W. and Bryans, J.W. and Schneider, S.A. (1996) Real-time LOSTOS and Timed Observations. In: UNSPECIFIED. The full text of this publication is not available from this repository.

Dealmeida, F.A. and Welch, P.H. (1994) A Parallel Emulator for a Multi-Processor Dataflow Machine. In: 1994 World Transputer Congress (WTC 94) - Transputer Applications and Systems 94, Como, Italy. The full text of this publication is not available from this repository.

Decarvalho, A. and Fairhurst, M.C. and Bisset, D.L. (1994) A Modular Boolean Architecture for Pattern Recognition. In: 1994 IEEE International Conference on Neural Networks (ICNN 94) - 1st IEEE World Congress on Computational Intelligence, Orlando, Fl. The full text of this publication is not available from this repository.

Decarvalho, A. and Fairhurst, M.C. and Bisset, D.L. (1994) An Integrated Boolean Neural-Network for Pattern-Classification. Pattern Recognition Letters, 15 (8). pp. 807-813. ISSN 0167-8655. The full text of this publication is not available from this repository.

Delaney, A. and Taylor, J. and Thompson, Simon (2008) Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages. In: Diagrammatic Representation and Inference: 5th International Conference, Diagrams 2008, Herrsching, Germany, September 19-21, 2008, Sep 19-21, 2008, Herrsching, Germany.

Preview

Dent, Alan and Hanna, Keith (1993) Reasoning about Array Structures Using a Dependently Typed Logic. In: Proc Computer Hardware Description Languages (CHDL-93). The full text of this publication is not available from this repository.

Derrick, J. and Boiten, E. (2002) Combining Component specifications in Object-Z and CSP. Formal Aspects of Computing, 13 (Part 2). pp. 111-127. ISSN 0934-5043. The full text of this publication is not available from this repository.

Derrick, J. and Boiten, E.A. (2008) More relational refinement: traces and partial relations. Electronic Notes in Theoretical Computer Science, 214 . pp. 255-276. ISSN 1571-0661. The full text of this publication is not available from this repository.

Derrick, J. and Boiten, E.A. (2007) Relational Concurrent Refinement with Internal Operations. Electronic Notes in Theoretical Computer Science, 187 . pp. 35-53. ISSN 1571-0661. The full text of this publication is not available from this repository.

Derrick, J. and Boiten, E.A. and Bowman, H. and Steen, M. (1997) Translating LOTOS to Object-Z. In: 2nd BCS-FACS Northern Formal Methods Workshop : Proceedings of the 2nd BCS-FACS Northern Formal Methods Workshop, 14-15 July, 1997, Ilkley, U. K.. The full text of this publication is not available from this repository.

Derrick, J. (2000) A single complete refinement rule for Z. Journal of Logic and Computation, 10 (5). pp. 663-675. ISSN 0955-792X.

Preview Preview

Derrick, J. (2003) Timed CSP and Object-Z. In: 3rd International Conference on B and Z Users, JUN 04-06, 2003, TURKU, FINLAND. The full text of this publication is not available from this repository.

Derrick, J. and Akehurst, D.H. and Boiten, E.A. (2002) A framework for UML consistency. In: Workshop on Consistency Problems in UML-based Software Development, October 1st, 2002 , Dresden, Germany.

Preview

Derrick, J. and Boiten, E. and Bowman, H. and Steen, M. (1996) Supporting ODP - Translating LOTOS into Z. In: UNSPECIFIED.

Preview Preview

Derrick, J. and Boiten, E.A. (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 available from this repository.

Derrick, J. and Boiten, E.A. (2000) Refinement of objects and operations in Object-Z. In: Smith, Scott F. and Talcott, Carolyn L., eds. Fourth International Conference on Formal methods for open object-based distributed systems IV. Kluwer Academic Publishers pp. 257-277. ISBN 0-7923-7923-3 .

Preview

Derrick, J. and Boiten, E.A. (1999) Separating component and context specification using Promotion. In: International conference on Integrated Formal Methods 1999 (IFM'99), June 28-29, 1999, York, UK.

Preview Preview

Derrick, J. and Boiten, E.A. (1999) Testing Refinements of State-based Formal Specifications. Software Testing, Verification and Reliability, 9 (1). pp. 27-50.

Preview Preview

Derrick, J. and Boiten, E.A. and Bowman, H. and Steen, M. (1998) Specifying and Refining Internal Operations in Z. Formal Aspects of Computing, 10 (2). pp. 125-159. ISSN 0934-5043 (Print) 1433-299X (Online).

Preview Preview

Derrick, J. and Boiten, E.A. and Bowman, H. and Steen, M. (1997) Weak refinement in Z. In: Bowen, J.P. and Hinchey, M.G. and Till, D., eds. ZUM '97: The Z Formal Specification Notation. Lecture Notes in Computer Science, 1212. Springer-Verlag, Reading pp. 369-388. ISBN 3-540-62717-0.

+1 more...

Derrick, J. and Bowman, H. and Boiten, E.A. and Steen, M. (1996) Comparing LOTOS and Z refinement relations. In: UNSPECIFIED.

Preview Preview

Derrick, J. and Bowman, H. and Steen, M. (1995) Maintaining Cross Viewpoint Consistency using Z. In: UNSPECIFIED.

Preview Preview

Derrick, J. and Bowman, H. and Steen, M. (1995) Viewpoints and Objects. In: UNSPECIFIED.

Preview Preview

Derrick, J. and Smith, G. (2004) Linear temporal logic and Z refinement. In: Rattray, C. and Maharaj, S. and Shankland, C., eds. Linear temporal logic and Z refinement. Lecture Notes in Computer Science, 3116. Springer pp. 117-131. ISBN 3-540-22381-9 . The full text of this publication is not available from this repository.

Derrick, J. and Smith, G. (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 available from this repository.

Derrick, J. and Smith, G. (2000) Structural refinement in Object-Z / CSP. In: Grieskamp, W. and Stanten, T. and Stoddart, B., eds. Proceedings of the Second International Conference on Integrated Formal Methods. Lecture Notes in Computer Science, 1945. Springer pp. 194-213. ISBN 3-540-41196-8 .

Preview Preview

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

Preview Preview

Derrick, J. and Wehrheim, H. (2003) Using coupled simulations in non-atomic refinement. In: ZB 2003: Formal Specification and Development in Z and B, Jun 04-06, 2003, Turku, Finland, . The full text of this publication is not available from this repository.

Dick, A.J.J. and Watson, P. (1991) Order-sorted term rewriting. The Computer Journal, 34 (1). pp. 16-19. The full text of this publication is not available from this repository.

Duran, A.A. and Sampaio, A.C.A and Cavalcanti, A.L.C. (2002) Refinement Algebra for Formal Bytecode Generation. In: Lecture Notes in Computer Science. Springer-Verlag pp. 347-358. ISBN 978-3-540-00029-7. The full text of this publication is not available from this repository.

Evans, A.S. and Holton, D.R.W. and Lai, L.M. and Watson, P. (1997) A comparison of real-time formal specification languages. In: Duke, D.J. and Evans, A.S., eds. BCS-FACS Northern formal methods workshop. Electronic Workshops in Computer Science. Springer Verlag ISBN 3540761179. The full text of this publication is not available from this repository.

Faridani, A. and Dimond, K.R. (1994) A Transputer-Based Vision System for Mobile Robots. In: 7th Conference of the North-American-Transputer-Users-Group (NATUG-7), Atlanta, Ga. The full text of this publication is not available from this repository.

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 available from this repository.

Findlay, G. and Hirst, T.R. (1993) The Role of DSBA in Enterotoxin Biogenesis and Cell Viability. In: 6th European Workshop on Bacterial Protein Toxins, Stirling, Scotland. The full text of this publication is not available from this repository.

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

Preview

Freitas, Leonardo and Cavalcanti, A.L.C. and Sampaio, Augusto (2002) JACK: A Framework for Process Algebra Implementation in Java. In: Proceedings of XVI Simpósio Brasileiro de Engenharia de Software, October 2002, Brazil.

Preview

Gaizauskas, R. and Rodgers, Peter and Humphreys, K. (2001) Visual Tools for Natural Language Processing. Journal of Visual Languages & Computing, 12 (4). pp. 375-412. ISSN 1045-926X.

Preview

Gaizauskas, R.G. and Cunningham, H. and Wilks, Y. and Rodgers, Peter and Humphreys, K. (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).

Preview

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

Genaim, S. and King, A. (2002) Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. Technical report. UKC, University of Kent, Canterbury, CT2 7NF, UK. The Computing Laboratory.

Preview Preview

Genaim, S. and King, Andy (2003) Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. In: Degano, Pierpaolo, ed. Lecture Notes In Computer Science. Lecture Notes in Computer Science, 2618. Springer-Verlag pp. 84-98. ISBN 3-540-00886-1 . The full text of this publication is not available from this repository.

Genaim, S. and King, Andy (2004) Inferring Non-Suspension Conditions for Logic Programs with Dynamic Scheduling. Technical report. Assoc Computing Machinery 10.1145/1352582.1352585 .

Preview Preview

Giacomini, L. and Bordbar, B. and Holding, D.J. (2000) Hybrid Sliding Mode Control for a Set of Interconnected Nonlinear. In: 39th IEEE Conference on Decision and Control, Dec 12-15, 2000, Sydney, Australia. The full text of this publication is not available from this repository.

Gomez, R.S. (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, SEP 14-16, 2009, Budapest, HUNGARY. The full text of this publication is not available from this repository.

Gomez, R.S. (2009) Compositional detection of Zeno behavior in Timed Automata with Deadlines. Technical report. UKC

Preview

Gomez, R.S. (2009) From LIDL(m) to Timed Automata. Technical report. UKC

Preview

Gomez, R.S. (2006) Verification of Real-Time Systems: Improving Tool Support. Doctor of Philosophy (Ph.D.) thesis, University of Kent.

Preview

Gomez, R.S. (2008) Verification of Timed Automata with Deadlines in Uppaal. Technical report. UKC

Preview

Gomez, R.S. and Augusto, J.C. (2004) Durative Events in Active Databases. In: ICEIS 2004, Proceedings of the 6th International Conference on Enterprise Information Systems, April 2004, Porto, Portugal,.

Preview

Gomez, R.S. and Augusto, Juan.C 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 available from this repository.

Gomez, R.S. and Ausguto, J.C. (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.

Preview

Gomez, R.S. and Bowman, H. (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 available from this repository.

Gomez, R.S. and Bowman, H. (2006) Compositional Detection of Zeno Behaviour in Timed Automata. Technical report. Computing Laboratory, CT2 7NF Canterbury, Kent, UK

Preview

Gomez, R.S. and Bowman, H. (2005) Discrete Timed Automata. Technical report. UKC

Preview

Gomez, R.S. and Bowman, H. (2003) Discrete Timed Automata and MONA: Description, Specification and Verification of a Multimedia Stream. In: Konig, H. and Heiner, M. and Wolisz, A., eds. Lecture Notes in Computr Science. LNCS, 2767 (2767). Springer, Berlin, Germany pp. 177-192. ISBN 3-540-20175-0 . The full text of this publication is not available from this repository.

Gomez, R.S. and Bowman, H. (2007) Efficient Detection of Zeno Runs in Timed Automata. In: 5th International Conference FORMATS 2007 (Formal Modelling and Analysis of Timed Systems), October 2007, Salzburg, Austria.

Preview

Gomez, R.S. and Bowman, H. (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.

Preview

Griffin, D.K. and Mitchell, D. 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.

Preview

Hanna, F.K. and Daeche, N. (1986) Purely Functional Implementation of a Logic. In: Proc. 8th Intnl. Conf. on Automated Deduction. The full text of this publication is not available from this repository.

Hanna, F.K. and Daeche, N. (1987) Specification and Verification of Digital Systems. In: Proc Conf on Logic and its Application to Computer Science. The full text of this publication is not available from this repository.

Hanna, F.K. and Daeche, N. (1985) Specification and Verification using Higher-Order Logic. In: Computer Hardware Description Languages and their Applications. The full text of this publication is not available from this repository.

Hanna, F.K. and Daeche, N. (1986) Specification and Verification using Higher-Order Logic: A Case Study. In: Formal Aspects of VLSI Design. The full text of this publication is not available from this repository.

Hanna, F.K. and Daeche, N. (1992) The Veritas Design Logic; a User''s View. In: Proc. Theorem Provers in Circuit Design. The full text of this publication is not available from this repository.

Hanna, F.K. and Daeche, N. and Longley, M. (1989) Formal Synthesis of Digital Systems. In: Proc IFIP Intnl. Workshop on Applied Formal Methods for Correct VLSI Design. The full text of this publication is not available from this repository.

Hanna, F.K. and Daeche, N. and Longley, M. (1989) Veritas: A Specification Language based on Type Theory. In: Proc. Workshop on Hardware Specification, Verification and Synthesis, Mathematical Aspects. The full text of this publication is not available from this repository.

Hanna, F.K. and Howells, W.G.J. (1994) Parallel Theorem Proving. In: Runciman, C. and Wakeling, D., eds. Applications of Functional Programming. UCL Press, pp. 221-235. The full text of this publication is not available from this repository.

Hanna, F.K. and Howells, W.G.J. (1994) The Veritas Proof Assistant. In: Runciman, C. and Wakeling, D., eds. Applications of Functional Programming. UCL Press, pp. 125-204. The full text of this publication is not available from this repository.

Hanna, Keith (1998) Automatic Verification of Mixed-Level Logic Circuits. In: Formal Methods in Computer-Aided Design. The full text of this publication is not available from this repository.

Hanna, Keith (1999) Implementing Theorem Provers in a Purely Functional Style. Journal of Functional Programming, 9 (2). pp. 147-166. The full text of this publication is not available from this repository.

Hanna, Keith (2002) Interactive Visual Functional Programming. In: Proc. Intnl Conf. on Functional Programming, OCT 04-06, 2002, Pittsburgh, PA, USA. The full text of this publication is not available from this repository.

Hanna, Keith (1994) Reasoning about Real Digital Circuits. In: Proc Higher Order Logic Theorem Proving and its Applications. The full text of this publication is not available from this repository.

Hanna, Keith and Daeche, N. (1993) Strongly-Typed Theory of Structures and Behaviours. In: Correct Hardware Design and Verification Methods. The full text of this publication is not available from this repository.

Hanus, Michael and Krishnamurthy, Shriram and Thompson, Simon (2002) Functional and Declarative Programming in Education 2002. In: Functional and Declarative Programming in Education (FDPE02), Monday 7 October 2002 , Pittsburgh, PA, USA. The full text of this publication is not available from this repository.

Hartel, P.H. and Feeley, M. and Jones, Richard and Thomas, S. (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 available from this repository.

Heaton, A. and Abo-Zaed, M. and Codish, M. and King, A. (2000) A Simple Polynomial Groundness Analysis for Logic Programs. Journal of Logic Programming, 45 (1-3). pp. 143-156. ISSN 0743-1066.

Preview Preview

Heaton, A. and Hill, P.M. and King, A.M. (1998) Analysis of Logic Programs with Delay. In: Fuchs, N.E., ed. Logic Program Synthesis and Transformation. Lecture Notes in Computer Science, 1463. Springer-Verlag pp. 148-167. ISBN 978-3-540-65074-4.

Preview Preview

Heaton, A. and King, A. (2000) Abstracting Builtins for Groundness Analysis. Technical report. University of Kent, Computing Laboratory

Preview Preview

Hierons, R. and Derrick, J. (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 available from this repository.

Hill, P. and King, A. (1998) Detecting and Exploiting Determinacy in Logic Programs. Computational Logic Newsletter, 4 (1). pp. 100-101. The full text of this publication is not available from this repository.

Hill, S. (1995) The Lazy Z-Buffer. Information Processing Letters, 55 (2). pp. 65-70. ISSN 0020-0190. The full text of this publication is not available from this repository.

Hill, S. (1995) Parallel imperative functional programming. In: 18th Technical Meeting of the World-occam-and-Transputer-User-Group (WoTUG-18), Manchester, England. The full text of this publication is not available from this repository.

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

Preview Preview

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

Preview Preview

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

Preview Preview

Hill, Steve and Thompson, Simon (1995) Miranda in Isabelle. In: Preceedings of the first Isabelle Users Workshop.

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.

Preview

Hojjatoleslami, A. and Kittler, J. (1998) Region Growing: A New Approach. Image Processing, IEEE Transactions on , 7 (7). 1079 -1084. ISSN 1057-7149 . The full text of this publication is not available from this repository.

Hopkins, Tim (1992) Remark on Algorithm-540. Acm Transactions on Mathematical Software, 18 (3). pp. 343-344. ISSN 0098-3500. The full text of this publication is not available from this repository.

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

Preview Preview

Howe, J.M. and King, A. (2003) Efficient Groundness Analysis in Prolog. Theory and Practice of Logic Programming, 3 (1). pp. 95-124. ISSN 1471-0684. The full text of this publication is not available from this repository.

Howe, J.M. and King, A. (1999) Specialising Finite Domain Programs using Polyhedra (Abstract). In: ECOOP’99 Workshops, Panels, and Posters, 14–18 June 1999 , Lisbon, Portugal. The full text of this publication is not available from this repository.

Howe, J.M. and King, A. (2003) Three Optimisations for Sharing. Theory and Practice of Logic Programming, 3 (2). pp. 243-257. ISSN 1471-0684. The full text of this publication is not available from this repository.

Howe, J.M. (2001) Proof Search in Lax Logic. Mathematical Structures in Computer Science, 11 (4). pp. 573-588. ISSN 0960-1295.

Preview Preview

Howe, J.M. (1999) Proof Search in Lax Logic. Technical report.

Preview Preview

Howe, J.M. (1997) Two Loop Detection Mechanisms: A Comparison. In: TABLEAUX'97, May 13-16, 1997, Pont A Mousson, France, .

Preview +1 more...

Howe, J.M. and King, A. (1999) A Semantic Basis for Specialising Domain Constraints. Technical report. , Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK

Preview Preview

Howe, J.M. and King, A. (2001) Efficient Groundness Analysis in Prolog. Technical report. university of kent

Preview Preview

Howe, J.M. and King, A. (2001) Positive Boolean Functions as Multiheaded Clauses. In: International Conference on Logic Programming.

Preview Preview

Howe, J.M. and King, A. (2000) Specialising Finite Domain Programs using Polyhedra. In: Bossi, A., ed. Lecture Notes In Computer Science. Lecture Notes in Computer Science, 1817. Springer-Verlag pp. 118-135. ISBN 978-3-540-67628-7.

Preview

Howe, J.M. and King, Andy (2002) Correctness of Set-Sharing with Linearity. Technical report. Computing Laboratory, Canterbury

Preview Preview

Howe, J.M. and King, Andy (2009) Logahedra: a New Weakly Relational Domain. In: International Symposium on Automated Technology for Verification and Analysis, OCT 13-16, 2009, Macao, Peoples Republic of China.

Preview

Howe, J.M. and King, Andy (2001) Three Optimisations for Sharing. Technical report. UKC, University of Kent at Canterbury (Unpublished)

Preview Preview

Howe, J.M. and King, Andy (2001) Widening BDDs. Technical report. Great Britain:University of Kent

Preview Preview

Howe, J.M. and King, Andy and Lu, L. (2004) Analysing Logic Programs by Reasoning Backwards. In: Program Development in Computational Logic.

Preview

Howells, G. and Fairhurst, M.C. and Bisset, D.L. (1994) BCN - an Architecture for Weightless Ram-Base Neural Networks. In: 1994 IEEE International Conference on Neural Networks (ICNN 94) - 1st IEEE World Congress on Computational Intelligence, Orlando, Fl. The full text of this publication is not available from this repository.

Howells, G. and Fairhurst, M.C. and Bisset, D.L. (1995) PCN: The Probabilistic Convergence Network. In: 1995 IEEE International Conference on Neural Networks (ICNN 95), Perth, Australia. The full text of this publication is not available from this repository.

Howells, G. and Fairhurst, M.C. and Rahman, F. (2000) An exploration of a new paradigm for weightless RAM-based neural networks. Connection Science, 12 (1). pp. 65-90. ISSN 0954-0091. The full text of this publication is not available from this repository.

Johnson, C.W. and Telford, A.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 available from this repository.

Johnson, Colin G. and Marsh, Duncan (1996) Modelling Robot Manipulators in a CAD Environment Using B-Splines. In: Proceedings of the 1996 IEEE Joint Symposia on Intelligence and Systems.

Preview Preview

Jones, Richard (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 available from this repository.

Jones, Richard (2000) Memeory Management Session Overview. In: Persistent Object Systems: Design, Implementation, and Use. The full text of this publication is not available from this repository.

Jones, Richard (1990) Tail Recursion Without Space Leaks. Technical report. UKC, University of Kent, Canterbury, UK The full text of this publication is not available from this repository.

Jones, Richard and Jul, Eric (1999) Garbage Collection. In: OOPSLA'99 Conference on Object-Oriented Programming, Systems, Languages and Applications, November 1-5, 1999, Denver, Colorado, USA. The full text of this publication is not available from this repository.

Jones, Richard and Jul, Eric (2000) Introduction to Memory Management and Garbage Collection. ACM SIGPLAN. The full text of this publication is not available from this repository.

Jones, Richard (1989) On the Implementation of Functional Programming Languages. Other masters thesis, UKC Computing Laboratory. The full text of this publication is not available from this repository.

Jones, Richard (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 available from this repository.

Jones, Richard (1993) Zed --- a Z specification language Type 1 font. UNSPECIFIED. The full text of this publication is not available from this repository.

Jones, Richard (1995) Zed --- a Z specification language font for PostScript Type 1 and TrueType. UNSPECIFIED. The full text of this publication is not available from this repository.

Jones, Richard and King, Andy (2005) A Fast Analysis for Thread-Local Garbage Collection with Dynamic Class Loading. In: Fifth IEEE International Workshop on Source Code Analysis and Manipulation.

Preview

Jones, Richard and Lins, R.D. (1992) Cyclic Weighted Reference Counting without Delay. Technical report. UKC, University of Kent, Canterbury, UK The full text of this publication is not available from this repository.

Jones, Richard and Lins, R.D. (1993) Cyclic Weighted Reference Counting without Delay. In: Proceedings of PARLE'93. The full text of this publication is not available from this repository.

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

Preview Preview

Kahrs, Stefan (2006) Gene Expression Programming with Pre-Order Traversals. In: 6th International Conference on Recent Advances in Soft Computing, 10-12 July 2006, Canterbury, United Kingdom. The full text of this publication is not available from this repository.

Kahrs, Stefan (2006) Genetic Programming with Primitive Recursion. In: 2006 Genetic and Evolutionary Computation Conference, 8-12 July 2006 , Seattle, Washington (USA). The full text of this publication is not available from this repository.

Kahrs, Stefan (2009) Modularity of Convergence in Infinitary Rewriting. In: Rewriting Techniques and Applications, JUN 29-JUL 01, 2009, Brasilia, BRAZIL. The full text of this publication is not available from this repository.

Kahrs, Stefan (2001) Red-black trees with types. Journal of Functional Programming, 11 (4). pp. 425-432. The full text of this publication is not available from this repository.

Kahrs, Stefan (2003) Well-Going Programs Can Be Typed. In: Typed Lambda Calculi and Applications, Jun 10-12, 2003, Valencia, Spain, . The full text of this publication is not available from this repository.

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

Preview Preview

Kahrs, Stefan (1993) Compilation of combinatory reduction systems. In: Heering, Jan and Meinke, Karl and Möller, B. and Nipkow, Tobias, eds. Higher-Order Algebra, Logic, and Term Rewriting. Lecture Notes in Computer Science, 816. Springer pp. 169-188. ISBN 3-540-58233-9.

Preview

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

Preview Preview

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

Preview Preview

Kahrs, Stefan (2007) Infinitary rewriting: meta-theory and convergence. Acta Informatica, 44 (2). pp. 91-121. ISSN 0001-5903.

Preview

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

Preview Preview

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

Preview Preview

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

Preview Preview

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

Preview Preview

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

Preview Preview

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

Preview Preview

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

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 restricted.

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 .

Preview Preview

Kalli, K. and Rao, Y.J. and Webb, D.J. and Jackson, D.A. (1995) Potential of fibre optic point and distributed fibre optic sensors for structural monitoring. In: 7th Conference on Sensors and Their Applications, Dublin, Ireland. The full text of this publication is not available from this repository.

Kelner, J. and Cavalcanti, A.L.C. and Pardo, A. (1989) LindA: A Language for Automated Authoring of Hypertexts. In: 3rd Brazilian Symposium on Sofrware Engineering. The full text of this publication is not available from this repository.

Kemp, B. and King, A. and Soper, P. (1994) Continuation Compilation for Concurrent Logic Programming. In: Proceedings of the Symposium on Artificial Intelligence in Real-time Control. The full text of this publication is not available from this repository.

Kemp, Z.P. (1995) Multimedia and Spatial Information Systems. Ieee Multimedia, 2 (4). pp. 68-76. ISSN 1070-986X. The full text of this publication is not available from this repository.

Kemp, Z.P. and Kowalczyk, A. (1994) Incorporating the Temporal Dimension in a GIS. In: 1st National Conference on GIS Research - UK, Keele, England. The full text of this publication is not available from this repository.

Kettle, N. (2008) Anytime Algorithms for ROBDD Symmetry Detection and Approximation. Doctor of Philosophy (Ph.D.) thesis, Computing Laboratory.

Preview

Kettle, N. and King, A.M. (2006) An Anytime Symmetry Detection Algorithm for ROBDDs. In: Onodera, H., ed. Asia and South Pacific Design Automation Conference. IEEE pp. 243-248. ISBN 0-7803-9451-8 .

Preview

Kettle, N. and King, A.M. (2008) Bit-Precise Reasoning with Affine Functions. Electronic Notes in Theoretical Computer Science . ISSN 1571-0661.

Preview

Kettle, N. and King, A.M. (2006) Proof of New Decompositional Results for Generalized Symmetries. Technical report. UKC, University of Kent, Canterbury, Kent, CT2 7NF

Preview

Kettle, N. and King, A.M. (2006) Proof of New Implicational Relationships between Generalized Symmetries. Technical report. Kent University, University of Kent, Canterbury, Kent, CT2 7NF

Preview

Kettle, N. and King, A.M. and Strzemecki, T. (2006) Widening ROBDDs with Prime Implicants. In: Hermanns, H. and Palsberg, J., eds. Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, 3920 . Springer-Verlag, Berlin, pp. 105-119. ISBN 978-3-540-33056-1.

Preview

King, A. (1994) A Framework for Freeness Analysis. In: Tick, E. and Succi, G., eds. Implementations of Logic Programming Systems. Implementations of Logic Programming Systems . Kluwer Academic Publishers, Dordrecht, pp. 137-149. The full text of this publication is not available from this repository.

King, A. (1994) High-Precision Sharing Analysis. Journal of Programming Languages, 2 (2). pp. 149-181. ISSN 0963-9306. The full text of this publication is not available from this repository.

King, A. and Soper, P. (1991) Reducing Scheduling Overheads for Concurrent Logic Programs. In: Processing Declarative Knowledge. The full text of this publication is not available from this repository.

King, Andy (2008) Logic-Based Program Synthesis and Transformation, Kongens Lyngby, Denmark, August 23-24, 2007, Revised Selected Papers. Lecture Notes in Computer Science (4915). Springer-Verlag, 219 pp. ISBN 978-3-540-78768-6. The full text of this publication is not available from this repository.

King, Andy (2008) Relations, Constraints and Abstractions: Using the Tools of Logic Programming in the Security Industry. In: Proceedings on Logic-Based Methods in Programming Envrionments. The full text of this publication is not available from this repository.

King, Andy and Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs. In: Palamidessi, Catuscia, ed. Logic Programming. Lecture Notes in Computer Science, 2916. Springer-Verlag pp. 315-330. ISBN 3-540-20642-6 . The full text of this publication is not available from this repository.

King, Andy and Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs. Technical report. , University of Kent The full text of this publication is not available from this repository.

King, A. and Lu, L. (2001) A Backward Analysis for Constraint Logic Programs. Technical report. University of Kent, University of Kent at Canterbury, Kent, CT2 7NF, UK

Preview Preview

King, A. and Lu, L. (2002) A Backward Analysis for Constraint Logic Programs. Theory and Practice of Logic Programming, 2 (Part 1). pp. 517-542. ISSN 1471-0684.

Preview Preview

King, A. and Smaus, J.G. and Hill, P. (1999) Quotienting share for dependency analysis. In: 8th European Symposium on Programming, ESOP’99 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS’99, March 22-28, 1999, Amsterdam, Netherlands.

Preview Preview

King, A. and Soper, P. (1994) Depth-k Sharing and Freeness. In: 11th International Conference on Logic Programming, Jun 13-18, 1994, S Margherita Ligure, Italy. Access to this publication is restricted.

King, A. and Soper, P. (1992) Serialisation Analysis of Concurrent Logic Programs. In: Algebraic and Logic Programming.

Preview Preview

King, A.C. (2002) Removing GC Synchronisation. In: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications. SIGPLAN. ACM, Seattle, WA pp. 112-113. ISBN 1-58113-626-9 .

Preview

King, A.M. and Sondergaard, H. (2008) Inferring Congruence Equations using SAT. In: Twentieth International Conference on Computer-Aided Verification, JUL 07, 2008, Princeton, NJ.

Preview

King, Andy (1994) A Synergistic Analysis for Sharing and Groundness which traces Linearity. In: European Symposium on Programming.

Preview Preview

King, Andy (1995) Share x Free Revisited. Technical report. UKC, University of Kent, Canterbury, UK

Preview Preview

King, Andy and Bryans, Jeremy (1998) Using Probability to Reason about Soft Deadlines. Technical report. University of Kent

Preview +1 more...

King, Andy and Longley, Mark (1995) Abstract Matching Can Improve on Abstract Unification. Technical report. UKC, University of Kent, Canterbury, UK

Preview Preview

King, Andy and Lu, L. and Genaim, S. (2006) Detecting Determinacy in Prolog Programs. In: Etalle, Sandro and Truszczynski, Mirek, eds. Logic Programming. Lecture Notes in Computer Science, 4079 . Springer-Verlag, Berlin, pp. 132-147. ISBN 978-3-540-36635-5.

Preview

King, Andy and Lu, L. and Genaim, S. (2005) Determinacy Inference by Suspension Inference. Technical report. , University of Kent

Preview

King, Andy and Martin, Jonathan C. (2006) Control Generation by Program Transformation. Fundamenta Informaticae, 69 (1-2). pp. 179-218. ISSN 0169-2968.

Preview

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

Preview Preview

King, Andy and Sondergaard, Harald (2008) Inferring Congruence Equations with SAT. Technical report. Springer, Berlin, Germany

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. Document Engineering. ACM New York, NY, USA pp. 57-66. ISBN 1-58113-938-1.

Preview

Kittler, J. and Hojjatoleslami, A. and Windeatt, T. (1997) Strategies for combining classifiers using shared and distinct representations. Pattern recognition letters, 18 (11-13). pp. 1373-1377. ISSN 0167-8655. The full text of this publication is not available from this repository.

Laemmel, Ralf and Thompson, Simon and Kaiser, Markus (2008) Programming errors in traversal programs over structured data. In: 8th Workshop on Language Description, Tools and Applications. The full text of this publication is not available from this repository.

Lai, L.M. and Watson, P. (1997) A case study in Timed CSP: the railroad crossing problem. In: Maler, O., ed. Hybrid and Real-Time Systems. Lecture Notes in Computer Science, 1201. Springer Verlag pp. 69-74. ISBN 3-540-62600-X. The full text of this publication is not available from this repository.

Lange, S. and Watson, P. (1994) Machine discovery in the presence of incomplete or ambiguous data. In: Algorithmic Learning Theory, Proceedings of the 5th International Workshop, Rheinhardsbrunn, Germany, 1994. The full text of this publication is not available from this repository.

Li, Huiqing and Reinke, Claus and Thompson, Simon (2003) Tool Support for Refactoring Functional Programs. In: ACM SIGPLAN 2003 Haskell Workshop. The full text of this publication is not available from this repository.

Li, Huiqing and Thompson, Simon (2005) Formalisation of Haskell Refactorings. In: van Eekelen, Marko and Hammond, Kevin, eds. Trends In Funtional Programming. ISBN 9781841501765. The full text of this publication is not available from this repository.

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. The full text of this publication is not available from this repository.

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, DEC 16-18, 2004, Louisville, KY. The full text of this publication is not available from this repository.

Li, Huiqing (2006) Refactoring Haskell Programs. Doctor of Philosophy (Ph.D.) thesis, University of Kent.

Preview

Li, Huiqing and Thompson, Simon (2006) A Comparative Study of Refactoring Haskell and Erlang Programs. In: Sixth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2006), Sep 27-29, 2006, Philadelphia, PA, .

Preview

Li, Huiqing and Thompson, Simon (2008) Clone Detection and Removal for Erlang/OTP within a Refactoring Environment. In: Draft Proceedings of the Ninth Symposium on Trends in Functional Programming(TFP).

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).

Preview

Li, Huiqing and Thompson, Simon (2009) Clone Detection and Removal for Erlang/OTP within a Refactoring Environment. In: Third International Workshop on Detection of Software Clones.

Preview

Li, Huiqing and Thompson, Simon (2007) Testing Erlang Refactorings with QuickCheck. In: Lecture Notes In Computer Science archive. Lecture Notes In Computer Science , 5083. Springer, Freiburg, Germany pp. 19-36. ISBN 978-3-540-85372-5 .

Preview

Li, Huiqing and Thompson, Simon (2008) Tool Support for Refactoring Functional Programs. In: Partial Evaluation and Program Manipulation, CA, Jan 07-08, 2008, San Francisco.

Preview

Li, Huiqing and Thompson, Simon (2008) Tool Support for Refactoring Functional Programs. In: Proceedings of the Second ACM SIGPLAN Workshop on Refactoring Tools, Jan 07-08, 2008, San Francisco, CA,.

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.

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: Proceedings of the Seventh ACM SIGPLAN Erlang Workshop, SEP 27, 2008, Victoria, Canada.

Preview

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

Preview

Li, Xuan and King, Andy and Lu, Lunjin (2006) Collapsing Closures. In: Etalle, Sandro and Truszczynski, Mirek, eds. Logic Programming. Lecture Notes in Computer Science, 4079 . Springer Berlin / Heidelberg, pp. 148-162. ISBN 978-3-540-36635-5.

Preview

Li, Xuan and King, Andy and Lu, Lunjin (2006) Correctness of Closure Collapsing. Technical report. Kent University, University of Kent, Canterbury, CT2 7NF 10.1007/11799573_13.

Preview

Li, Xuan and King, Andy and Lu, Lunjin (2006) Lazy Set-Sharing Analysis. In: Wadler, Philip and Hagiya, Masimi, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 3945 . Springer Berlin / Heidelberg, pp. 177-191. ISBN 978-3-540-33438-5.

Preview

Linington, P.F. and Derrick, J. and Bowman, H. (1996) The specification and conformance of ODP systems. In: 9th International Workshop on Testing of Communicating Systems.

Preview Preview

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

Preview Preview

Lins, R.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 available from this repository.

Lins, R.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 available from this repository.

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

Preview Preview

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

Preview Preview

Lins, R.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 available from this repository.

Lins, R.D. and Jones, Richard (1991) Cyclic Weighted Reference Counting. Technical report. UKC, University of Kent, Canterbury, UK The full text of this publication is not available from this repository.

Lins, R.D. and Jones, Richard (1993) Cyclic Weighted Reference Counting. In: WP & FP'93 Workshop on Parallel and Distributed Processing, Sofia, Bulgaria. The full text of this publication is not available from this repository.

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

Preview Preview

Lins, R.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 available from this repository.

Lins, R.D. and Thompson, Simon and Jones, S.L.P. (1994) On the Equivalence Between CMC and TIM. Journal of Functional Programming, 1 (4).

Preview Preview

Lins, R.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 available from this repository.

Lu, Lunjin and King, Andy (2005) Determinacy inference for logic programs. In: Sagiv, Mooly, ed. Programming Languages and Systems. Springer-Verlag, Berlin, pp. 108-123. ISBN 9783540254355. The full text of this publication is not available from this repository.

Lu, L. and King, A. (2002) Backward Type Inference Generalises Type Checking. In: Hermenegildo, M. and Puebla, G., eds. Static Analysis. Lecture Notes in Computer Science, 2477. Springer-Verlag, Berlin pp. 85-101. ISBN 978-3-540-44235-6.

Preview Preview

Lu, Lunjin and King, Andy (2004) Backward Pair Sharing Analysis. In: UNSPECIFIED, Apr 07-Jul 09, 2004, Nara, Japan .

Preview Preview

Lu, Lunjin and King, Andy (2004) Determinancy Inference for Logic Programs. Technical report. Springer , University of Kent

Preview Preview

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

Preview

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

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

Preview

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

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

Preview

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

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.

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

Preview

Martin, Jonathan.C. and King, Andy (2003) On Modular Termination Proofs. Technical report. University of Kent The full text of this publication is not available from this repository.

Martin, U.H. and Cohen, D.A. and Lai, M.K.F. and Norrie, K.J. and Watson, P. (1990) Case studies in equational reasoning. Technical report. The full text of this publication is not available from this repository.

Martin, J.M. and King, A.M. (1997) Generating Efficient, Terminating Logic Programs. In: 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 .

Preview Preview

Martin, Jon and King, Andy (1997) Inferring Numeric Relationships for Logic Program Transformation. In: Pre-conference proceedings of Logic Program Synthesis and Transformation.

Preview Preview

Martin, Jon and King, Andy (1997) Typed Norms for Typed Logic Programs. In: Logic Program Synthesis and Transformation, Aug 28-30, 1996, Stockholm, Sweden, .

Preview Preview

Martin, Jonathan.C. and King, Andy (2004) Control Generation by Program Transformation. Technical report. University of Kent, University of Kent, Canterbury, CT2 7NF

Preview Preview

Martin, Jonathan.C. and King, Andy (2004) On the Inference of Natural Level Mappings. In: Program Development in Computational Logic.

Preview Preview

Meira, Silvio Lemos (1991) Modular Extensions to Z. Technical report. UKC, University of Kent, Canterbury, UK The full text of this publication is not available from this repository.

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 available from this repository.

Meira, SRL and Cavalcanti, A.L.C. (1990) Modular Object-Oriented Z Specifications. In: Z User Workshop. The full text of this publication is not available from this repository.

Meira, SRL and Cavalcanti, A.L.C. (1992) MooZ Case Studies. In: Barden, R. and Stepney, S. and Cooper, D., eds. Object Orientation in Z, Workshops in Computing. Springer-Verlag, pp. 37-58. The full text of this publication is not available from this repository.

Meira, SRL and Cavalcanti, A.L.C. and Santos, CS (1994) The Unix Filing System: A MooZ Specification. In: Lano, K. and Haughton, H., eds. Object Oriented Specification Case Studies. Prentice-Hall, pp. 80-109. The full text of this publication is not available from this repository.

Meneses, L.C.S. and Soares, S. and Meneses, J.B. and Moura, H. and Cavalcanti, A.L.C. (2000) A Framework for Defining Object-oriented Languages using Action Semantics. In: 4th Brazilian Symposium on Programming Languages. The full text of this publication is not available from this repository.

Miarka, R. and Boiten, E.A. and Derrick, J. (2000) Guards, Preconditions, and Refinement in Z. In: ZB2000: Formal Specification and Development in Z and B / First International Conference of B and Z Users. The full text of this publication is not available from this repository.

Miarka, R. and Derrick, J. and Boiten, E.A. (2002) Handling Inconsistencies in Z using Quasi-Classical Logic. In: Berto, D. and Bowen, J.P. and Henson, M.C. and Robinson, K., eds. ZB 2002:Formal Specification and Development in Z and B. Lecture Notes in Computer Science, 2272. Springer-Verlag Berlin Heidelberg, Grenoble, France pp. 204-225. ISBN 3-540-43166-7. The full text of this publication is not available from this repository.

Miarka, Ralph (2002) Inconsistency and Underdefinedness in Z Specifications. Doctor of Philosophy (Ph.D.) thesis, University of Kent.

Preview Preview

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

Preview

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

Preview

Musicante, M.A. and Lins, R.D. (1992) GMC A Graph Categorical Multi-Combinator Machine. Technical report. , University of Kent, Canterbury, UK

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. Graph Drawing: 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28 2002. Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence. Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin pp. 374-375. ISBN 9783540001584.

Preview

Mutton, Paul and Rodgers, Peter (2002) Spring Embedder Preprocessing for WWW Visualization. In: Proceedings Information Visualization 2002.

Preview

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

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. The full text of this publication is not available from this repository.

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

Preview

Oliveira, M.V.M. and Cavalcanti, A.L.C. (2000) Tactics of Refinement. In: 14th Brazilian Symposium on Software Engineering, 4-6 October, 2000, Joao Pessoa - Paraiba - Brazil.

Preview

Oliver, Ian (2001) Animating Object Oriented Conceptual Models. Doctor of Philosophy (Ph.D.) thesis, Computing Laboratory. The full text of this publication is not available from this repository.

Partsch, H.A. and Boiten, E.A. (1991) A Note on Similarity of Specifications and Reusability of Transformational Developments. In: UNSPECIFIED. The full text of this publication is not available from this repository.

Patrascoiu, Octavian and Thompson, Simon and Rodgers, Peter (2005) Tableaux for Diagrammatic Reasoning. In: Proceedings of the 2005 International Workshop on Visual Languages and Computing.

Preview

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

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.

Preview Preview

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

Preview Preview

Poll, Erik (1998) Subtyping and Inheritance for Categorical Datatypes. In: Theories of Types and Proofs (TTP) - Kyoto.

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.

Preview +1 more...

Poll, Erik (1997) System F with Width-subtyping and Record Updating. In: Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software. Lecture Notes In Computer Science, 1281. Springer LNCS pp. 439-457. ISBN 3-540-63388-X .

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

Preview Preview

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

Preview Preview

Printezis, Tony and Jones, Richard (2002) GCspy: AN Adaptable Heap Visualisation Framework. In: Proceedings of OOPSLA'02 ACM Conference on Object-Oriented Systems, Languages and Applications, November 4-8, 2002, Seattle, Washington, USA.

Preview

Printezis, Tony and Jones, Richard (2002) GCspy: An Adaptable Heap Visualisation Framework. Technical report. Computing Laboratory, UKC, Canterbury

Preview Preview

Ramalho, G. and Barros, F. and Cavalcante, S. and Cavalcanti, A.L.C. (1999) Cyber Rally: An Experience of Democratic Use of the Internet. In: Bullinger, Hans-Jörg and Ziegler, Jürgen, eds. Human-Computer Interaction: Communication, Cooperation, and Application Design. Lawrence Erlbaum Associates pp. 402-406. The full text of this publication is not available from this repository.

Ratnarajah, N. and Simmons, A. and Davydov, O. and Hojjatoleslami, A. (2010) A Novel White Matter Fibre Tracking Algorithm Using Probabilistic Tractography and Average Curves. MICCAI, 6361 . pp. 666-673. ISSN 0302-9743. The full text of this publication is not available from this repository.

Reinke, Claus (2001) GHood -- Graphical Visualisation and Animation of Haskell Object Observations. In: ACM SIGPLAN Haskell Workshop, Firenze, Italy, September 2001, Firenze, Italy.

Preview Preview

Rizzo, M. (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 available from this repository.

Roberts, Jonathan and Boukhelifa, Nadia and Rodgers, Peter (2002) Multiform Glyph Based Search Result Visualization. In: Proceeding Information Visualization 2002.

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 available from this repository.

Rodgers, Peter (2000) Constructs for Programming with Graph Rewrites. In: GRATRA 2000: Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems.

Preview

Rodgers, Peter and Gaizauskas, R. and Humphreys, K. and Cunningham, H. (1997) Visual Execution and Data Visualisation in Natural Language Processing. In: Proceedings of the 1997 IEEE Symposium on Visual Languages (VL '97). VL. IEEE Computer Society pp. 342-347. ISBN 0-8186-8144-6 .

Preview

Rodgers, Peter and King, P.J.H. (1997) A Graph Rewriting Visual Language for Database Programming. The Journal of Visual Languages and Computing, 8 (6). pp. 641-674. ISSN 1045-926X .

Preview

Rodgers, Peter and Vidal, Natalia (2000) A Demonstration of the Grrr Graph Rewriting Programming Language. In: International Workshop on Applications of Graph Transformations with Industrial Relevance (Agtive99), Sep 01-03, 1999, Kerkrade, Netherlands.

Preview

Rodgers, Peter and Vidal, Natalia (2000) Graph Algorithm Animation with Grrr. In: International Workshop on Applications of Graph Transformations with Industrial Relevance (AGTIVE 99), Sep 01-03, 1999, Kerkrade, Netherlands .

Preview

Rodgers, Peter and Vidal, Natalia (1999) Pragmatic Graph Rewriting Modifications. In: Proceedings of the 1999 IEEE Symposium on Visual Languages, 13-16 Sept. 1999, Tokyo, Japan.

Preview

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

Preview Preview

Rodrigues, Helena C.C.D. and Jones, Richard (1997) Cyclic Distributed Garbage Collection with Group Merger. Technical report. University of Kent at Canterbury

Preview Preview

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

Preview Preview

Ryder, Chris and Thompson, Simon (2005) Software Metrics: Measuring Haskell. In: UNSPECIFIED. The full text of this publication is not available from this repository.

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

Preview Preview

Ryder, Chris (2004) Software Measurement for Functional Programming. Doctor of Philosophy (Ph.D.) thesis, Computing Lab, University of Kent.

Preview

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

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

Preview

Sampaio, A.C.A and Woodcock, J.C.P. and Cavalcanti, A.L.C. (2002) Refinement in Circus. In: Eriksson, L. and Lindsay, P.A., eds. FME 2002: Formal Methods - Getting IT Right. Lecture Notes in Computer Science, 1. Springer-Verlag, Berlin pp. 451-470. ISBN 9783540439288. The full text of this publication is not available from this repository.

Sanches, R. and Sette, SS and Cavalcanti, A.L.C. and Florissi, C. and Soares, PG and Melo, TCS (1987) A Language for a Relational Database Management System. In: 2nd Brazilian Symposium on Databases. The full text of this publication is not available from this repository.

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

Preview Preview

Schmitz, Partick and Thompson, Simon and King, Peter (2003) Presentation Dynamism in XML. In: UNSPECIFIED, 20-24 May 2003, Budapest, Hungary. The full text of this publication is not available from this repository.

Schneider, S.A. and Bryans, J.W. and Davies, J.W. (1994) A Failures Semantics for ET-LOTOS. Technical report. , Presented at the COST 247 - WG 6.1 working group meeting in Brighton

Preview

Shen, K. and Costa, V.Santos and King, A. (1998) Distance: a New Metric for Controlling Granularity for Parallel Execution. In: Joint International Conference and Symposium on Logic Programming, Jun 15-19, 1998, Manchester, England, .

Preview

Shen, Kish and Costa, Vitor Santos and King, Andy (1997) Distance: a New Metric for Controlling Granularity for Parallel Execution. Technical report. University of Kent at Canterbury

Preview Preview

Shen, Kish and Santos Costa, V'itor and King, Andy (1999) Distance: a New Metric for Controlling Granularity for Parallel Execution. Journal of Functional and Logic Programming, 1999 (specia).

Preview Preview

Sheriff, A. and Cavalcanti, A.L.C. and Moura, H. (2002) An Action Semantics for Timed CSPm. In: Proceedings of the 6th Brazilian Symposium on Programming Languages, June 5-7, 2002, Rio de Janeiro. The full text of this publication is not available from this repository.

Shibayama, Katsuyuki and Walczowski, L.T and Nalbantis, C. and Waller, W.A.J (1996) O-2 ADL: An object-oriented analog VLSI design language. In: 2nd International Conference on ASIC, Shanghai, Peoples R China. The full text of this publication is not available from this repository.

Shibayama, Katsuyuki and Jastrzebski, A.K. and Walczowski, L.T. and Barnaby, J. (1994) A Multi- Mode System for Gaas Circuis. In: 1994 IEEE International Symposium on Circuits and Systems, London, England. The full text of this publication is not available from this repository.

Silva, Josep and Chitil, Olaf (2006) Combining Algorithmic Debugging and Program Slicing. In: 8th ACM SIGPLAN international conference on Principles and practice of declarative programming, 10-12 July 2006, Venice, Italy. The full text of this publication is not available from this repository.

Simon, A. and Chitil, Olaf and Huch, F. (2000) Typeview: A Tool for Understanding Type Errors. In: Draft Proceedings of the 12th International Workshop on Implementation of Functional Languages.

Preview

Simon, A. and King, A. (2002) Analyzing String Buffers in C. In: International Conference on Algebraic Methodology and Software Technology, September 2002.

Preview Preview

Simon, A. and King, Andy and Howe, J.M. (2002) Two Variables per Linear Inequality as an Abstract Domain. In: Leuschel, M., 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.

Preview

Simon, Axel and King, Andy (2004) Convex Hull of Planar H-Polyhedra. International Journal of Computer Mathematics, 81 (4). pp. 259-271. ISSN 0020-7160.

Preview

Simon, Axel and King, Andy (2005) Exploiting Sparsity in Polyhedral Analysis. In: Twelfth International Static Analysis Symposium.

Preview

Simon, Axel and King, Andy (2007) Taming the Wrapping of Integer Arithmetic. In: File, Gilberto and Nielson, Hanne Riis, eds. Fourteenth International Static Analysis Symposium. Lecture Notes in Computer Science, 4634. Springer pp. 121-126. ISBN 978-3-540-74060-5 .

Preview

Simon, Axel and King, Andy (2006) Widening Polyhedra with Landmarks. In: Fourth Asian Symposium on Programming Languages and Systems.

Preview

Smart, N.P. (1996) How difficult is it to solve a Thue equation? In: 2nd International Symposium on Algorithmic Number Theory (ANTS-II), Talence, France. The full text of this publication is not available from this repository.

Smaus, J.G. and Hill, P. and King, A. (2000) Mode Analysis Domains for Typed Logic Programs. In: 9th International Workshop on Logic-Based Program Synthesis and Transformation (LOPSTR'99), Sep 22-24, 1999, Venice, Italy,.

Preview Preview

Smaus, J.G. and Hill, P. and King, A. (1999) Preventing instantiation errors and loops for logic programs with multiple modes using block declarations. In: 8th International Workshop on Logic-Based Program Synthesis and Transformation (LOPSTR 98), Jun 15-19, 1998, Manchester, England.

Preview Preview

Smaus, J.G. and Hill, P.M. and King, A. (1997) Domain Construction for Mode Analysis of Typed Logic Programs. Technical report. University of Kent

Preview

Smaus, J.G. and Hill, P.M. and King, A. (1998) Preventing Instantiation Errors and Loops for Logic Programs with Several Modes Using t block Declarations. University of Kent, University of Kent, Canterbury.

Preview Preview

Smaus, J.G. and Hill, P.M. and King, A. (1998) Termination of Logic Programs with block Declarations Running in Several Modes. In: Palamidessi, C., ed. Proceedings of the 10th International Symposium on Principles of Declarative Programming. Lecture Notes in Computer Science, 1490. Springer-Verlag, see also http://www.springer.de/comp/lncs/index.html pp. 73-88. ISBN 3-540-65012-1 .

Preview Preview

Smaus, J.G. and Hill, P.M. and King, A. (1998) Verification of Logic Programs with block Declarations Running in Several Modes. Technical report. University of Kent, Canterbury, CT2 7NF, United Kingdom

Preview Preview

Smaus, J.G. and Hill, P.M. and King, A. (2001) Verifying termination and error-freedom of logic programs with block declarations. Theory and Practice of Logic Programming, 1 (4). pp. 447-486.

Preview Preview

Smaus, Jan-Georg (1999) Modes and Types in Logic Programming. Doctor of Philosophy (Ph.D.) thesis, University of Kent at Canterbury.

Preview Preview

Smaus, Jan-Georg (1999) Proving Termination of Input-Consuming Logic Programs. In: De Schreye, Danny, ed. Logic Programming: Proceedings of the 1999 International Conference on Logic Programming. Logic Programming. MIT Press pp. 335-349. ISBN 0-262-54104-1.

Preview Preview

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

Preview Preview

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

Preview Preview

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

Preview Preview

Smith, G. and Derrick, J. (2001) Specification, refinement and verification of concurrent systems - an integration of Object-Z and CSP. Formal Methods in Systems Design, 18 (3). pp. 249-284. ISSN 0925-9856 . The full text of this publication is not available from this repository.

Smith, N.G (1996) The UK national Web cache - The state of the art. In: 5th International World Wide Web Conference (WWW5), Paris, France. The full text of this publication is not available from this repository.

Smith, G. and Derrick, J. (2002) Abstract Specification in Object-Z and CSP. In: George, C. and Miao, H., eds. Formal Methods and Software Engineering: 4th International Conference on Formal Engineering Methods, Icfem 2002 Shanghai, China, October 21-25, 2002. Lecture Notes in Computer Science, 2495. Springer, Berlin pp. 108-119. ISBN 3-540-00029-1. The full text of this publication is not available from this repository.

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

Preview Preview

Stapleton, G. and Howse, J. and Taylor, J. and Thompson, Simon (2004) The Expressiveness of Spider Diagrams. Journal of Logic and Computation, 14 (6). pp. 857-880. ISSN 0955-792X. The full text of this publication is not available from this repository.

Stapleton, G. and Howse, J. and Taylor, J. and Thompson, Simon (2004) The Expressiveness of Spider Diagrams Augmented with Constants. In: Visual Languages and Human Centric Computing, 2004 IEEE Symposium on. IEEE pp. 90-98. ISBN 0-7803-8696-5.

Preview

Stapleton, G. and Howse, J. and Taylor, J. 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. The full text of this publication is not available from this repository.

Stapleton, G. and Taylor, J. and Thompson, Simon and Howse, J. (2009) The expressiveness of spider diagrams augmented with constants. Journal of Visual Languages and Computing, 20 . pp. 30-49. The full text of this publication is not available from this repository.

Stapleton, G. and Thompson, Simon and Fish, A. and Howse, J. and Taylor, J. (2005) A New Language for the Visualization of Logic and reasoning. In: Proceedings of the 2005 International Workshop on Visual Languages and Computing.

Preview

Steen, M.W.A. and Bowman, H. and Derrick, J. (1995) Composition of LOTOS specifications. In: UNSPECIFIED. The full text of this publication is not available from this repository.

Steen, Maarten W.A. (1998) Consistency and Composition of Process Specifications. Doctor of Philosophy (Ph.D.) thesis, University of Kent at Canterbury. The full text of this publication is not available from this repository.

Steen, M. and Derrick, J. and Boiten, E.A. and Bowman, H. (1999) Consistency of partial process specifications. In: 7th International Conference on Algebraic Methodology and Software Technology (AMAST 98), Jan 04-08, 1999, Amazonia, Brazil.

Preview Preview

Steen, M.W.A. and Bowman, H. and Derrick, J. and Boiten, E.A. (1997) Disjunction of LOTOS specifications. In: Mizuno, T. and Shiratori, N. and Higashino, T. and Togashi, A., eds. IFIP Conference Proceedings; Vol. 107. Chapman & Hall, Osaka, Japan pp. 177-192. ISBN 0-412-82060-9 .

Preview

Steen, M.W.A. and Derrick, J. (1999) Applying the UML to the ODP Enterprise Viewpoint. Technical report. University of Kent at Canterbury

Preview Preview

Steen, M.W.A. and Derrick, J. (1999) Formalising ODP Enterprise Policies. In: 3rd International Enterprise Distributed Object Computing Conference (EDOC '99), Sep 27-30, 1999, Mannheim, Germany.

Preview Preview

Steen, M.W.A. and Derrick, J. (2000) ODP Enterprise Viewpoint Specification. Computer Standards and Interfaces, 22 (3). pp. 165-189. ISSN 0920-5489.

Preview

Stone, R.D and Morse, D.R (1996) A software development tool for parallel and distributed systems. In: 19th World-Occam-and-Transputer-User-Group Technical Meeting - Parallel Processing Developments (WoTUG-19), Nottingham, England. The full text of this publication is not available from this repository.

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 available from this repository.

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

Preview

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

Preview

Sultana, Nik and Thompson, Simon (2008) A Certified Refactoring Engine. In: Draft Proceedings of the Ninth Symposium on Trends in Functional Programming (TFP).

Preview

Sultana, Nik and Thompson, Simon (2008) Mechanical Verification of Refactorings. In: Workshop on Partial Evaluation and Program Manipulation, Jan 07-08, 2008, San Francisco, CA,.

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.

Preview

Taylor, C.N. and Boiten, E.A. and Derrick, J. (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. The full text of this publication is not available from this repository.

Taylor, Chris (1993) A Formal Logical Analysis of Causal Relations. University of Sussex,. The full text of this publication is not available from this repository.

Taylor, Chris (2000) Comparison of ODP Viewpoint Specifications: A Case Study. Technical report. The full text of this publication is not available from this repository.

Taylor, C. and Boiten, E. and Derrick, J. (2001) Interpreting ODP Viewpoint Specification: Observations from a Case Study. Technical report. UKC, University of Kent at Canterbury, UK

Preview Preview

Taylor, C. and Boiten, E.A. and Derrick, J. (2002) Interpreting ODP viewpoint specifications: Observations from a Case Study. In: Formal Methods for Open Object-Based Distributed Systems V, March 20-22, 2002, Enschede, The Netherlands. The full text of this publication is not available from this repository.

Taylor, Chris and Till, David (2000) A Semantics of Simultaneous Events (SSE) for State-Based Formal Specification. Formal Aspects of Computing .

Preview Preview

Telford, A.J. and Turner, D.A. (1999) Ensuring Termination in ESFP. In: 15th British Colloquium in Theoretical Computer Science, April 1999, Keele, England. The full text of this publication is not available from this repository.

Telford, A.J. and Johnson, C.W. (1996) Cross-viewpoint Consistency in Accident Investigations. Technical report. Department of Computer Science, University of Glasgow, Glasgow

Preview Preview

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

Preview Preview

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

Preview Preview

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

Preview

Telford, Alastair and Turner, David (1997) Ensuring Streams Flow. In: Algebraic Methodology and Software Technology, 6th International Conference, AMAST '97, Sydney Australia, December 1997.

Preview Preview

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

Preview +1 more...

Thomas, M. and Kirkwood, C. and Matthews, B. and Watson, P. (1993) Verification techniques for LOTOS: final report. Technical report. Department of Computing Science, University of Glasgow The full text of this publication is not available from this repository.

Thomas, M. and Watson, P. (1991) Generalising diverging sequences of rewrite rules by synthesising new sorts. In: Functional Programming, Glasgow 1990, Proceedings of the 1990 Glasgow Workshop on Functional Programming. The full text of this publication is not available from this repository.

Thomas, M. and Watson, P. (1992) Solving divergence in Knuth-Bendix completion by enriching signatures. In: Algebraic Methodology and Software Technology, Proceedings of the 2nd International Conference, Iowa City, U.S.A., 1991. The full text of this publication is not available from this repository.

Thomas, M. and Watson, P. (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 available from this repository.

Thomas, Stephen and Jones, Richard (1994) Garbage Collecting Shared Environment Closure Reducers. Technical report. Computing Laboratory, University of Kent at Canterbury The full text of this publication is not available from this repository.

Thomas, Stephen P. (1993) The Pragmatics of Closure Reduction. Doctor of Philosophy (Ph.D.) thesis, University of Kent at Canterbury. The full text of this publication is not available from this repository.

Thompson, Simon (1989) A Logic for Miranda. Formal Aspects of Computing (1). The full text of this publication is not available from this repository.

Thompson, Simon (1996) Haskell: The Craft of Functional Programming. Addison Wesley ISBN 0-201-40357-9. The full text of this publication is not available from this repository.

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 available from this repository.

Thompson, Simon (2001) Logic and Dependent Types in the Aldor Computer Algebra System. In: Symbolic Computation and Automated Reasoning, Aug 06-07, 2000, St Andrews, Scotland. The full text of this publication is not available from this repository.

Thompson, Simon (1995) Miranda: The Craft of Functional Programming. Addison Wesley ISBN 0-201-42279-4. The full text of this publication is not available from this repository.

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. The full text of this publication is not available from this repository.

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 available from this repository.

Thompson, Simon (2004) Refactoring Functional Programs. In: Advanced Functional Programming: 5th International School, AFP 2004, August 14-21, 2004, Estonia. The full text of this publication is not available from this repository.

Thompson, Simon (1991) Type Theory and Functional Programming. Addison Wesley ISBN 0-201-41667-0. The full text of this publication is not available from this repository.

Thompson, Simon and King, Peter and Cameron, Helen (2005) Modelling Reactive Multimedia: Design and Authoring. Multimedia Tools and Applications, 27 (1). pp. 23-52. ISSN 1380-7501. The full text of this publication is not available from this repository.

Thompson, Simon and Reinke, Claus (2003) A Case Study in Refactoring Functional Programs. In: VII Brazilian Symposium on Programming Languages, May 2003. The full text of this publication is not available from this repository.

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

Preview Preview

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

Preview Preview

Thompson, Simon (1992) Are subsets necessary in Martin-Lof type theory? In: UNSPECIFIED.

Preview Preview

Thompson, Simon (1997) Constructive interval temporal logic in Alf. In: Barringer, Howard, ed. Advances in temporal logic. Applied Logic. Kluwer pp. 377-390.

Preview Preview

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

Preview Preview

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

+1 more...

Thompson, Simon (1987) Interactive Functional Programs: a Method and a Formal Semantics. Technical report. Computing Laboratory, University of Kent, Canterbury, UK Access to this publication is restricted.

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

Preview Preview

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

Preview Preview

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

Preview Preview

Thompson, Simon (1997) em Where do I begin? A problem solving approach to teaching functional programming. In: First International Conference on Declarative Programming Languages in Education.

Preview +1 more...

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

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.

Preview Preview

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

Preview

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

Preview

Waller, W.A.J. and Aziz, S.M. (1994) A C-Testable Parallel Multipler Using Differencial Casecode Voltage Swish (DCVS) Logic. In: IFIP TC10/WG10.5 International Conference on Very Large Scale Integration (VLSI 93), Grenoble, France. The full text of this publication is not available from this repository.

Watson, P. (1997) Embeddings in the strong reducibilities between 1 and npm. Mathematical Logic Quarterly, 43 (4). pp. 559-568. ISSN 0942-5616 . The full text of this publication is not available from this repository.

Watson, P. (1999) Inductive Learning with Corroboration. In: Watanabe, O. and Yokomori, T., eds. Algorithmic Learning Theory, Proceedings of the 10th International Conference. Lecture Notes in Artificial Intelligence, 1720. Springer Verlag pp. 145-156. ISBN 3-540-66748-2. The full text of this publication is not available from this repository.

Watson, P. (1995) Inductive learning of recurrence-term languages from positive data. In: Jantke, K.P. and Lange, S., 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 available from this repository.

Watson, P. (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 available from this repository.

Watson, P. (2000) Review of Aizenstein, H. et al, `On learning read-k-satisfy-j DNF'. Mathematical Reviews (2000a:68060). The full text of this publication is not available from this repository.

Watson, P. (2000) Review of Ambainis A. et al, `Ordinal mind change complexity of language identification'. Mathematical Reviews (2000e:68079). The full text of this publication is not available from this repository.

Watson, P. (2000) Review of Case J., `The power of vacillation in language learning'. Mathematical Reviews (2000e:68081). The full text of this publication is not available from this repository.

Watson, P. (2000) Review of Schaefer M., `A guided tour of minimal indices and shortest descriptions'. Mathematical Reviews (2000b:03156). The full text of this publication is not available from this repository.

Watson, P. and Dick, A.J.J. (1989) Least sorts in order-sorted term rewriting. Technical report. British Computer Society 10.1093/comjnl/34.1.16 . The full text of this publication is not available from this repository.

Watson, P.R. (1988) Concerning T-degrees of d-r.e. sets and e-reducibility of Sigma<sub>2</sub> sets. Doctor of Philosophy (Ph.D.) thesis, University of Kent, Canterbury. The full text of this publication is not available from this repository.

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, S. and Sharma, A.. Mathematical Reviews (99m:68167). The full text of this publication is not available from this repository.

Watson, Phil (1999) Review of "Learning with refutation". Review of: Learning with refutation by Jain, S.. Mathematical Reviews (99m:68166). The full text of this publication is not available from this repository.

Watson, Phil (1999) Review of 'Approximation methods in inductive inference'. Review of: Approximation methods in inductive inference by Moser, W.R.. Mathematical Reviews (99g:68174). The full text of this publication is not available from this repository.

Watson, Phil (1999) Review of 'Learning via queries and oracles'. Review of: Learning via queries and oracles by Stephan, F.. Mathematical Reviews (99f:03056). The full text of this publication is not available from this repository.

Watson, Phil (1999) Review of 'On the relative sizes of learnable sets'. Mathematical Reviews (99c:68210). The full text of this publication is not available from this repository.

Watson, Phil (1999) Review of 'The structure of intrinsic complexity of learning'. Review of: The structure of intrinsic complexity of learning by Jain, S. and Sharma, A.. Mathematical Reviews S and A, (99k:03035). The full text of this publication is not available from this repository.

Watson, P. (1999) Inductive learning with corroboration. Technical report.

Preview Preview

Welch, P.H. and Wood, D.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.

Preview

Wilson, E. (1994) Using Corpora as a Resource in Language Teaching. In: Euro CALL 93 Conference, Hull, England. The full text of this publication is not available from this repository.

Woodcock, J.C.P. and Cavalcanti, A.L.C. (2002) The Semantics of Circus. In: Zb 2002: Formal Specification and Development in Z and B: 2nd International Conference of B and Z Users Grenoble. 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 available from this repository.

Zammit, Vincent (1997) A Comparative Study of Coq and HOL. In: Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics, TPHOLs'97, Murray Hill, NJ, USA, 19/08/1997, Murray Hill NJ , ETATS-UNIS .

Preview Preview

Zammit, Vincent (1996) A Mechanisation of Computability Theory in HOL. In: Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics.

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

Preview Preview

Zammit, Vincent (1999) On the Readability of Machine Checkable Formal Proofs. Doctor of Philosophy (Ph.D.) thesis, UNSPECIFIED.

Preview Preview

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 available from this repository.