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

A

Anshelevich, Elliot and Owens, Scott and Lamiraux, Florent and Kavraki, Lydia E. (2000) Deformable Volumes in Path Planning Applications. In: IEEE International Conference on Robotics and Automation (ICRA), 24 - 28 April 2000, San Francisco, CA, USA. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Arts, Thomas and Lamela Seijas, Pablo and Thompson, Simon (2011) Extracting QuickCheck Specifications from EUnit Test Cases. In: Erlang Workshop 2011. (Full text available)

Preview

Arts, Thomas and Thompson, Simon (2010) From Test Cases to FSMs: Augmented Test-driven Development and Property Inference. In: Erlang'10: Proceedings of the 2010 ACM SIGPLAN Erlang Workshop. (Full text available)

Preview

B

Barnes, Frederick R.M. (2009) Mobile Escape Analysis for occam-pi. In: Communicating Process Architectures 2009. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Barnes, Frederick R.M. and Pressnell, Thomas and Le Foll, Brendan (2013) Exploring GPGPU Acceleration of Process-Oriented Simulations. In: Communicating Process Architectures 2013, 25 Aug - 28 Aug 2013, Edinburgh Napier University, UK. (Full text available)

Preview

Barnes, Frederick R.M. and Ritson, Carl G. (2009) Checking Process-Oriented Operating System Behaviour using CSP and Refinement. SIGOPS Operating Systems Review, 43 (4). pp. 182-196. ISSN 0163-5980. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Barnes, Frederick R.M. and Ritson, Carl G. (2010) Process-Oriented Device Driver Development. Concurrency and Computation: Practice and Experience, 22 (8). pp. 182-196. ISSN 1532-0634. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Barrett, Edd and King, Andy (1992) Range Analysis of Binaries with Minimal Effort. In: Formal Methods for Industrial Critical Systems. Lecture Notes in Computer Science, 7437 . Springer, pp. 93-107. ISBN 978-3-642-32468-0. (Full text available)

Preview

Barrett, Edd and King, Andy (2012) Range and Set Abstraction using SAT. Electronic Notes in Theoretical Computer Science, 267 (1). pp. 93-107. ISSN 978-3-642-32468-0. (Full text available)

Preview

Batty, Mark and Memarian, Kayvan and Owens, Scott and Sarkar, Susmit and Sewell, Peter (2012) Clarifying and Compiling C/C++ Concurrency: From C++11 to POWER. In: POPL '12: 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 25th - 27th January, 2012, Philadelphia, USA. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Batty, Mark and Owens, Scott and Sarkar, Susmit and Sewell, Peter and Weber, Tjark (2011) Mathematizing C++ Concurrency. In: POPL '11: 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 26th - 28th 2011, Austin, USA. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Batty, Mark and Owens, Scott and Sarkar, Susmit and Sewell, Peter and Weber, Tjark (2010) Mathematizing C++ Concurrency: The Post-Rapperswil Model. Technical report. ISO IEC JTC1/SC22/WG21 N3132. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Benoy, Florence and King, Andy and Mesnard, Fred (2005) Computing Convex Hulls with a Linear Solver. Theory and Practice of Logic Programming, 5 (1-2). pp. 259-271. ISSN 1471-0684. (Full text available)

Preview

Biallas, Sebastian and Brauer, Jorg and King, Andy and Kowalewski, Stefan (2012) Loop Leaping with Closures. In: Min'e, Antoine and Schmidt, David A., eds. Static Analysis Symposium. Lecture Notes in Computer Science, 7460 . Springer, pp. 214-230. ISBN 978-3-642-33124-4. (Full text available)

Preview

Biallas, Sebastian and Brauer, Jorg and King, Andy and Kowalewski, Stefan (2012) Loop Leaping with Closures (proof appendix for conference submission). Technical report. University of Kent, School of Computing (Full text available)

Preview

Blanchette, Jasmin Christian and Weber, Tjark and Batty, Mark and Owens, Scott and Sarkar, Susmit (2011) Nitpicking C++ Concurrency. In: PPDP '11: Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bocchi, Laura and Chen, Tzu-Chun and Demangeon, Romain and Honda, Kohei and Yoshida, Nobuko (2013) Monitoring Networks through Multiparty Session Types. In: Formal Techniques for Distributed Systems. Springer-Verlag Berlin pp. 50-65. (Full text available)

Preview

Bocchi, Laura and Demangeon, Romain (2013) Embedding Session Types in HML. In: Programming Language Approaches to Concurrency and Communication-cEntric Software (PLACES), 23rd March, 2013, Rome, Italy. (Full text available)

Preview

Bocchi, Laura and Mahmud, Hoger and Rebay-Salisbury, Katharina and Tuosto, Emilio (2013) Virtual models for archaeology. Archeologia e Calcolatori, 24 (1). pp. 305-324. ISSN 1120-6861. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bocchi, Laura and Melgratti, Hernán (2014) On the Behaviour of General-Purpose Applications on Cloud Storages. In: Web Services and Formal Methods. Springer pp. 29-47. (Full text available)

Preview

Bocchi, Laura and Melgratti, Hernán (2014) On the behaviour of general purpose applications on cloud storages. Service Oriented Computing and Applications . ISSN 1863-2386. (In press) (Full text available)

Preview

Bocchi, Laura and Melgratti, Hernán and Tuosto, Emilio (2014) Resolving Non-Determinism in Choreographies. In: Programming Languages and Systems. Springer pp. 493-512. (Full text available)

Preview

Bocchi, Laura and Tuosto, Emilio (2014) Attribute-based transactions in service oriented computing. Mathematical Structures in Computer Science, FirstV (FirstV). pp. 1-47. ISSN 0960-1295. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bocchi, Laura and Yang, Weizhen and Yoshida, Nobuko (2014) Timed Multiparty Session Types. In: Concurrency Theory (CONCUR), September 2-5, 2014, Rome, Italy. (Full text available)

Preview

Boiten, Eerke (2012) Book review: Modeling in Event-B by Jean-Raymond Abrial. Journal of Functional Programming, 22 (2). pp. 217-221. ISSN 0956-7968. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke (2014) It’s possible to write flaw-free software, so why don’t we? . The Conversation UK Internet only. (Full text available)

Boiten, Eerke (2011) Perspicuity and Granularity in Refinement. In: Proceedings 15th International Refinement Workshop. (Full text available)

Preview

Boiten, Eerke (2010) Security specification: completeness, feasibility, refinement. In: Extended Abstracts Collection -- Refinement Based Methods for the Construction of Dependable Systems, Dagstuhl, Germany. (Full text available)

Preview

Boiten, Eerke and Butler, Michael and Derrick, John and Smith, Graeme (2010) Editorial: Special issue on REFINE 2007. Formal Aspects of Computing, 22 (1). pp. 182-196. ISSN 0934-5043. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke and Derrick, John (2013) From ODP Viewpoint Consistency to Integrated Formal Methods. Computer Standards and Interfaces, 35 (3). pp. 269-276. ISSN 0920-5489. (Full text available)

Preview

Boiten, Eerke and Derrick, John (2010) Incompleteness of Relational Simulations in the Blocking Paradigm. Science of Computer Programming, 75 (12). pp. 1262-1269. ISSN 0167-6423. (Full text available)

Preview

Boiten, Eerke and Derrick, John and Dong, Jin Song and Reeves, Steve (2012) Editorial: Special issue on Refine 2009. Formal Aspects of Computing, 24 (1). pp. 182-196. ISSN 0934-5043. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke and Derrick, John and Reeves, Steve (2009) Preface: Proceedings of the 14th BCS-FACS Refinement Workshop (REFINE 2009). Electronic Notes in Theoretical Computer Science, 259 . pp. 182-196. ISSN 1571-0661. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke and Derrick, John and Schellhorn, Gerhard (2011) Preface: Selected papers of the Refinement Workshop Turku (2008). Science of Computer Programming, 76 (9). pp. 182-196. ISSN 0167-6423. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke and Grundy, Dan (2010) The Logic of Large Enough. In: MPC 2010: Mathematics of Program Construction. (Full text available)

Preview

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

Boudeville, Olivier and Cesarini, Francesco and Chechina, Natalia and Lundin, Kenneth and Papaspyrou, Nikolaos and Sagonas, Konstantinos and Thompson, Simon and Trinder, Phil and Wiger, Ulf (2013) RELEASE: A High-level Paradigm for Reliable Large-scale Server Software. Trends in Functional Programming, 7829 . (Full text available)

Preview

Bourquin, Martial and King, Andy and Robbins, Ed (2013) BinSlayer: Accurate Comparison of Binary Executables. In: 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop, January 26, 2013, Rome, Italy. (Full text available)

Preview

Brauer, Jorg and King, Andy (2011) Approximate Quantifier Elimination for Propositional Boolean Formulae. In: Bobaru, Mihaela and Havelund, Klaus and Holzmann, Gerard and Joshi, Rajeev, eds. NASA Formal Methods. Lecture Notes in Computer Science, 6617 . Springer-Verlag, pp. 182-196. ISBN 978-3-642-20397-8. (Full text available)

Preview

Brauer, Jorg and King, Andy (2010) Automatic Abstraction for Intervals using Boolean Formulae. In: Cousot, Radhia and Martel, Matthieu, eds. Static Analysis Symposium. Lecture Notes in Computer Science, 6337 . Springer-Verlag, pp. 182-196. ISBN 978-3-642-15768-4. (Full text available)

Preview

Brauer, Jorg and King, Andy (2011) Transfer Function Synthesis without Quantifier Elimination. In: Barthe, Gilles, ed. European Symposium on Programming. Lecture Notes in Computer Science, 6602 . Springer-Verlag, pp. 182-196. ISBN 978-3-642-19717-8. (Full text available)

Preview

Brauer, Jorg and King, Andy (2012) Transfer Function Synthesis without Quantifier Elimination (long version). Logical Methods in Computer Science, 8 (2012). (Full text available)

Preview

Brauer, Jorg and King, Andy and Kowalewski, Stefan (2013) Abstract Interpretation of Microcontroller Code: Intervals meet Congruences. Science of Computer Programming, 78 (7). pp. 862-883. ISSN 0167-6423. (Full text available)

Preview

Brauer, Jorg and King, Andy and Kowalewski, Stefan (2010) Range Analysis of Microcontroller Code Using Bit-Level Congruences. : 15th International Workshop, FMICS 2010, Antwerp, Belgium, September 20-21, 2010. Proceedings. In: Kowalewski, Stefan and Roveri, Marco, eds. Formal Methods for Industrial Critical Systems. Lecture Notes in Computer Science, 6371 . Springer, pp. 82-98. ISBN 9783642158971. (Full text available)

Preview

Brauer, Jorg and King, Andy and Kriener, Jael (2011) Existential Quantification as Incremental SAT. In: Twenty Third International Conference on Computer Aided Verification. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Brauer, Jorg and King, Andy and Kriener, Jael (2011) Existential Quantification as Incremental SAT. : 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings. In: Gopalakrishnan, Ganesh and Qadeer, Shaz, eds. Computer Aided Verification. Lecture Notes in Computer Science, 6806 . Springer, pp. 191-207. ISBN 9783642221095. (Full text available)

Preview

Brown, Christopher and Li, Huiqing and Thompson, Simon (2010) An Expression Processor: A Case Study in Refactoring Haskell Programs. In: Eleventh Symposium on Trends in Functional Programming. (Full text available)

Preview

Brown, Christopher and Thompson, Simon (2010) Clone Detection and Elimination for Haskell. In: PEPM'10: Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation. (Full text available)

Preview

Brown, Neil C.C. (2009) Auto-Mobiles: Optimised Message-Passing. In: Communicating Process Architectures 2009. (Full text available)

Preview

Brown, Neil C.C. (2009) Automatically Generating CSP Models for Communicating Haskell Processes. In: UNSPECIFIED. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Brown, Neil C.C. (2009) Automatically Generating CSP Models for Communicating Haskell Processes. In: Automated Verification of Critical Systems 2009 (AVOCS09), September 23rd - 25th, 2009 , Swansea. (Full text available)

Preview

Brown, Neil C.C. (2004) C++CSP Networked. In: Communicating Process Architectures 2004. (Full text available)

Preview

Brown, Neil C.C. (2011) Combinators for Message-Passing in Haskell. In: Practical Aspects of Declarative Languages. Lecture Notes in Computer Science, 6359. Springer pp. 19-33. ISBN 9783642183775. (Full text available)

Preview

Brown, Neil C.C. (2011) Communicating Haskell Processes. Doctor of Philosophy (PhD) thesis, University of Kent. (Full text available)

Preview

Brown, Neil C.C. (2010) Conjoined Events. In: Advances in Message Passing 2010, June 6th, 2010, Toronto, Canada. (Full text available)

Preview

Brown, Neil C.C. (2006) Rain VM: Portable Concurrency through Managing Code. In: Communicating Process Architectures 2006. (Full text available)

Preview

Brown, Neil C.C. (2006) Rain: A New Concurrent Process-Oriented Programming Language. In: Communicating Process Architectures 2006. (Full text available)

Preview

Brown, Neil C.C. and Sampson, Adam T. (2009) Alloy: Fast Generic Transformations for Haskell. In: Haskell '09: Proceedings of the 2009 ACM SIGPLAN Haskell Symposium. (Full text available)

Preview

Brown, Neil C.C. and Smith, Marc L. (2009) Relating and Visualising CSP, VCR and Structural Traces. In: Communicating Process Architectures 2009. (Full text available)

Preview

C

Cesarini, Francesco and Thompson, Simon (2010) Erlang Behaviours: Programming With Process Design Patterns. In: Central European Functional Programming School, CEFP 2009. (Full text available)

Preview

Cesarini, Francesco and Thompson, Simon (2011) Erlang by Example. UNSPECIFIED. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Charles, Philip and King, Andy and Howe, Jacob M. (2009) Integer Polyhedra for Program Analysis. : 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings. In: Goldberg, Andrew and Zhou, Yunhong, eds. Algorithmic Aspects in Information and Management,. Lecture Notes in Computer Science, 5564 . Springer, pp. 85-99. ISBN 9783642021572. (Full text available)

Preview

Chawdhary, Aziem and Robbins, Ed and King, Andy (2014) Simple and Efficient Algorithms for Octagons. : The numerical domain of Octagons can be viewed as an exercise in simplicity: it trades expressiveness for efficiency and ease of implementation. The domain can represent unary and dyadic constraints where the coefficients are +1 or -1, so called octagonal constraints, and comes with operations that have cubic complexity. The central operation is closure which computes a canonical form by deriving all implied octagonal constraints from a given octagonal system. This paper investigates the role of incrementality, namely closing a system where only one constraint has been changed, which is a dominating use-case. We present two new incremental algorithms for closure both of which are conceptually simple and computationally efficient, and argue their correctness. In: Garrigue, Jacques, ed. Twelfth Asian Symposium on Programming Languages and Systems. Lecture Notes in Computer Science . Springer, pp. 1-18. (In press) (Full text available)

Preview

Chen, Kung and Weng, Shu-Chun and Lin, Jia-Yin and Wang, Meng and Khoo, Siau-Cheng (2011) Side-Effect Localization for Lazy, Purely Functional Languages via Aspects. Higher-Order and Symbolic Computation . pp. 1-39. ISSN 1388-3690. (Full text available)

Preview

Chen, Kung and Weng, Shu-Chun and Wang, Meng and Khoo, Siau-Cheng and Chen, Chung-Hsin (2007) A Compilation Model for Aspect-Oriented Polymorphically Typed Functional Languages. In: International Symposium on Static Analysis, August 22-24, 2007, Kongens Lyngby, Denmark. (Full text available)

Preview

Chen, Kung and Weng, Shu-Chun and Wang, Meng and Khoo, Siau-Cheng and Chen, Chung-Hsin (2010) Type-Directed Weaving of Aspects for Polymorphically Typed Functional Languages. Science of Computer Programming, 75 (11). pp. 1048-1076. ISSN 0167-6423. (Full text available)

Preview

Chitil, Olaf (2012) Practical Typed Lazy Contracts. In: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming (ICFP 2012). (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Chitil, Olaf (2011) StrictCheck: a Tool for Testing Whether a Function is Unnecessarily Strict. Technical report. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Chitil, Olaf (2011) A semantics for lazy assertions. In: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Culpepper, Ryan and Owens, Scott and Flatt, Matthew (2005) Syntactic Abstraction in Component Interfaces. In: Generative Programming and Component Engineering: 4th International Conference, GPCE 2005. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Cámara, Javier and Pedro, Correia and Vieira, Marco and Rogério, de Lemos (2014) Empirical Resilience Evaluation of an Architecture-based Self-adaptive Software System. In: Proceedings of the 10th International ACM Sigsoft Conference on Quality of Software Architectures. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

D

De Schreye, Danny and Janssens, Gerda (2012) PPDP '12 Proceedings of the 14th symposium on Principles and practice of declarative programming. In: 14th International Symposium on Association for Computing Machinery Principles and Practice of Declarative Programming, September 19-21, 2012, Leuven, Belgium. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Delaney, Aidan and Stapleton, Gem and Taylor, John and Thompson, Simon (2010) Fragments of Spider Diagrams of Order and their Relative Expressiveness. In: Diagrammatic Representation and Inference 6th International Conference, Diagrams 2010. (Full text available)

Preview

Delaney, Aidan and Stapleton, Gem and Taylor, John and Thompson, Simon (2013) On the expressiveness of spider diagrams and commutative star-free regular languages. Journal of Visual Languages and Computing, 24 (4). pp. 273-288. ISSN 1045-926X. (Full text available)

Preview

Delaney, Aidan and Stapleton, Gem and Taylor, John and Thompson, Simon (2014) A normal form for spider diagrams of order. Journal of Visual Languages and Computing, 25 (6). pp. 935-944. ISSN 1045-926X. (In press) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

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

Preview

Derrick, John and Boiten, Eerke (2014) Relational Concurrent Refinement Part III: Traces, partial relations and automata. Formal Aspects of Computing, 26 (2). pp. 407-432. ISSN 0934-5043. (Full text available)

Preview

Derrick, John and Boiten, Eerke (2009) Relational Concurrent Refinement: Automata. Electronic Notes in Theoretical Computer Science, 259 . pp. 182-196. ISSN 1571-0661. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Derrick, John and Boiten, Eerke (2011) Relational Concurrent Refinement: Timed Refinement. In: Formal Techniques for Distributed Systems, June 2011, Reykjavik. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Derrick, John and Walkinshaw, Neil and Arts, Thomas and Benac Earle, Clara and Cesarini, Francesco and Fredlund, Lars-Ake and Gulias, Victor and Hughes, John and Thompson, Simon (2010) Property-Based Testing - The ProTest Project. Formal Methods for Components and Objects, 6286 . pp. 250-271. ISSN 0302-9743. (Full text available)

Preview

Dimmich, Damian J. (2009) A Process Oriented Approach to Solving Problems of Parallel Decomposition and Distribution. Doctor of Philosophy (PhD) thesis, Computing. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Drienyovszky, Daniel and Horpacsi, Daniel and Thompson, Simon (2010) QuickChecking Refactoring Tools. In: Erlang�10: Proceedings of the 2010 ACM SIGPLAN Erlang Workshop. (Full text available)

Preview

Duan, Jianjun and Hurd, Joe and Li, Guodong and Owens, Scott and Slind, Konrad and Zhang, Junxing (2005) Functional Correctness Proofs of Encryption Algorithms. In: Logic for Programming, Artificial Intelligence, and Reasoning: 12th International Conference, LPAR 2005. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Duregard, Jonas and Jansson, Patrik and Wang, Meng (2012) Feat: Functional Enumeration of Algebraic Types. In: Haskell Symposium. (Full text available)

Preview

da Silva, Carlos Eduardo and de Lemos, Rogério (2009) Using dynamic workflows for coordinating self-adaptation of software systems. In: SEAMS '09: Proceedings of the 2009 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

G

Genaim, Samir and King, Andy (2003) Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. : 12th European Symposium on Programming, ESOP 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 Proceedings. In: Degano, Pierpaolo, ed. European Symposium on Programming. Lecture Notes in Computer Science . Springer, pp. 84-98. ISBN 9783540008866. (Full text available)

Preview

Genaim, Samir and King, Andy (2008) Inferring non-suspension conditions for logic programs with dynamic scheduling. ACM Transactions on Computational Logic, 9 (3). pp. 182-196. ISSN 1529-3785. (Full text available)

Preview

Gordon, Mike and Iyoda, Juliano and Owens, Scott and Slind, Konrad (2006) Automatic Formal Synthesis of Hardware from Higher Order Logic. Electronic Notes in Theoretical Computer Science, 145 (?). pp. 27-43. ISSN 1571-0661. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Gordon, Mike and Iyoda, Juliano and Owens, Scott and Slind, Konrad (2005) A Proof-Producing Hardware Compiler for a Subset of Higher Order Logic. In: Theorem Proving in Higher Order Logics: Emerging Trends Proceedings. (Full text available)

Preview

H

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

Preview

Heaton, Andrew and Hill, Pat and King, Andy (2000) Abstract Domains for Universal and Existential Properties. : 9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings. In: Smolka, Gert, ed. Programming Languages and Systems. Lecture Notes in Computer Science, 1782 . Springer, pp. 150-164. ISBN 9783540672623. (Full text available)

Preview

Hellyer, Laurence and Jones, Richard E. and Hosking, Antony L. (2010) The Locality of Concurrent Write Barriers (extended version). Technical report. , University of Kent, Canterbury, Kent CT2 7NF, UK 3-10. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hellyer, Laurence and Jones, Richard E. and Hosking, Antony L. (2010) The Locality of Concurrent Write Barriers. In: Proceedings of the 2010 International Symposium on Memory Management. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Hill, Pat and King, Andy (1997) Determinacy and Determinacy Analysis. Journal of Programming Languages, 5 (1). pp. 135-171. ISSN 0963-9306. (Full text available)

Preview

Hoverd, Tim and Sampson, Adam T. (2010) A Transactional Architecture for Simulation. In: ICECCS 2010: Fifteenth IEEE International Conference on Engineering of Complex Computer Systems. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2003) Efficient Groundness Analysis in Prolog. Theory and Practice of Logic Programming, 3 (1). pp. 95-124. ISSN 1471-0684. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2000) Implementing Groundness Analysis with Definite Boolean Functions. : 9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings. In: Smolka, Gert, ed. European Symposium on Programming. Lecture Notes in Computer Science, 1782 . Springer, pp. 200-214. ISBN 9783540672623. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2009) Logahedra: a New Weakly Relational Domain. : 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings. In: Zhiming, Lu and Anders, Ravn, eds. Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, 5799 . Springer, pp. 306-320. ISBN 9783642047602. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2011) A Pearl on SAT Solving in Prolog (Logic Programming Newsletter). Logic Programming Newsletter, 2011 (3). pp. 182-196. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2010) A Pearl on SAT Solving in Prolog. In: Blume, Matthias and Vidal, German, eds. Functional and Logic Programming. Lecture Notes in Computer Science . Springer-Verlag, pp. 182-196. ISBN 978-3-642-12250-7. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2012) A Pearl on SAT and SMT Solving in Prolog. Theoretical Computer Science, 435 . pp. 43-55. ISSN 0304-3975. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2012) Polyhedral Analysis using Parametric Objectives. In: Min'e, Antoine and Schmidt, David A., eds. Static Analysis Symposium. Lecture Notes in Computer Science, 7460 . Springer, pp. 41-57. ISBN 978-3-642-33124-4. (Full text available)

Preview

Howe, Jacob M. and King, Andy (2003) Three Optimisations for Sharing. Theory and Practice of Logic Programming, 3 (2). pp. 243-257. ISSN 1471-0684. (Full text available)

Preview

Howe, Jacob M. and King, Andy and Lawrence-Jones, Charles (2010) Quadtrees as an Abstract Domain. Electronic Notes in Theoretical Computer Science, 267 (1). pp. 182-196. (Full text available)

Preview

Howe, Jacob M. and King, Andy and Lu, Lunjin (2004) Analysing Logic Programs by Reasoning Backwards. : A Decade of Research Advances in Logic-Based Program Development. In: Bruynooghe, Maurice and Lau, Kung-Kiu, eds. Program Development in Computational Logic. Lecture Notes in Computer Science, 3049 . Springer, pp. 152-188. ISBN 9783540221524. (Full text available)

Preview

J

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

Preview

Jones, Richard E. and Hosking, Antony L. and Moss, Eliot (2012) The Garbage Collection Handbook: The Art of Automatic Memory Management. Chapman and Hall ISBN 978-1-4200-8279-1. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

K

Kahrs, Stefan (2010) Infinitary Rewriting: Foundations Revisited. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kahrs, Stefan (2013) Infinitary rewriting: closure operators, equivalences and models. Acta Informatica, 50 (2). pp. 123-156. ISSN 0001-5903. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kahrs, Stefan (2010) Modularity of Convergence and Strong Convergence in Infinitary Rewriting. Logical Methods in Computer Science, 6 (3). pp. 182-196. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kalibera, Tomas (2011) Replicating Real-time Garbage Collector. Concurrency and Computation: Practice and Experience, 23 (14). pp. 182-196. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kalibera, Tomas and Hagelberg, Jeff and Maj, Petr and Pizlo, Filip and Titzer, Ben and Vitek, Jan (2011) A family of real-time Java benchmarks. Concurrency and Computation: Practice and Experience, 23 (14). pp. 182-196. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kalibera, Tomas and Jones, Richard E. (2011) Handles revisited: optimising performance and memory costs in a real-time collector. In: Proceedings of the 10th International Symposium on Memory Management (ISMM), June 2011. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kalibera, Tomas and Jones, Richard E. (2012) Quantifying Performance Changes with Effect Size Confidence Intervals. Technical report. University of Kent, Kent 4--12. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kalibera, Tomas and Jones, Richard E. (2013) Rigorous Benchmarking in Reasonable Time. In: ACM SIGPLAN International Symposium on Memory Management (ISMM 2013), 20-12 June, 2013, Seattle, Washington, USA. (Full text available)

Preview

Kalibera, Tomas and Mole, Matthew and Jones, Richard E. and Vitek, Jan (2012) A Black-box Approach to Understanding Concurrency in DaCapo. In: Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA). (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kalibera, Tomas and Pizlo, Filip and Hosking, Antony L. and Vitek, Jan (2011) Scheduling real-time garbage collection on uniprocessors. ACM Transactions on Computer Systems, 29 (3). pp. 182-196. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kettle, Neil and King, Andy (2008) An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27 (4). pp. 764-777. ISSN 0278-0070. (Full text available)

Preview

Kettle, Neil and King, Andy (2006) An Anytime Symmetry Detection Algorithm for ROBDDs. In: Onodera, H., ed. Asia and South Pacific Design Automation Conference. IEEE Press pp. 243-248. ISBN 0780394518. (Full text available)

Preview

Kettle, Neil and King, Andy and Strzemecki, Tadeusz (2006) Widening ROBDDs with Prime Implicants. : 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006. Proceedings. In: Hermanns, Holger and Palsberg, Jens, eds. Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, 3920 . Springer, pp. 105-119. ISBN 9783540330561. (Full text available)

Preview

Kilov, Haim and Linington, Peter F. and Romero, José Raúl and Tanaka, Akira and Vallecillo, Antonio (2013) The Reference Model of Open Distributed Processing: Foundations, experience and applications. Computer Standards and Interfaces, 35 (3). pp. 247-256. ISSN 0920-5489. (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

King, Andy (1994) High Precision Sharing Analysis. Journal of Programming Languages, 2 (1). pp. 149-191. ISSN 0963-9306. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

King, Andy (2000) Pair-sharing over rational trees. Journal of Logic Programming, 46 (1-2). pp. 139-155. ISSN 0743-1066. (Full text available)

Preview

King, Andy and Lu, Lunjin (2002) A Backward Analysis for Constraint Logic Programs. Theory and Practice of Logic Programming, 2 (4-5). pp. 517-547. ISSN 1471-0684. (Full text available)

Preview

King, Andy and Lu, Lunjin (2003) Forward versus Backward Verification of Logic Programs. : 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003. Proceedings. In: Palamidessi, Catuscia, ed. Logic Programming. Lecture Notes in Computer Science, 2916 . Springer, pp. 315-330. ISBN 9783540206422. (Full text available)

Preview

King, Andy and Lu, Lunjin and Genaim, Samir (2006) Detecting Determinacy in Prolog Programs. : 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006. Proceedings. In: Etalle, Sandro and Truszczynski, Mirek, eds. Logic Programming. Lecture Notes in Computer Science, 4079 . Springer, pp. 132-147. ISBN 9783540366355. (Full text available)

Preview

King, Andy and Smaus, Jan-Georg and Hill, Pat (1999) Quotienting Share for Dependency Analysis. : 8th European Symposium on Programming, ESOP’99 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS’99 Amsterdam, The Netherlands, March 22–28, 1999 Proceedings. In: Swierstra, Doaitse, ed. Programming Languages and Systems. Lecture Notes in Computer Science, 1576 . Springer, pp. 59-73. ISBN 9783540656999. (Full text available)

Preview

King, Andy and Sondergaard, Harald (2010) Automatic Abstraction for Congruences. In: Barthe, Gilles and Hermenegildo, Manuel V., eds. Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science (5944). Springer-Verlag, pp. 182-196. ISBN 978-3-642-11318-5. (Full text available)

Preview

King, Andy and Sondergaard, Harald (2008) Inferring Congruence Equations using SAT. : 20th International Conference, CAV 2008 Princeton, NJ, USA, July 7-14, 2008 Proceedings. In: Gupta, Aarti and Malik, Sharad, eds. Computer-Aided Verification. Lecture Notes in Computer Science, 5123 . Springer, pp. 281-293. ISBN 9783540705437. (Full text available)

Preview

King, Andy and Soper, Paul (1992) Ordering Optimizations for Concurrent Logic Programs. In: Nerode, Anil and Taitslin, Michael, eds. Logical Foundations of Computer Science. Lecture Notes in Computer Science, 620 . Springer, pp. 221-228. ISBN 9783540557074. (Full text available)

Preview

Kriener, Jael and King, Andy (2011) Determinacy Inference for Prolog (appendix for conference submission). University of Kent, School of Computing, Canterbury, CT1 7NF, UK (Full text available)

Preview

Kriener, Jael and King, Andy (2012) Mutual Exclusion by Interpolation. In: Eleventh International Symposium on Functional and Logic Programming. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Kriener, Jael and King, Andy (2012) Mutual Exclusion by Interpolation. : 11th International Symposium, FLOPS 2012, Kobe, Japan, May 23-25, 2012, Proceedings. In: Schrijvers, Tom and Thiemann, Peter, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 7294 . Springer, pp. 182-196. ISBN 9783642298219. (Full text available)

Preview

Kriener, Jael and King, Andy (2011) RedAlert: Determinacy Inference for Prolog. In: 27th International Conference on Logic Programming, July 6-10, 2011, LEXINGTON, KENTUCKY, USA. (Full text available)

Preview

Kriener, Jael and King, Andy (2011) RedAlert: Determinacy Inference for Prolog. Theory and Practice of Logic Programming, 11 (4-5). pp. 182-196. (Full text available)

Preview

Kriener, Jael and King, Andy (2014) Semantics for Prolog with Cut – Revisited. In: Sumii, Eijiro and Codish, Michael, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 8475 . Springer, pp. 270-284. ISBN 9783319071510. (Full text available)

Preview

Kriener, Jael and King, Andy and Blazy, Sandrine (2013) Proofs You Can Believe In: Proving Equivalences Between Prolog Semantics in Coq. In: Schrijvers, Tom, ed. Principles and Practice of Declarative Programming. ACM Press, New York pp. 37-48. ISBN 9781450321549. (Full text available)

Preview

Kriener, Jael and King, Andy and Blazy, Sandrine (2014) Proofs You Can Believe In: Proving Equivalences Between Prolog Semantics in Coq (long version). Science of Computer Programming . ISSN 0167-6423. (Submitted) (Full text available)

Preview

Kumar, Ramana and Arthan, Rob and Myreen, Magnus O. and Owens, Scott (2014) HOL with Definitions: Semantics, Soundness, and a Verified Implementation. In: Fifth International Conference on Interactive Theorem Proving, 14-17 July 2014, Vienna, Austria. (Full text available)

Preview

Kumar, Ramana and Myreen, Magnus O. and Norrish, Michael and Owens, Scott (2014) CakeML: A Verified Implementation of ML. In: 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 22-24, 2014, San Diego, California, USA. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

L

Lamela Seijas, Pablo and Li, Huiqing and Thompson, Simon (2013) Towards Property-Based Testing of RESTful Web Services. Technical report. School of Computing, University of Kent (Unpublished) (Full text available)

Preview

Lamela Seijas, Pablo and Li, Huiqing and Thompson, Simon (2013) Towards property-based testing of RESTful web services. In: Proceedings of the twelfth ACM SIGPLAN workshop on Erlang - Erlang '13. pp. 77-78. (Full text available)

Preview

Lamela Seijas, Pablo and Thompson, Simon and Taylor, Ramsay and Bogdanov, Kirill and Derrick, John (2014) Synapse: automatic behaviour inference and implementation comparison for Erlang. Technical report. University of Kent (Unpublished) (Full text available)

Preview

Li, Guodong and Owens, Scott and Slind, Konrad (2007) Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic. In: Programming Languages and Systems: 16th European Symposium on Programming, ESOP 2007. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Li, Huiqing and Lindberg, Adam and Schumacher, Andreas and Thompson, Simon (2009) Improving your test code with Wrangler. Technical report. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2012) Automated API migration in a user-extensible refactoring tool for Erlang programs. In: the 27th IEEE/ACM International Conference on Automated Software Engineering, September 2012, Essen, Germany. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2011) A Domain-Specific Language for Scripting Refactorings in Erlang. Technical report. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2012) A Domain-Specific Language for Scripting Refactorings in Erlang. In: 15th Fundamental Approaches to Software Engineering(FASE2012). (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2010) Improved Testing Through Refactoring: Experience from the ProTest project. In: Testing - Practice and Research Techniques: 5th International Academic and Industrial Conference, TAIC PART 2010. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2014) Improved semantics and implementation through property-based testing with QuickCheck. In: Proceedings of the 9th International Workshop on Automation of Software Test - AST 2014. pp. 50-56. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2011) Incremental Code Clone Detection and Elimination for Erlang Programs. In: Proceedings of the Conference on Fundamental Approaches to Software Engineering (FASE'11). (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2012) Let's Make Refactoring Tools User-extensible! In: The Fifth ACM Workshop on Refactoring Tools. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2013) Multicore Profiling for Erlang Programs Using Percept2. In: Erlang Workshop 2013, 28 September 2013, Boston, USA. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2010) Refactoring Support for Modularity Maintenance in Erlang. In: Tenth IEEE International Working Conference on Source Code Analysis and Manipulation. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2015) Safe Concurrency Introduction through Slicing. In: Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation - PEPM '15. ACM SIGPLAN pp. 103-113. ISBN 978-1-4503-3297-2. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Li, Huiqing and Thompson, Simon (2010) Similar Code Detection and Elimination for Erlang Programs. In: Practical Aspects of Declarative languages 2010. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2009) Testing-framework-aware Refactoring. In: The Third ACM Workshop on Refactoring Tools. (Full text available)

Preview

Li, Huiqing and Thompson, Simon (2011) A User-extensible Refactoring Tool for Erlang Programs. Technical report. (Full text available)

Preview

Li, Huiqing and Thompson, Simon and Arts, Thomas (2011) Extracting Properties from Test Cases by Refactoring. In: Proceedings of the Refactoring and Testing Workshop (RefTest 2011). (Full text available)

Preview

Li, Huiqing and Thompson, Simon and Lamela Seijas, Pablo and Francisco, Miguel Angel (2014) Automating property-based testing of evolving web services. In: Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation - PEPM '14. pp. 169-180. (Full text available)

Preview

Li, Xuan and King, Andy and Lu, Lunjin (2006) Collapsing Closures. : 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006. Proceedings. In: Etalle, Sandro and Truszczynski, Mirek, eds. Logic Programming. Lecture Notes in Computer Science, 4079 . Springer, pp. 148-162. ISBN 9783540366355. (Full text available)

Preview

Li, Xuan and King, Andy and Lu, Lunjin (2006) Lazy Set-Sharing Analysis. : 8th International Symposium, FLOPS 2006, Fuji-Susono, Japan, April 24-26, 2006. Proceedings. In: Wadler, Philip and Hagiya, Masimi, eds. Functional and Logic Programming. Lecture Notes in Computer Science, 3945 . Springer, pp. 177-191. ISBN 9783540334385. (Full text available)

Preview

Linington, Peter F. (2010) The Stereochemistry of Enterprise Objects. In: Enterprise Distributed Object Computing Conference Workshops - WODPEC 2010. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Linington, Peter F. and Milosevic, Zoran and Tanaka, Akira and Vallecillo, Antonio (2011) Building Enterprise Systems with ODP - An Introduction to Open Distributed Processing. Innovation in Software Engineering and Software Development . Chapman and Hall/CRC Press ISBN 978-1-4398-6625-2. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Linington, Peter F. and Miyazaki, Hiroshi and Vallecillo, Antonio (2012) Obligations and Delegation in the ODP Enterprise Language. In: EDOC Workshops 2012: VORTE, September 10-14 2012, Beijing, China. (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Lu, Lunjin and King, Andy (2004) Backward Pair Sharing Analysis. : 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004. Proceedings. In: Kameyama, Yukiyoshi and Stuckey, Peter, eds. Functional and Logic Programming. Lecture Notes in Computer Science . Springer, pp. 132-146. ISBN 9783540214021. (Full text available)

Preview

Lu, Lunjin and King, Andy (2005) Determinacy Inference for Logic Programs. : 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005. Proceedings. In: Sagiv, Shmuel, ed. European Symposium on Programming. Lecture Notes in Computer Science, 3444 . Springer, pp. 108-123. ISBN 9783540254355. (Full text available)

Preview

M

Mador-Haim, Sela and Maranget, Luc and Sarkar, Susmit and Memarian, Kayvan and Alglave, Jade and Owens, Scott and Alur, Rajeev and Martin, Milo M. K. and Sewell, Peter and Williams, Derek (2012) An Axiomatic Memory Model for POWER Multiprocessors. In: Computer Aided Verification, 24th International Conference, CAV 2012, July 7th-13th, 2012, Berkeley, California, USA. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Martin, Jonthan C. and King, Andy (2004) On the Inference of Natural Level Mappings. : A Decade of Research Advances in Logic-Based Program Development. In: Bruynooghe, Maurice and Lau, Kung-Kiu, eds. Program Development in Computational Logic,. Lecture Notes in Computer Science, 3049 . Springer, pp. 432-452. ISBN 9783540221524. (Full text available)

Preview

Matsuda, Kazutaka and Wang, Meng (2013) Bidirectionalization for Free with Runtime Recording. : Or, a Light-Weight Approach to the View-Update Problem. In: Symposium on Principles and Practice of Declarative Programming (PPDP). (Full text available)

Preview

Matsuda, Kazutaka and Wang, Meng (2014) “Bidirectionalization for Free” for Monomorphic Transformations. Science of Computer Programming . ISSN 0167-6423. (In press) (Full text available)

Preview

Matsuda, Kazutaka and Wang, Meng (2013) FliPpr: A Prettier Invertible Printing System. In: European Symposium on Programming (ESOP). (Full text available)

Preview

Mulligan, Dominic P. and Owens, Scott and Gray, Kathryn E. and Ridge, Tom and Sewell, Peter (2014) Lem: reusable engineering of real-world semantics. In: The 19th ACM SIGPLAN International Conference on Functional Programming, September 2014, Gothenburg, Sweden. (Full text available)

Preview

Myreen, Magnus O. and Owens, Scott (2012) Proof-Producing Synthesis of ML from Higher-Order Logic. In: ICFP '12: 17th ACM SIGPLAN International Conference on Functional Programming, September 10th - 12th, 2012, Copenhagen, Denmark. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Myreen, Magnus O. and Owens, Scott (2014) Proof-producing translation of higher-order logic into pure and stateful ML. Journal of Functional Programming, 24 (2-3). pp. 284-315. ISSN 0956-7968. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Myreen, Magnus O. and Owens, Scott and Kumar, Ramana (2013) Steps Towards Verified Implementations of HOL Light (Rough Diamond). In: Interactive Theorem Proving: Fourth International Conference. ITP 2013, July 22-26, 2013. , Rennes, France. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

N

Neykova, Rumyana and Bocchi, Laura and Yoshida, Nobuko (2014) Timed Runtime Monitoring for Multiparty Conversations. In: International Workshop on Behavioural Types (BEAT), 1st September, 2014, Rome, Italy. (Full text available)

Preview

O

Oliveira, Bruno and Wang, Meng and Gibbons, Jeremy (2008) The VISITOR Pattern as a Reusable, Generic, Type-Safe Component. In: ACM SIGPLAN conference on Object-oriented programming systems languages and applications, 2008-10-19. (Full text available)

Preview

Owens, Scott (2007) Compile-time Information in Software Components. Doctor of Philosophy (PhD) thesis, University of Utah. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Owens, Scott (2010) Reasoning about the Implementation of Concurrency Abstractions on x86-TSO. In: ECOOP 2010 —- Object-Oriented Programming, 24th European Conference, June 21st-25th, 2010, Maribor, Slovenia. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Owens, Scott (2008) A Sound Semantics for OCaml light. In: 17th European Symposium on Programming, ESOP 2008, March 29th - April 6th, 2008, Budapest, Hungary. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Owens, Scott and Boehm, Peter and Zappa Nardelli, Francesco and Sewell, Peter (2011) Lem: A Lightweight Tool for Heavyweight Semantics (Rough Diamond). In: Interactive Theorem Proving: Second International Conference, ITP 2011. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Owens, Scott and Flatt, Matthew (2006) From Structures and Functors to Modules and Units. In: ICFP '06: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Owens, Scott and Flatt, Matthew and Shivers, Olin and McMullan, Benjamin (2004) Lexer and Parser Generators in Scheme. In: Scheme 2004: Proceedings of the Fifth Workshop on Scheme and Functional Programming. (Full text available)

Preview

Owens, Scott and Peskine, Gilles (2007) Verifying Type Soundness for OCaml: The Core Language. In: 2nd Informal ACM SIGPLAN Workshop on Mechanizing Metatheory. (Unpublished) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Owens, Scott and Reppy, John and Turon, Aaron (2009) Regular-expression Derivatives Re-examined. Journal of Functional Programming, 19 (2). pp. 173-190. ISSN 0956-7968. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Owens, Scott and Sarkar, Susmit and Sewell, Peter (2009) A Better x86 Memory Model: x86-TSO (Extended Version). Technical report. University of Cambridge, Computer Laboratory UCAM-CL-TR-745. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Owens, Scott and Sarkar, Susmit and Sewell, Peter (2009) A Better x86 Memory Model: x86-TSO. In: 22nd International Conference, TPHOLs 2009, August 17th - 20th, 2009, Munich, Germany. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Owens, Scott and Slind, Konrad (2008) Adapting Functional Programs to Higher-Order Logic. Higher-Order and Symbolic Computation, 21 (4). pp. 377-409. ISSN 1388-3690. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Owens, Scott and Slind, Konrad (2003) Proving as Programming with DrHOL: A Preliminary Design. In: User Interfaces for Theorem Provers: International Workshop UITP '03, 8th September 2003. (Full text available)

Preview

P

Polack, Fiona A.C. and Andrews, Paul S. and Ghetiu, Teodor and Read, Mark and Stepney, Susan and Timmis, Jon and Sampson, Adam T. (2010) Reflections on the Simulation of Complex Systems for Science. In: ICECCS 2010: Fifteenth IEEE International Conference on Engineering of Complex Computer Systems. (Full text available)

Preview

R

Ritson, Carl G. and Barnes, Frederick R.M. (2013) An Evaluation of Intel's Restricted Transactional Memory for CPAs. In: Communicating Process Architectures 2013, 25 Aug - 28 Aug 2013, Edinburgh Napier University, UK. (Full text available)

Preview

Ritson, Carl G. and Sampson, Adam T. and Barnes, Frederick R.M. (2012) Multicore scheduling for lightweight communicating processes. Science of Computer Programming, 77 (6). pp. 727-740. ISSN 0167-6423. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Ritson, Carl G. and Ugawa, Tomoharu and Jones, Richard E. (2014) Exploring Garbage Collection with Haswell Hardware Transactional Memory. In: ACM/SIGPLAN International Symposium on Memory Management (ISMM14), 12 June 2014, Edinburgh, UK. (In press) (Full text available)

Preview

Ritson, Carl G. and Welch, Peter H. (2010) A Process-Oriented Architecture for Complex System Modelling. Concurrency and Computation: Practice and Experience, 22 . pp. 182-196. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Robbins, Ed and Howe, Jacob M. and King, Andy (2014) Theory Propagation and Reification. Science of Computer Programming . ISSN 0167-6423. (In press) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Robbins, Ed and King, Andy and Jacob, Howe (2013) Theory Propagation and Rational-Trees. In: Schrijvers, Tom, ed. Principles and Practice of Declarative Programming. ACM Press, New York pp. 193-204. ISBN 9781450321549. (Full text available)

Preview

Rodgers, Peter and Baker, Robert and Thompson, Simon and Li, Huiqing (2013) Multi-level Visualization of Concurrent and Distributed Computation in Erlang. In: Visual Languages and Computing (VLC) in The 19th International Conference on Distributed Multimedia Systems (DMS 2013), 8-10 August 2013, Brighton. (Full text available)

Preview

Runnalls, Andrew R. (2010) Aspects of CXXR Internals. Computational Statistics, 26 (3). pp. 182-196. ISSN 0943-4062. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Runnalls, Andrew R. (2010) CXXR and Add-On Packages. UNSPECIFIED. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

S

Sarkar, Susmit and Memarian, Kayvan and Owens, Scott and Batty, Mark and Sewell, Peter and Maranget, Luc and Alglave, Jade and Williams, Derek (2012) Synchronising C/C++ and POWER. In: PLDI '12: 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, 11th-16th June, 2012, Beijing, china. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Sarkar, Susmit and Sewell, Peter and Zappa Nardelli, Francesco and Owens, Scott and Ridge, Tom and Braibant, Thomas and Myreen, Magnus O. and Alglave, Jade (2009) The Semantics of x86-CC Multiprocessor Machine Code. In: POPL '09: 36th annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 21st - 23rd, 2009, Savannah, Georgia, USA. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Sewell, Peter and Sarkar, Susmit and Owens, Scott and Zappa Nardelli, Francesco and Myreen, Magnus O. (2010) x86-TSO: A Rigorous and Usable Programmer's Model for x86 Multiprocessors. Communications of the ACM, 53 (7). pp. 89-97. ISSN 0001-0782. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Sewell, Peter and Zappa Nardelli, Francesco and Owens, Scott and Peskine, Gilles and Ridge, Thomas and Sarkar, Susmit and Strniša, Rok (2010) Ott: Effective Tool Support for the Working Semanticist. Journal of Functional Programming, 20 (1). pp. 71-122. ISSN 0956-7968. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Sewell, Peter and Zappa Nardelli, Francesco and Owens, Scott and Peskine, Gilles and Ridge, Thomas and Sarkar, Susmit and Strniša, Rok (2007) Ott: Effective Tool Support for the Working Semanticist. In: ICFP '07: Proceedings of the 2007 ACM SIGPLAN International Conference on Functional Programming. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Shen, Kish and Santos Costa, Vitor and King, Andy (1999) Distance: a New Metric for Controlling Granularity for Parallel Execution. Journal of Functional and Logic Programming, 1999 . pp. 1-23. ISSN 1080-5230. (Full text available)

Preview

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

Preview

Simon, Axel and King, Andy (2005) Exploiting Sparsity in Polyhedral Analysis. : 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005. Proceedings. In: Hankin, Chris and Siveroni, Igor, eds. Static Analysis Symposium. Lecture Notes in Computer Science, 3672 . Springer, pp. 336-351. ISBN 9783540285847. (Full text available)

Preview

Simon, Axel and King, Andy (2007) Taming the Wrapping of Integer Arithmetic. : 14th International Symposium, SAS 2007, Kongens Lyngby, Denmark, August 22-24, 2007. Proceedings. In: File, Gilberto and Nielson, Hanne Riis, eds. Static Analysis Symposium. Lecture Notes in Computer Science, 4634 . Springer, pp. 182-196. ISBN 9783540740605. (Full text available)

Preview

Simon, Axel and King, Andy (2007) Widening Polyhedra with Landmarks. : 4th Asian Symposium, APLAS 2006, Sydney, Australia, November 8-10, 2006. Proceedings. In: Kobayashi, Naoki, ed. Asian Symposium on Programming Languages and Systems. Lecture Notes in Computer Science, 4279 . Springer, pp. 166-182. ISBN 9783540489375. (Full text available)

Preview

Simon, Axel and King, Andy and Howe, Jacob M. (2010) The Two Variable Per Inequality Abstract Domain. Higher-Order and Symbolic Computation, 31 (1). pp. 182-196. (Full text available)

Preview

Simpson, Jonathan and Ritson, Carl G. (2009) Toward Process Architectures for Behavioural Robotics. In: Communicating Process Architectures 2009. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Singer, Jeremy and Jones, Richard E. (2011) Economic Utility Theory for Memory Management Optimization. In: Proceedings of the workshop on Implementation, Compilation, Optimization of Object-Oriented Languages and Programming Systems. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Singer, Jeremy and Jones, Richard E. (2010) The Economics of Garbage Collection. In: Proceedings of the 2010 International Symposium on Memory Management. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Singh, Ranjeet and King, Andy (2014) Partial Evaluation for Java Malware Detection. In: Proietti, Maurizio and Seki, Hirohisa, eds. Twenty fourth International Symposium on Logic-Based Program Synthesis and Transformation. Lecture Notes in Computer Science . Springer. (In press) (Full text available)

Preview

Slind, Konrad and Li, Guodong and Owens, Scott (2010) Compiling Higher Order Logic by Proof. In: Design and Verification of Microprocessor Systems for High-Assurance Applications. Springer, pp. 193-220. ISBN 978-1-4419-1539-9. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Slind, Konrad and Owens, Scott and Iyoda, Juliano and Gordon, Mike (2007) Proof Producing Synthesis of Arithmetic and Cryptographic Hardware. Formal Aspects of Computing, 19 (3). pp. 343-362. ISSN 0934-5043. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Smaus, Jan-Georg and Hill, Pat and King, Andy (2001) Verifying termination and error-freedom of logic programs with block declarations. Theory and Practice of Logic Programming, 1 (4). pp. 447-486. ISSN 1471-0684. (Full text available)

Preview

Stapleton, Gem and Howse, John and Thompson, Simon and Taylor, John and Chapman, Peter (2013) On the Completeness of Spider Diagrams Augmented with Constants. In: Moktefi, Amirouche and Shin, Sun-Joo, eds. Visual Reasoning with Diagrams. Studies in Universal Logic . Birkhauser, pp. 101-133. ISBN 9783034805995. (Full text available)

Preview

Sulzmann, Martin and Wang, Meng (2007) Aspect-Oriented Programming with Type Classes. In: Workshop on Foundations of aspect-oriented languages, 2007/3/13. (Full text available)

Preview

Sulzmann, Martin and Wang, Meng (2006) Modular Generic Programming with Extensible Superclasses. In: ACM SIGPLAN workshop on Generic programming, 2006, Portland, Oregon, USA. (Full text available)

Preview

T

Thompson, Simon (2011) Haskell: the craft of functional programming. Addison-Wesley ISBN 978-0-201-88295-7. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Thompson, Simon and Delaney, Aidan and Stapleton, Gem and Taylor, John (2014) A Normal Form for Spider Diagrams of Order. In: 2014 International Workshop on Visual Languages and Computing, 27-29 August 2014. (Full text available)

Preview

Thompson, Simon and Howse, John and Taylor, John and Stapleton, Gem and Chapman, Peter (2013) On the Completeness of Spider Diagrams Augmented with Constants. In: Moktefi, Amirouche and Shin, Sun-Joo, eds. Visual Reasoning with Diagrams. Studies in Universal Logic . Birkhaüser, pp. 101-133. ISBN 9783034805995. (Full text available)

Preview

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. (Full text available)

Preview

Thompson, Simon and Laemmel, Ralf and Kaiser, Markus (2013) Programming errors in traversal programs over structured data. Science of Computer Programming . ISSN 0167-6423. (Full text available)

Preview

Thompson, Simon and Li, Huiqing (2013) Refactoring tools for functional languages. Journal of Functional Programming, 23 (03). pp. 293-350. ISSN 0956-7968. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Tripp, Gerald (2010) Regular expression matching using associative memory. Technical report. , Canterbury, Kent. CT2 7NF. UK. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

U

Ugawa, Tomoharu and Jones, Richard E. and Ritson, Carl G. (2014) An On-The-Fly Copying Garbage Collection Framework for Jikes RVM. In: 12th Asian Symposium on Programming Languages and Systems, 17-19 November 2014, Singapore. (Full text available)

Preview

Ugawa, Tomoharu and Jones, Richard E. and Ritson, Carl G. (2014) Reference Object Processing in On-The-Fly Garbage Collection. In: ACM/SIGPLAN International Symposium on Memory Management (ISMM14), 12 June 2014, Edinburgh, UK. (In press) (Full text available)

Preview

V

Vitek, Jan and Kalibera, Tomas (2011) Repeatability, Reproducibility and Rigor in Systems Research (Invited Paper). In: Proceedings of the 11th International Conference on Embedded Software (EMSOFT). (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Voigtlander, Janis and Hu, Zhenjiang and Matsuda, Kazutaka and Wang, Meng (2010) Combining Syntactic and Semantic Bidirectionalization. In: ACM SIGPLAN international conference on Functional programming, September 2010. (Full text available)

Preview

Voigtlander, Janis and Hu, Zhenjiang and Matsuda, Kazutaka and Wang, Meng (2013) Enhancing Semantic Bidirectionalization via Shape Bidirectionalizer Plug-ins. Journal of Functional Programming, 23 (05). pp. 515-551. ISSN 0956-7968. (Full text available)

Preview

W

Wang, Meng and Chen, Kung and Khoo, Siau-Cheng (2006) On the Pursuit of Static and Coherent Weaving. In: Foundations of Aspect−Oriented Languages., March 2006, Bonn, Germany. (Full text available)

Preview

Wang, Meng and Chen, Kung and Khoo, Siau-Cheng (2006) Type-Directed Weaving of Aspects for Higher-order Functional Languages. In: ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, 2006-01-09. (Full text available)

Preview

Wang, Meng and Gibbons, Jeremy and Matsuda, Kazutaka and Hu, Zhenjiang (2010) Gradual Refinement: Blending Pattern Matching with Data Abstraction. In: International Conference of Mathematics on Program Construction, June 21-23, 2010, Québec City, Canada. (Full text available)

Preview

Wang, Meng and Gibbons, Jeremy and Matsuda, Kazutaka and Hu, Zhenjiang (2013) Refactoring pattern matching. Science of Computer Programming, 78 (11). pp. 2216-2242. ISSN 0167-6423. (Full text available)

Preview

Wang, Meng and Gibbons, Jeremy and Wu, Nicolas (2011) Incremental Updates for Efficient Bidirectional Transformations. In: ACM SIGPLAN international conference on Functional programming. (Full text available)

Preview

Wang, Meng and Najd, Shayan (2014) Semantic Bidirectionalization Revisited. In: Workshop on Partial Evaluation and Program Manipulation (PEPM). (Full text available)

Preview

Wang, Meng and Oliveira, Bruno (2009) What Does Aspect-Oriented Programming Mean for Functional Programmers? In: ACM SIGPLAN workshop on Generic programming, 2009/8/30. (Full text available)

Preview

Weirich, Stephanie and Owens, Scott and Sewell, Peter and Zappa Nardelli, Francesco (2010) Ott or Nott. In: 5th ACM SIGPLAN Workshop on Mechanizing Metatheory. (Unpublished) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Welch, Peter H. (2013) Life of occam-Pi. In: Communicating Process Architectures 2013, August, 2013. (Full text available)

Preview

Welch, Peter H. and Brown, Neil C.C. and Moores, James and Chalmers, Kevin and Sputh, Bernhard H. C. (2010) Alting Barriers: Synchronisation with Choice in Java using JCSP. Concurrency and Computation: Practice and Experience, 22 . pp. 182-196. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Welch, Peter H. and Pedersen, Jan B. (2010) Santa Claus: Formal analysis of a process-oriented solution. ACM Transactions on Programming Languages and Systems (TOPLAS), 32 (4). pp. 182-196. ISSN 0164-0925. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Welch, Peter H. and Wallnau, Kurt and Sampson, Adam T. and Klein, Mark (2012) To boldly go: an occam-pi mission to engineer emergence. Natural Computing, 11 (3). pp. 1-27. ISSN 1567-7818. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

White, David R and Singer, Jeremy and Aitken, John and Jones, Richard E. (2013) Control theory for principled heap sizing. In: International Symposium on Memory Management, June 2013, Seattle, Washington, USA. (Full text available)

Preview

Z

Zappa Nardelli, Francesco and Sewell, Peter and Sevcik, Jaroslav and Sarkar, Susmit and Owens, Scott and Maranget, Luc and Batty, Mark and Alglave, Jade (2009) Relaxed Memory Models Must Be Rigorous. In: Exploiting Concurrency Efficiently and Correctly, CAV 2009 Workshop. (Unpublished) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)