Items where division is "Faculties > Sciences > School of Computing > Programming Languages and Systems Group"

A

Aaron, Samuel and Orchard, Dominic A. and Blackwell, Alan F. (2014) Temporal semantics for a live coding language. In: 2nd ACM SIGPLAN International workshop on Functional art, music, modeling & design, 1-3 Sep 2014, Gothenburg, Sweden. (doi:https://doi.org/10.1145/2633638.2633648) (Full text available)

Preview

Alglave, Jade and Batty, Mark and Donaldson, Alastair F. and Gopalakrishnan, Ganesh and Ketema, Jeroen and Poetzl, Daniel and Sorensen, Tyler and Wickerson, John (2015) GPU Concurrency: Weak Behaviours and Programming Assumptions. In: Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 14-18 Mar 2015, Istanbul, Turkey. (doi:https://doi.org/10.1145/2694344.2694391) (Full text available)

Preview

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. (doi:https://doi.org/10.1109/ROBOT.2000.846368) (The 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. (2015) Guppy: Process-Oriented Programming on Embedded Devices. In: Communicating Process Architectures 2015, August 2015, Canterbury, Kent, UK. (Full text available)

Preview

Barnes, Frederick R.M. (2009) Mobile Escape Analysis for occam-pi. In: Communicating Process Architectures 2009. (doi:https://doi.org/10.3233/978-1-60750-065-0-117) (The 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. (doi:https://doi.org/10.1145/1713254.1713265) (The 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. (doi:https://doi.org/10.1002/cpe.1428) (The 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. (doi:https://doi.org/10.1007/978-3-642-32469-7_7) (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. (doi:https://doi.org/10.1016/j.entcs.2010.09.003) (Full text available)

Preview

Bartoletti, Massimo and Bocchi, Laura and Murgia, Massimo (2018) Progress-preserving Refinements of CTA. In: 29th International Conference on Concurrency Theory (CONCUR 2018), 4--7 September 2018, Beijing, China, 4--7 September 2018, Beijing, China. (doi:https://doi.org/10.4230/LIPIcs.CONCUR.2018.40) (Full text available)

Preview

Bartoletti, Massimo and Cimoli, Tiziana and Murgia, Maurizio and Podda, Alessandro Sebastian and Pompianu, Livio (2015) Compliance and Subtyping in Timed Session Types. In: Formal Techniques for Distributed Objects, Components, and Systems. Springer pp. 161-177. ISBN 978-3-319-19194-2. E-ISBN 978-3-319-19195-9. (doi:https://doi.org/10.1007/978-3-319-19195-9_11) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bartoletti, Massimo and Cimoli, Tiziana and Murgia, Maurizio and Podda, Alessandro Sebastian and Pompianu, Livio (2016) A Contract-Oriented Middleware. In: Formal Aspects of Component Software. Lecture Notes in Computer Science (LNCS), 9539. Springer pp. 86-104. ISBN 978-3-319-28933-5. E-ISBN 978-3-319-28934-2. (doi:https://doi.org/10.1007/978-3-319-28934-2_5) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bartoletti, Massimo and Murgia, Maurizio and Scalas, Alceste and Zunino, Roberto (2015) Verifiable abstractions for contract-oriented systems. Journal of Logical and Algebraic Methods in Programming, 86 (1). pp. 159-207. ISSN 2352-2208. (doi:https://doi.org/10.1016/j.jlamp.2015.10.005) (The 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 Dodds, Mike and Gotsman, Alexey (2013) Library abstraction for C/C++ concurrency. In: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 23 - 25 Jan 2013, Rome, Italy. (doi:https://doi.org/10.1145/2429069.2429099) (Full text available)

Preview

Batty, Mark and Donaldson, Alastair and Wickerson, John (2016) Overhauling SC atomics in C11 and OpenCL. In: Symposium on Principles of Programming Languages 2016, 20 - 22 Jan 2016, St. Petersburg, Florida, USA. (doi:https://doi.org/10.1145/2837614.2837637) (Full text available)

Preview

Batty, Mark and Memarian, Kayvan and Nienhuis, Kyndylan and Pichon-Pharabod, Jean and Sewell, Peter (2015) The Problem of Programming Language Concurrency Semantics. In: 24th European Symposium on Programming, held as Part of the European Joint Conferences on Theory and Practice of Software, 11-18 Apr 2015, London, UK. (doi:https://doi.org/10.1007/978-3-662-46669-8_12) (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. (doi:https://doi.org/10.1145/2103656.2103717) (The 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 Memarian, Kayvan and Owens, Scott and Sarkar, Susmit and Sewell, Peter (2012) Clarifying and compiling C/C++ concurrency: from C++11 to POWER. In: 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 22-28 Jan 2012, Philadelphia, Pennsylvania, USA. (doi:https://doi.org/10.1145/2103656.2103717) (Full text available)

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. (doi:https://doi.org/10.1145/1926385.1926394) (The 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. (doi: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)

Batty, Mark and Owens, Scott and Sarkar, Susmit and Sewell, Peter and Weber, Tjark (2011) Mathematizing C++ concurrency. In: 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2011, 26-28 Jan 2011, Austin, Texas, USA. (doi:https://doi.org/10.1145/1926385.1926394) (Full text available)

Preview

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. (doi:https://doi.org/10.1017/S1471068404002261) (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

Blackburn, Stephen M and Diwan, Amer and Hauswirth, Mattias and Sweeney, Peter F and Amaral, Jose Nelson and Brecht, Tim and Bulej, Lubomr and Click, Cliff and Eeckhout, Lieven and Fischmeister, Sebastian and Frampton, Daniel and Hendren, Laurie J and Hind, Michael and Hosking, Antony L and Jones, Richard E. and Kalibera, Tomas and Keynes, Nathan and Nystrom, Nathaniel and Zeller, Andreas (2016) The Truth, the Whole Truth, and Nothing but the Truth: A Pragmatic Guide to Assessing Empirical Evaluations. Transactions on Programming Languages and Systems (TOPLAS), 38 (4). ISSN 0164-0925. E-ISSN 1558-4593. (doi:https://doi.org/10.1145/2983574) (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. (doi:https://doi.org/10.1145/2003476.2003493) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Blanchette, Jasmin Christian and Weber, Tjark and Batty, Mark and Owens, Scott and Sarkar, Susmit (2011) Nitpicking C++ concurrency. In: Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 20-22 Jul 2011, Odense, Denmark. (doi:https://doi.org/10.1145/2003476.2003493) (Full text available)

Preview

Bocchi, Laura (2004) Compositional Nested Long Running Transactions. In: Fundamental Approaches to Software Engineering. Lecture Notes in Computer Science, 2984. Springer pp. 194-208. ISBN 978-3-540-21305-5. E-ISBN 978-3-540-24721-0. (doi:https://doi.org/10.1007/978-3-540-24721-0_14) (The 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 (2017) Monitoring Networks through Multiparty Session Types. Theoretical Computer Science, 669 . pp. 33-58. ISSN 0304-3975. (doi:https://doi.org/10.1016/j.tcs.2017.02.009) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Preview Preview +1 more...

Bocchi, Laura (2017) Timed Runtime Monitoring for Multiparty Conversations. Formal Aspects of Computing, . ISSN 0934-5043. E-ISSN 1433-299X. (doi:https://doi.org/10.1007/s00165-017-0420-8) (Full text available)

Preview

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. Lecture Notes in Computer Science (1). Springer pp. 50-65. (doi:https://doi.org/10.1007/978-3-642-38592-6_5) (Full text available)

Bocchi, Laura and Ciancarini, Paolo (2003) A Perspective on Multiagent Coordination Models. In: Communication in Multiagent Systems. Springer, pp. 146-163. ISBN 978-3-540-40385-2. E-ISBN 978-3-540-44972-0. (doi:https://doi.org/10.1007/978-3-540-44972-0_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)

Bocchi, Laura and Ciancarini, Paolo and Moretti, Rocco and Presutti, Valentina (2007) On the Impact of AOSE in Service-Oriented Computing. In: Emerging Methods, Technologies, and Process Management in Software Engineering. Wiley-IEEE Computer Society, pp. 69-83. (doi:https://doi.org/10.1002/9780470238103.ch4) (The 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 Ciancarini, Paolo and Moretti, Rocco and Presutti, Valentina and Rossi, Davide (2005) An OWL-S based approach to express grid services coordination. In: Proceedings of the 2005 ACM symposium on Applied computing - SAC '05. ACM pp. 1661-1667. ISBN 1-58113-964-0. (doi:https://doi.org/10.1145/1066677.1067054) (The 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 Ciancarini, Paolo and Rossi, Davide (2005) Transactional Aspects in Semantic Based Discovery of Services. In: Coordination Models and Languages. Lecture Notes in Computer Science, 3454. Springer pp. 283-297. ISBN 978-3-540-25630-4. E-ISBN 978-3-540-32006-7. (doi:https://doi.org/10.1007/11417019_19) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

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. (doi:https://doi.org/10.4204/EPTCS.137.5) (Full text available)

Preview

Bocchi, Laura and Fiadeiro, José Luiz and Lopes, Antónia (2008) Service-Oriented Modelling of Automotive Systems. In: 2008 32nd Annual IEEE International Computer Software and Applications Conference. IEEE Computer Society pp. 1059-1064. ISBN 978-0-7695-3262-2. (doi:https://doi.org/10.1109/COMPSAC.2008.228) (The 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 Fiadeiro, José and Rajper, Noor and Reiff-Marganiec, Stephan (2010) Structure and Behaviour of Virtual Organisation Breeding Environments. In: 2nd Workshop on Formal Aspects of Virtual Organisations (FAVO). (doi:https://doi.org/10.4204/EPTCS.16.3) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bocchi, Laura and Gorton, Stephen and Reiff-Marganiec, Stephan (2010) From StPowla processes to SRML models. Formal Aspects of Computing, 22 (3). pp. 243-268. ISSN 0934-5043. (doi:https://doi.org/10.1007/s00165-009-0118-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)

Bocchi, Laura and Guanciale, Roberto and Strollo, Daniele and Tuosto, Emilio (2010) BPMN Modelling of Services with Dynamically Reconfigurable Transactions. In: Service-Oriented Computing. Lecture Notes in Computer Science, 6470. Springer pp. 396-410. ISBN 978-3-642-17357-8. E-ISBN 978-3-642-17358-5. (doi:https://doi.org/10.1007/978-3-642-17358-5_27) (The 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 Honda, Kohei and Tuosto, Emilio and Yoshida, Nobuko (2010) A Theory of Design-by-Contract for Distributed Multiparty Interactions. In: CONCUR 2010 - Concurrency Theory. Lecture Notes in Computer Science, 6269. Springer pp. 162-176. (doi:https://doi.org/10.1007/978-3-642-15375-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)

Bocchi, Laura and Laneve, Cosimo and Zavattaro, Gianluigi (2003) A Calculus for Long-Running Transactions. In: Formal Methods for Open Object-Based Distributed Systems. Lecture Notes in Computer Science, 2884. Springer pp. 124-138. ISBN 978-3-540-20491-6. E-ISBN 978-3-540-39958-2. (doi:https://doi.org/10.1007/978-3-540-39958-2_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)

Bocchi, Laura and Lange, Julien and Tuosto, Emilio (2012) Three Algorithms and a Methodology for Amending Contracts for Choreographies. Scientific Annals of Computer Science, 22 (1). pp. 61-104. ISSN 1843-8121. (doi:https://doi.org/10.7561/SACS.2012.1.61) (The 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 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 Storage. Service Oriented Computing and Applications, 9 (3). pp. 213-227. ISSN 1863-2386. E-ISSN 1863-2394. (doi:https://doi.org/10.1007/s11761-014-0165-7) (Full text available)

Bocchi, Laura and Melgratti, Hernán (2014) On the Behaviour of General-Purpose Applications on Cloud Storages. In: Web Services and Formal Methods. Lecture Notes in Computer Science. Springer pp. 29-47. (doi:https://doi.org/10.1007/978-3-319-08260-8_3) (Full text available)

Preview

Bocchi, Laura and Tuosto, Emilio (2015) Attribute-based transactions in service oriented computing. Mathematical Structures in Computer Science, 25 (3). pp. 619-665. ISSN 0960-1295. (doi:https://doi.org/10.1017/S0960129512000904) (The 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 Wischik, Lucian (2004) A Process Calculus of Atomic Commit. Electronic Notes in Theoretical Computer Science, 105 . pp. 119-132. ISSN 1571-0661. (doi:https://doi.org/10.1016/j.entcs.2004.05.003) (The 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: International Conference on Concurrency Theory (CONCUR). (doi:https://doi.org/10.1007/978-3-662-44584-6_29) (Full text available)

Preview

Bocchi, Laura and Yoshida, Nobuko and Lange, Julien (2015) Meeting Deadlines Together. In: International Conference on Concurrency Theory (CONCUR). (doi:https://doi.org/10.4230/LIPIcs.CONCUR.2015.283) (Full text available)

Boiten, Eerke Albert (2016) Big Data Refinement. Electronic Proceedings in Theoretical Computer Science, 209 . pp. 17-23. ISSN 2075-2180. E-ISSN 2075-2180. (doi:https://doi.org/10.4204/EPTCS.209.2) (Full text available)

Preview

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

Boiten, Eerke Albert (2015) Diversity and Adjudication. Journal of Logical and Algebraic Methods in Programming, . ISSN 2352-2208. (doi:https://doi.org/10.1016/j.jlamp.2015.10.007) (Full text available)

Preview

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

Boiten, Eerke Albert (2011) Perspicuity and Granularity in Refinement. In: Proceedings 15th International Refinement Workshop. (doi:https://doi.org/10.4204/EPTCS.55.10) (Full text available)

Preview

Boiten, Eerke Albert (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 Albert 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. (doi:https://doi.org/10.1007/s00165-009-0147-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)

Boiten, Eerke Albert and Derrick, John (2013) From ODP Viewpoint Consistency to Integrated Formal Methods. Computer Standards and Interfaces, 35 (3). pp. 269-276. ISSN 0920-5489. (doi:https://doi.org/10.1016/j.csi.2011.10.015) (Full text available)

Preview

Boiten, Eerke Albert and Derrick, John (2010) Incompleteness of Relational Simulations in the Blocking Paradigm. Science of Computer Programming, 75 (12). pp. 1262-1269. ISSN 0167-6423. (doi:https://doi.org/10.1016/j.scico.2010.07.003) (Full text available)

Preview

Boiten, Eerke Albert 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. (doi:https://doi.org/10.1007/s00165-011-0220-5) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Boiten, Eerke Albert 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. (doi:https://doi.org/10.1016/j.entcs.2009.12.013) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

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

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

Preview

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

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 . pp. 263-278. ISSN 0302-9743. (doi:https://doi.org/10.1007/978-3-642-40447-4_17) (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. (doi:https://doi.org/10.1145/2430553.2430557) (Full text available)

Preview

Bowman, Howard and Thompson, Simon (1998) A tableau method for interval temporal logic with projection. TABLEAUX 1998: Automated Reasoning with Analytic Tableaux and Related Methods, . pp. 108-123. (The 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 (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. (doi:https://doi.org/10.1016/j.scico.2012.06.001) (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 978-3-642-15897-1. (doi:https://doi.org/10.1007/978-3-642-15898-8_6) (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 978-3-642-22109-5. (doi:https://doi.org/10.1007/978-3-642-22110-1_17) (Full text available)

Preview

Brotherston, James and Gorogiannis, Nikos and Kanovich, Max and Rowe, Reuben (2016) Model checking for symbolic-heap separation logic with inductive predicates. In: 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL '16, January 20-22, 2016, St Petersburg, FL, USA. (doi:https://doi.org/10.1145/2914770.2837621) (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. (doi:https://doi.org/10.1145/1706356.1706378) (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: 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 978-3-642-18377-5. (doi:https://doi.org/10.1007/978-3-642-18378-2_4) (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

Bruna, Maria and Grigore, Radu and Kiefer, Stefan and Ouaknine, Joel and Worrell, James (2016) Proving the Herman-Protocol Conjecture. In: ICALP 2016, Rome, Italy. (doi:https://doi.org/10.4230/LIPIcs.ICALP.2016.104) (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)

Chari, Guido and Garbervetsky, Diego and Marr, Stefan and Ducasse, Stéphane (2015) Towards Fully Reflective Environments. In: Proceedings of the 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software. (doi:https://doi.org/10.1145/2814228.2814241) (Full text available)

Preview

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 978-3-642-02157-2. (doi:https://doi.org/10.1007/978-3-642-02158-9_9) (Full text available)

Preview

Chawdhary, Aziem and King, Andy (2018) Closing the Performance Gap between Doubles and Rationals for Octagons. In: Podelski, Andreas, ed. Twenth-fifth Static Analysis Symposium. Springer ISBN 978-3-319-99724-7. (doi:https://doi.org/10.1007/978-3-319-99725-4_13) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Chawdhary, Aziem and King, Andy (2018) Closing the Performance Gap between Doubles and Rationals for Octagons. In: Podelski, Andreas, ed. International Static Analysis Symposium. Lecture Notes in Computer Science, 11002 . Springer, pp. 187-204. ISBN 978-3-319-99724-7. E-ISBN 978-3-319-99725-4. (doi:https://doi.org/10.1007/978-3-319-99725-4_13) (Full text available)

Preview

Chawdhary, Aziem and King, Andy (2017) Compact Difference Bound Matrices. In: Chang, Evan, ed. 15th Asian Symposium on Programming Languages and Systems. Lecture Notes in Computer Science . Springer, pp. 471-490. ISBN 978-3-319-71236-9. (doi:https://doi.org/10.1007/978-3-319-71237-6_23) (Full text available)

Preview

Chawdhary, Aziem and King, Andy and Singh, Ranjeet (2017) Partial Evaluation of String Obfuscations for Java Malware Detection. Formal Aspects of Computing, 29 (1). ISSN 0934-5043. E-ISSN 1433-299X. (doi:https://doi.org/10.1007/s00165-016-0357-3) (Full text available)

Preview

Chawdhary, Aziem and Robbins, Ed and King, Andy (2018) Incrementally Closing Octagons. Formal Methods in System Design, . ISSN 0925-9856. E-ISSN 1572-8102. (doi:https://doi.org/10.1007/s10703-017-0314-7) (Full text available)

Preview Preview

Chawdhary, Aziem and Robbins, Ed and King, Andy (2014) Simple and Efficient Algorithms for Octagons. In: Garrigue, Jacques, ed. Twelfth Asian Symposium on Programming Languages and Systems. Lecture Notes in Computer Science, 8858 . Springer, pp. 296-313. ISBN 978-3-319-12735-4. E-ISBN 978-3-319-12736-1. (doi:https://doi.org/10.1007/978-3-319-12736-1_16) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Chechina, Natalia and Li, Huiqing and Ghaffari, Amir and Thompson, Simon and Trinder, Phil (2016) Improving the network scalability of Erlang. Journal of Parallel and Distributed Computing, 90-91 . pp. 22-34. ISSN 0743-7315. (doi:https://doi.org/10.1016/j.jpdc.2016.01.002) (Full text available)

Preview

Chechina, Natalia and MacKenzie, Kenneth and Thompson, Simon and Trinder, Phil and Boudeville, Olivier and Fordos, Viktoria and Hoch, csaba and Ghaffari, Amir and Moro Hernandez, Mario (2017) Evaluating Scalable Distributed Erlang for Scalability and Reliability. IEEE Transactions on Parallel and Distributed Systems, 28 (8). pp. 2244-2257. ISSN 1045-9219. (doi:https://doi.org/10.1109/TPDS.2017.2654246) (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. (doi:https://doi.org/10.1016/j.scico.2010.04.001) (Full text available)

Preview

Cheng, Yufeng and Wang, Meng and Xiong, Yingfei and Hao, Dan and Zhang, Lu (2016) Empirical Evaluation of Test Coverage for Functional Programs. In: IEEE International Conference on Software Testing, Verification and Validation, 10-15, April, 2016, Chicago, USA. (doi:https://doi.org/10.1109/ICST.2016.8) (Full text available)

Cheung, Steven and Darvariu, Victor and Ghica, Dan R. and Muroya, Koko and Rowe, Reuben (2018) A functional perspective on machine learning via programmable induction and abduction. In: Fourteenth International Symposium on Functional and Logic Programming (FLOPS 2018), 9-11 May, 2018, Nagoya, Japan. (doi:https://doi.org/10.1007/978-3-319-90686-7_6) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Chitil, Olaf (1998) Common Subexpressions are Uncommon in Lazy Functional Languages. In: Implementation of Functional Languages: 9th International Workshop, IFL '97, 10-12 Sep 1997, St. Andrews, Scotland, UK. (doi:https://doi.org/10.1007/BFb0055424) (Full text available)

Preview

Chitil, Olaf (2009) Essentials of Programming Languages (third edition) by Daniel P. Friedman and Mitchell Wand, MIT Press, ISBN 978-0-262-06279-4, 2008. Review of: Essentials of Programming Languages by Friedman, Daniel P and Wand, Mitchell. Journal of Functional Programming, 19 (6). pp. 723-725. (doi:https://doi.org/10.1017/S0956796809007357) (Full text available)

Preview

Chitil, Olaf (2008) Heat — An Interactive Development Environment for Learning & Teaching Haskell. In: Implementation and Application of Functional Programs, IFL 2008, 10-12 Sept 2008, Hatfield, UK. (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). (doi:https://doi.org/10.1145/2364527.2364539) (Full text available)

Preview

Chitil, Olaf (2011) StrictCheck: a Tool for Testing Whether a Function is Unnecessarily Strict. Technical report. University of Kent, Kent, UK 2-11. (doi:2-11) (Full text available)

Preview

Chitil, Olaf (2011) A semantics for lazy assertions. In: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation, 24-25 Jan 2011, Austin, Texas,USA. (doi:https://doi.org/10.1145/1929501.1929527) (Full text available)

Preview

Chitil, Olaf and Faddegon, Maarten and Runciman, Colin (2017) A Lightweight Hat: Simple Type-Preserving Instrumentation for Self-Tracing Lazy Functional Programs. In: Implementation and Application of Functional Languages, IFL 2016, 31 Aug - 2 Sep 2016, Leuven, Belgium. (doi:https://doi.org/10.1145/3064899.3064904) (Full text available)

Preview

Christakis, Maria and Bird, Christian (2016) What Developers Want and Need from Program Analysis: An Empirical Study. In: Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering - ASE 2016. ACM pp. 332-343. ISBN 978-1-4503-3845-5. (doi:https://doi.org/10.1145/2970276.2970347) (Full text available)

Preview

Christakis, Maria and Emmisberger, Patrick and Müller, Peter (2014) Dynamic Test Generation with Static Fields and Initializers. In: Runtime Verification. Lecture Notes in Computer Science (LNCS), 8734. pp. 269-284. ISBN 978-3-319-11163-6. E-ISBN 978-3-319-11164-3. (doi:https://doi.org/10.1007/978-3-319-11164-3_23) (Full text available)

Preview

Christakis, Maria and Godefroid, Patrice (2015) IC-Cut: A Compositional Search Strategy for Dynamic Test Generation. In: Model Checking Software. Lecture Notes in Computer Science, 9232. Springer pp. 300-318. ISBN 978-3-319-23403-8. E-ISBN 978-3-319-23404-5. (doi:https://doi.org/10.1007/978-3-319-23404-5_19) (Full text available)

Preview

Christakis, Maria and Godefroid, Patrice (2015) Proving Memory Safety of the ANI Windows Image Parser Using Compositional Exhaustive Testing. In: Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science (LNCS), 8931. Springer pp. 373-392. ISBN 978-3-662-46080-1. E-ISBN 978-3-662-46081-8. (doi:https://doi.org/10.1007/978-3-662-46081-8_21) (Full text available)

Preview

Christakis, Maria and Gotovos, Alkis and Sagonas, Konstantinos (2013) Systematic Testing for Detecting Concurrency Errors in Erlang Programs. In: 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation. IEEE pp. 154-163. (doi:https://doi.org/10.1109/ICST.2013.50) (Full text available)

Preview

Christakis, Maria and Leino, K. Rustan M. and Müller, Peter and Wüstholz, Valentin (2016) Integrated Environment for Diagnosing Verification Errors. In: Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science (LNCS), 9636. Springer pp. 424-441. ISBN 978-3-662-49673-2. E-ISBN 978-3-662-49674-9. (doi:https://doi.org/10.1007/978-3-662-49674-9_25) (Full text available)

Preview

Christakis, Maria and Leino, K. Rustan M. and Schulte, Wolfram (2014) Formalizing and Verifying a Modern Build Language. In: FM 2014: Formal Methods. Lecture Notes in Computer Science (LNCS), 8442. pp. 643-657. ISBN 978-3-319-06409-3. E-ISBN 978-3-319-06410-9. (doi:https://doi.org/10.1007/978-3-319-06410-9_43) (Full text available)

Preview

Christakis, Maria and Müller, Peter and Wüstholz, Valentin (2012) Collaborative Verification and Testing with Explicit Assumptions. In: FM 2012: Formal Methods. Lecture Notes in Computer Science, 7436. Springer pp. 132-146. ISBN 978-3-642-32758-2. E-ISBN 978-3-642-32759-9. (doi:https://doi.org/10.1007/978-3-642-32759-9_13) (Full text available)

Preview

Christakis, Maria and Müller, Peter and Wüstholz, Valentin (2015) An Experimental Evaluation of Deliberate Unsoundness in a Static Program Analyzer. In: Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science (LNCS), 8931. Springer pp. 336-354. ISBN 978-3-662-46080-1. E-ISBN 978-3-662-46081-8. (doi:https://doi.org/10.1007/978-3-662-46081-8_19) (Full text available)

Preview

Christakis, Maria and Müller, Peter and Wüstholz, Valentin (2016) Guiding Dynamic Symbolic Execution Toward Unverified Program Executions. In: Proceedings of the 38th International Conference on Software Engineering - ICSE '16. ACM pp. 144-155. ISBN 978-1-4503-3900-1. (doi:https://doi.org/10.1145/2884781.2884843) (Full text available)

Preview

Christakis, Maria and Müller, Peter and Wüstholz, Valentin (2014) Synthesizing Parameterized Unit Tests to Detect Object Invariant Violations. In: Software Engineering and Formal Methods. Lecture Notes in Computer Science, 8702. Springer pp. 65-80. ISBN 978-3-319-10430-0. E-ISBN 978-3-319-10431-7. (doi:https://doi.org/10.1007/978-3-319-10431-7_6) (Full text available)

Preview

Christakis, Maria and Sagonas, Konstantinos (2011) Detection of Asynchronous Message Passing Errors Using Static Analysis. In: Practical Aspects of Declarative Languages. Lecture Notes in Computer Science. pp. 5-18. ISBN 978-3-642-18377-5. E-ISBN 978-3-642-18378-2. (doi:https://doi.org/10.1007/978-3-642-18378-2_3) (Full text available)

Preview

Christakis, Maria and Sagonas, Konstantinos (2010) Static Detection of Race Conditions in Erlang. In: Practical Aspects of Declarative Languages. Lecture Notes in Computer Science. pp. 119-133. ISBN 978-3-642-11502-8. E-ISBN 978-3-642-11503-5. (doi:https://doi.org/10.1007/978-3-642-11503-5_11) (Full text available)

Preview

Christakis, Maria and Wüstholz, Valentin (2016) Bounded Abstract Interpretation. In: Static Analysis. Lecture Notes in Computer Science (LNCS), 9837. Springer pp. 105-125. ISBN 978-3-662-53412-0. E-ISBN 978-3-662-53413-7. (doi:https://doi.org/10.1007/978-3-662-53413-7_6) (Full text available)

Preview

Cohen, Liron and Rowe, Reuben (2018) Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent. In: 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, September 4-7, 2018, Birmingham, UK. (doi:https://doi.org/10.4230/LIPIcs.CSL.2018.16) (Full text available)

Preview

Cohen, Liron and Rowe, Reuben N. S. (2018) Infinitary and Cyclic Proof Systems for Transitive Closure Logic. Technical report. University of Kent (Submitted) (Full text available)

Preview

Contrastin, Mistral and Orchard, Dominic A. and Rice, Andrew C. (2018) Automatic reordering for dataflow safety of Datalog. Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, . (Full text available)

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. (doi:https://doi.org/10.1007/11561347_25) (The 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 de Lemos, Rogerio (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. (Full text available)

Preview

D

De Koster, Joeri and Marr, Stefan and D'Hondt, Theo (2012) Synchronization Views for Event-loop Actors. In: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming. (doi:https://doi.org/10.1145/2145816.2145873) (Full text available)

Preview

De Koster, Joeri and Marr, Stefan and D'Hondt, Theo and Van Cutsem, Tom (2014) Domains: safe sharing among actors. Science of Computer Programming, 98, Pa . pp. 140-158. ISSN 0167-6423. (doi:https://doi.org/10.1016/j.scico.2014.02.008) (Full text available)

Preview

De Koster, Joeri and Marr, Stefan and D'Hondt, Theo and Van Cutsem, Tom (2013) Tanks: Multiple reader, single writer actors. In: Proceedings of AGERE! 2013, 3rd International Workshop on Programming based on Actors, Agents, and Decentralized Control. (Full text available)

Preview

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)

De Wael, Mattias and Marr, Stefan and De Koster, Joeri and Sartor, Jennifer B. and De Meuter, Wolfgang (2015) Just-in-Time Data Structures. In: Proceedings of the 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software. (doi:https://doi.org/10.1145/2814228.2814231) (Full text available)

Preview

De Wael, Mattias and Marr, Stefan and De Meuter, Wolfgang (2014) Data Interface + Algorithms = Efficient Programs: Separating Logic from Representation to Improve Performance. In: Proceedings of the 9th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems. (doi:https://doi.org/10.1145/2633301.2633303) (Full text available)

Preview

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. (doi:https://doi.org/10.1007/978-3-642-14600-8) (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. (doi:https://doi.org/10.1016/j.jvlc.2013.02.001) (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. (doi:https://doi.org/10.1016/j.jvlc.2014.10.029) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

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

Preview

Derrick, John and Boiten, Eerke Albert (2016) Relational Concurrent Refinement - partial and total frameworks. In: Petre, Luigia and Sekerinski, Emil, eds. From Action Systems to Distributed Systems: The Refinement Approach. Taylor and Francis, Florida, USA, pp. 143-154. ISBN 978-1-4987-0158-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)

Derrick, John and Boiten, Eerke Albert (2014) Relational Concurrent Refinement Part III: Traces, partial relations and automata. Formal Aspects of Computing, 26 (2). pp. 407-432. ISSN 0934-5043. (doi:https://doi.org/10.1007/s00165-012-0262-3) (Full text available)

Preview

Derrick, John and Boiten, Eerke Albert (2009) Relational Concurrent Refinement: Automata. Electronic Notes in Theoretical Computer Science, 259 . pp. 182-196. ISSN 1571-0661. (doi:https://doi.org/10.1016/j.entcs.2009.12.015) (Full text available)

Preview

Derrick, John and Boiten, Eerke Albert (2011) Relational Concurrent Refinement: Timed Refinement. In: Formal Techniques for Distributed Systems, June 2011, Reykjavik. (doi:https://doi.org/10.1007/978-3-642-21461-5�) (Full text available)

Preview

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. In: Formal Methods for Components and Objects. Lecture Notes in Computer Science, 6286 . Springer, pp. 250-271. ISBN 978-3-642-17070-6. E-ISBN 978-3-642-17071-3. (doi:https://doi.org/10.1007/978-3-642-17071-3_13) (Full text available)

Preview

Dilley, Nicolas and Lange, Julien (2019) An Empirical Study of Messaging Passing Concurrency in Go Projects. In: IEEE International Conference on Software Analysis, Evolution and Reengineering, 24-27 Feb 2019, Hangzhou, China. (In press) (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)

Dodds, Mike and Batty, Mark and Gotsman, Alexey (2018) Compositional Verification of Compiler Optimisations on Relaxed Memory. In: ESOP 2018, April 14-20, 2018, Thessaloniki, Greece. (doi:https://doi.org/10.1007/978-3-319-89884-1_36) (Full text available)

Preview

Dominic, Orchard and Mistral, Contrastin and Matthew, Danish and Andrew, Rice (2017) Verifying Spatial Properties of Array Computations. Journal of Proceedings of the ACM, 1 (OOPSLA). p. 75. ISSN 2475-1421. E-ISSN 2475-1421. (doi:https://doi.org/10.1145/3133899) (Full text available)

Preview

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. (doi:https://doi.org/10.1007/11591191_36) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Duregard, Jonas and Jansson, Patrik and Wang, Meng (2012) Feat: Functional Enumeration of Algebraic Types. In: Haskell Symposium. (doi:https://doi.org/10.1145/2364506.2364515) (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. (doi:https://doi.org/10.1109/SEAMS.2009.5069077) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

de Lemos, Rogerio and Garlan, David and Ghezzi, Carlo and Giese, Holger and Andersson, Jesper and Litoiu, Marin and Schmerl, Bradley and Weyns, Danny and Baresi, Luciano and Bencomo, Nelly and Brun, Yuriy and Camara, Javier and Calinescu, Radu and Cohen, Myra B. and Gorla, Alessandra and Grassi, Vincenzo and Grunske, Lars and Inverardi, Paola and Jezequel, Jean-Marc and Malek, Sam and Mirandola, Raffaela and Mori, Marco and Müller, Hausi A. and Rouvoy, Romain and Rubira, Cecília M. F. and Rutten, Eric and Shaw, Mary and Tamburrelli, Giordano and Tamura, Gabriel and Villegas, Norha M. and Vogel, Thomas and Zambonelli, Franco (2018) Software Engineering for Self-Adaptive Systems: Research Challenges in the Provision of Assurances. In: de Lemos, Rogerio and Garlan, D. and Giese, H., eds. Software Engineering for Self-Adaptive Systems III. Assurances. Lecture Notes on Computer Science . Springer. ISBN 978-3-319-74182-6. (doi:https://doi.org/10.1007/978-3-319-74183-3_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)

F

Faddegon, Maarten and Chitil, Olaf (2015) Algorithmic Debugging of Real-World Haskell Programs: Deriving Dependencies from the Cost Centre Stack. In: 36th annual ACM SIGPLAN conference on Programming Language Design and Implementation, PLDI 2015, 13-17 June 2015, Portland, Oregon, USA. (doi:https://doi.org/10.1145/2737924.2737985) (Full text available)

Preview

Faddegon, Maarten and Chitil, Olaf (2016) Lightweight Computation Tree Tracing for Lazy Functional Languages. In: 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2016, 13 - 17 June 2016, Santa Barbara, California, United States. (doi:https://doi.org/10.1145/2908080.2908104) (Full text available)

Preview

Faddegon, Maarten and Chitil, Olaf (2017) A Type Generic Definition for Debugging Lazy Functional Programs by Value Observation. Computer Languages, Systems & Structures, 52 . pp. 92-110. ISSN 1477-8424. (doi:https://doi.org/10.1016/j.cl.2017.05.001) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Faddegon, Maarten and Chitil, Olaf (2014) Type Generic Observing. In: Symposium on Trends in Functional Programming 2014, 26-28 May 2014, Soesterberg, The Netherlands. (doi:https://doi.org/10.1007/978-3-319-14675-1_6) (Full text available)

Preview

Fiadeiro, José Luiz and Lopes, Antónia and Bocchi, Laura (2006) A Formal Approach to Service Component Architecture. In: Web Services and Formal Methods. Lecture Notes in Computer Science, 4184. Springer pp. 193-213. ISBN 978-3-540-38862-3. E-ISBN 978-3-540-38865-4. (doi:https://doi.org/10.1007/11841197_13) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Fiadeiro, José Luiz and Lopes, Antónia and Bocchi, Laura (2011) An abstract model of service discovery and binding. Formal Aspects of Computing, 23 (4). pp. 433-463. ISSN 0934-5043. (doi:https://doi.org/10.1007/s00165-010-0166-z) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Flur, Shaked and Sarkar, Susmit and Pulte, Christopher and Nienhuis, Kyndylan and Maranget, Luc and Gray, Kathryn E. and Sezgin, Ali and Batty, Mark and Sewell, Peter (2017) Mixed-Size Concurrency: ARM, POWER, C/C++11, and SC. In: 44th ACM SIGPLAN Symposium on Principles of Programming Languages, January 15 - 21, 2017, Paris, France. (doi:https://doi.org/10.1145/3009837.3009839) (Full text available)

Preview

Férée, Hugo (2017) Game semantics approach to higher-order complexity. Journal of Computer and System Sciences, 87 . pp. 1-15. ISSN 0022-0000. (doi:https://doi.org/10.1016/j.jcss.2017.02.003) (Full text available)

Preview

Férée, Hugo and Gomaa, Walid and Hoyrup, Mathieu (2014) Analytical properties of resource-bounded real functionals. Journal of Complexity, 30 (5). pp. 647-671. ISSN 0885-064X. E-ISSN 1090-2708. (doi:https://doi.org/10.1016/j.jco.2014.02.008) (Full text available)

Preview

Férée, Hugo and Hainry, Emmanuel and Hoyrup, Mathieu and Péchoux, Romain (2015) Characterizing polynomial time complexity of stream programs using interpretations. Theoretical Computer Science, 585 . pp. 41-54. ISSN 0304-3975. (doi:https://doi.org/10.1016/j.tcs.2015.03.008) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Preview

Férée, Hugo and Hoyrup, Mathieu and Gomaa, Walid (2013) On the query complexity of real functionals. In: 28th ACM/IEEE Symposium on Logic in Computer Science, 25-28 Jun 2013. (doi:https://doi.org/10.1109/LICS.2013.15) (Full text available)

Preview

Férée, Hugo and Hym, Samuel and Mayero, Micaela and Moyen, Jean-Yves and Nowak, David (2018) Formal Proof of Polynomial-Time Complexity with Quasi-Interpretations. In: CPP 2018 - The 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 8-9 January, 2018, Los Angeles, USA. (doi:https://doi.org/10.1145/3167097) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Férée, Hugo and Pohjola, Johannes Aman and Kumar, Ramana and Owens, Scott and Myreen, Magnus O. and Ho, Son (2018) Program Verification in the Presence of I/O - Semantics, Verified Library Routines, and Verified Applications. In: 10th International Conference on Verified Software: Theories, Tools, and Experiments. (doi:https://doi.org/10.1007/978-3-030-03592-1) (Full text available)

Preview

G

Gaboardi, Marco and Katsumata, Shin-ya and Orchard, Dominic A. and Breuvart, Flavien and Uustalu, Tarmo (2016) Combining Effects and Coeffects via Grading. Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, . pp. 476-489. ISSN 0362-1340. E-ISSN 1558-1160. (doi:https://doi.org/10.1145/2951913.2951939) (Full text available)

Preview

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 978-3-540-00886-6. (doi:https://doi.org/10.1007/3-540-36575-3_7) (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. (doi:https://doi.org/10.1145/1352582.1352585) (Full text available)

Preview

Gerdes, Alex and Hughes, John and Smallbone, Nick and Wang, Meng (2015) Linking Unit Tests and Properties. In: Fourteenth ACM SIGPLAN Erlang Workshop, 31 Aug - 02 Sep 2015, Vancouver, British Columbia, Canada. (doi:https://doi.org/10.1145/2804295.2804298) (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. (doi:https://doi.org/10.1016/j.entcs.2005.10.003) (The 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

Gotovos, Alkis and Christakis, Maria and Sagonas, Konstantinos (2011) Test-Driven Development of Concurrent Programs using Concuerror. In: Proceedings of the 10th ACM SIGPLAN workshop on Erlang - Erlang '11. ACM p. 51. ISBN 978-1-4503-0859-5. (doi:https://doi.org/10.1145/2034654.2034664) (Full text available)

Preview

Grigore, Radu (2016) Abstraction Refinement Guided by a Learnt Probabilistic Model. In: Principles of Programming Languages, 2016, New York, USA. (doi:https://doi.org/10.1145/2837614.2837663) (Full text available)

Preview

Grigore, Radu (2017) Java Generics are Turing Complete. In: POPL 2017: Symposium on Principles of Programming Languages, 18 - 20 Jan 2017, Paris, France. (doi:https://doi.org/10.1145/3009837.3009871) (Full text available)

Preview

Grigore, Radu and Kiefer, Stefan (2018) Selective Monitoring. In: 29th International Conference on Concurrency Theory (CONCUR 2018), 4--7 September 2018, Beijing, China, 4--7 September 2018, Beijing, China. (In press) (doi:https://doi.org/10.4230/LIPIcs.CONCUR.2018.20) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Grigore, Radu and Kiefer, Stefan (2015) Tree Buffers. In: Computer Aided Verification, 2015. (doi:https://doi.org/10.1007/978-3-319-21690-4_17) (Full text available)

Preview

Grigore, Radu and Tzevelekos, Nikos (2016) History-Register Automata. Logical Methods in Computer Science, 12 (1). pp. 1-32. ISSN 1860-5974. (Full text available)

Preview

H

Haupt, Michael and Hirschfeld, Robert and Pape, Tobias and Gabrysiak, Gregor and Marr, Stefan and Bergmann, Arne and Heise, Arvid and Kleine, Matthias and Krahn, Robert (2010) The SOM Family: Virtual Machines for Teaching and Research. In: Proceedings of the 15th Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE). (Full text available)

Preview

Haupt, Michael and Marr, Stefan and Hirschfeld, Robert (2011) CSOM/PL: A Virtual Machine Product Line. Journal of Object Technology, 10 (12). pp. 1-30. ISSN 1660-1769. (doi:https://doi.org/10.5381/jot.2011.10.1.a12) (Full text available)

Preview

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. (doi:https://doi.org/10.1016/S0743-1066(00)00006-6) (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 978-3-540-67262-3. (doi:https://doi.org/10.1007/3-540-46425-5_10) (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. (doi: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. (doi:https://doi.org/10.1145/1806651.1806666) (The 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. (doi:https://doi.org/10.1017/S1471068402001485) (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 978-3-540-67262-3. (doi:https://doi.org/10.1007/3-540-46425-5_13) (Full text available)

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 978-3-642-04760-2. (doi:https://doi.org/10.1007/978-3-642-04761-9_23) (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. (doi:j.tcs.2012.02.024) (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. (doi:https://doi.org/10.1017/S1471068402001497) (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. (doi:https://doi.org/10.1016/j.entcs.2010.09.008) (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 978-3-540-22152-4. (doi:https://doi.org/10.1007/978-3-540-25951-0_6) (Full text available)

Howe, Jacob M. and King, Andy and Simon, Axel (2018) Incremental Closure for Systems of Two Variables Per Inequality. Theoretical Computer Science, . pp. 1-64. ISSN 0304-3975. (In press) (doi:https://doi.org/10.1016/j.tcs.2018.12.001) (Full text available)

Preview

Howe, Jacob M. and Robbins, Ed and King, Andy (2017) Theory Learning with Symmetry Breaking. In: Pientka, Brigitte, ed. International Symposium on Principles and Practice of Declarative Programming. ACM, Namur, Belgium, pp. 85-96. ISBN 978-1-4503-5291-8. (doi:https://doi.org/10.1145/3131851.3131861) (Full text available)

Preview

Hu, Zhenjiang and Hughes, John and Wang, Meng (2015) How functional programming mattered. National Science Review, 2 (3). pp. 349-370. ISSN 2095-5138. E-ISSN 2053-714X. (doi:https://doi.org/10.1093/nsr/nwv042) (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. E-ISSN 1875-8681. (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)

Jones, Richard E. and King, Andy C. (2004) Collecting the garbage without blocking the traffic. Technical report. University of Kent (Full text available)

Preview

Jones, William and Chawdhary, Aziem and King, Andy (2016) Optimising the Volgenant-Jonker Algorithm for Approximating Graph Edit Distance. Pattern Recognition Letters, . pp. 1-9. ISSN 0167-8655. (doi:https://doi.org/10.1016/j.patrec.2016.07.024) (Full text available)

Preview

Jones, William and Chawdhary, Aziem and King, Andy (2015) Revisiting Volgenant-Jonker for Approximating Graph Edit Distance. In: Liu, Cheng-Lin and Luo, B. and Kropatsch, W.G. and Cheng, J., eds. Graph-based Representations in Pattern Recognition. Lecture Notes in Computer Science, 9069 . Springer, pp. 98-107. ISBN 978-3-319-18223-0. E-ISBN 978-3-319-18224-7. (doi:https://doi.org/10.1007/978-3-319-18224-7) (Full text available)

Preview

K

Kahrs, Stefan (2010) Infinitary Rewriting: Foundations Revisited. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications. (doi:https://doi.org/10.4230/LIPIcs.RTA.2010.161) (The 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. (doi:https://doi.org/10.1007/s00236-012-0174-y) (The 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. (doi:https://doi.org/10.2168/LMCS-6(3:18)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)

Kalibera, Tomas (2011) Replicating Real-time Garbage Collector. Concurrency and Computation: Practice and Experience, 23 (14). pp. 182-196. (doi:https://doi.org/10.1002/cpe.1669) (The 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. (doi:https://doi.org/10.1002/cpe.1677) (The 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. (doi:https://doi.org/10.1145/1993478.1993492) (The 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. (doi: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. (doi:https://doi.org/10.1145/2464157.2464160) (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. (doi:https://doi.org/10.1145/2003690.2003692) (The 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. (doi:https://doi.org/10.1109/TCAD.2008.917592) (Full text available)

Preview

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

Preview

Kettle, Neil and King, Andy 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 978-3-540-33056-1. (doi:https://doi.org/10.1007/11691372_7) (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. (doi:https://doi.org/10.1016/j.csi.2012.05.003) (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. (doi:https://doi.org/10.1016/S0743-1066(00)00009-1) (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. (doi:https://doi.org/10.1017/S1471068402001436) (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 978-3-540-20642-2. (doi:https://doi.org/10.1007/978-3-540-24599-5_22) (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 978-3-540-36635-5. (doi:https://doi.org/10.1007/11799573_12) (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 978-3-540-65699-9. (doi:https://doi.org/10.1007/3-540-49099-X_5) (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 978-3-540-70543-7. (doi:https://doi.org/10.1007/978-3-540-70545-1_26) (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 978-3-540-55707-4. E-ISBN 978-3-540-47276-6. (doi:https://doi.org/10.1007/BFb0023876) (Full text available)

Preview

Kotiadis, Kathy (2016) Towards Self-Adaptive Discrete Event Simulation (SADES). In: 8th Simulation Workshop, 11-13 April 2016, Ettington Chase Hotel, Stratford. (Full text available)

Preview

Kotiadis, Kathy and Tako, Antuela (2016) A Facilitation Workshop for the Implementation Stage: A Case Study in health care. In: 8th Simulation Workshop, 11-13 April 2016, Ettington Chase Hotel, Stratford. (Full text available)

Preview

Kotiadis, Kathy and Tako, Antuela and Vasilakis, Christos (2014) A participative and facilitative conceptual modelling framework for discrete event simulation studies in healthcare. Journal of the Operation Research Society, 65 (2). pp. 197-213. ISSN 0160-5682. (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 978-3-642-29821-9. (doi:https://doi.org/10.1007/978-3-642-29822-6_16) (Full text available)

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 (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 (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 Verlag, pp. 270-284. ISBN 978-3-319-07151-0. (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

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 978-1-4503-2154-9. (doi:https://doi.org/10.1145/2505879.2505886) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

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. (doi:https://doi.org/10.1007/978-3-319-08970-6_20) (Full text available)

Preview

Kumar, Ramana and Arthan, Rob and Myreen, Magnus O. and Owens, Scott (2016) Self-Formalisation of Higher-Order Logic: Semantics, Soundness, and a Verified Implementation. Journal of Automated Reasoning, 56 (3). pp. 221-259. ISSN 0168-7433. E-ISSN 1573-0670. (doi:https://doi.org/10.1007/s10817-015-9357-x) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

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. (doi:https://doi.org/10.1145/2535838.2535841) (The 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. Association for Computing Machinery, New York, USA pp. 77-78. ISBN 978-1-4503-2385-7. (doi:https://doi.org/10.1145/2505305.2505317) (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

Lange, Julien and Ng, Nicholas and Toninho, Bernardo and Yoshida, Nobuko (2017) Fencing off go: liveness and safety for channel-based programming. In: Castagna, Giuseppe and Gordon, Andrew D., eds. Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017. ACM pp. 748-761. ISBN 978-1-4503-4660-3. (doi:https://doi.org/10.1145/3009837.3009847) (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. (doi:https://doi.org/10.1007/978-3-540-71316-6_15) (The 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. (doi:https://doi.org/10.1145/2593501.2593509) (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)

Li, Huiqing and Thompson, Simon (2012) Let's Make Refactoring Tools User-extensible! In: The Fifth ACM Workshop on Refactoring Tools. (doi:https://doi.org/10.1145/2328876.2328881) (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. (doi:2505305.2505311) (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. (doi:https://doi.org/10.1145/2678015.2682533) (Full text available)

Preview

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. (doi:https://doi.org/10.1145/2543728.2543741) (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 978-3-540-36635-5. (doi:https://doi.org/10.1007/11799573_13) (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 978-3-540-33438-5. (doi:https://doi.org/10.1007/11737414_13) (Full text available)

Preview

Linington, Peter F. (2010) The Stereochemistry of Enterprise Objects. In: Enterprise Distributed Object Computing Conference Workshops - WODPEC 2010. (doi:https://doi.org/10.1109/EDOCW.2010.25) (The 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. (doi:https://doi.org/10.1109/EDOCW.2012.28) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Little, Christopher and Gray, Kathryn E. and Owens, Scott (2015) JSTyper: Type inference fo JavaScript. In: Implementation and application of functional programming languages, 14-16 September, 2015, Koblenz, Germany. (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)

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 978-3-540-21402-1. (doi:https://doi.org/10.1007/978-3-540-24754-8_11) (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 978-3-540-25435-5. (doi:https://doi.org/10.1007/978-3-540-31987-0_9) (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. (doi:https://doi.org/10.1007/978-3-642-31424-7_36) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Marco, Paviotti and Jesper, Bengtson (2018) Formally verifying Exceptions for Low-level code with Separation Logic. Journal of Logical and Algebraic Methods in Programming, 94 . pp. 1-14. ISSN 2352-2208. (doi:https://doi.org/10.1016/j.jlamp.2017.09.004) (Full text available)

Preview

Marr, Stefan (2010) Encapsulation And Locality: A Foundation for Concurrency Support in Multi-Language Virtual Machines? In: SPLASH '10: Proceedings of the ACM International Conference Companion on Object Oriented Programming Systems Languages and Applications Companion. (doi:https://doi.org/10.1145/1869542.1869583) (Full text available)

Preview

Marr, Stefan (2013) Supporting Concurrency Abstractions in High-level Language Virtual Machines. Doctor of Philosophy (PhD) thesis, Software Languages Lab, Vrije Universiteit Brussel. (Full text available)

Preview

Marr, Stefan and D'Hondt, Theo (2010) Many-Core Virtual Machines: Decoupling Abstract from Concrete Concurrency. In: SPLASH '10: Proceedings of the ACM International Conference Companion on Object Oriented Programming Systems Languages and Applications Companion. (doi:https://doi.org/10.1145/1869542.1869593) (Full text available)

Preview

Marr, Stefan and De Wael, Mattias and Haupt, Michael and D'Hondt, Theo (2011) Which Problems Does a Multi-Language Virtual Machine Need to Solve in the Multicore/Manycore Era? In: Proceedings of the 5th Workshop on Virtual Machines and Intermediate Languages. (doi:https://doi.org/10.1145/2095050.2095104) (Full text available)

Preview

Marr, Stefan and Gonzalez Boix, Elisa and Mössenböck, Hanspeter (2016) Towards Meta-Level Engineering and Tooling for Complex Concurrent Systems. In: Proceedings of the 9th Arbeitstagung Programmiersprachen. (Full text available)

Preview

Marr, Stefan and Haupt, Michael and D'Hondt, Theo (2009) Intermediate Language Design of High-level Language Virtual Machines: Towards Comprehensive Concurrency Support. In: Proceedings of the 3rd Workshop on Virtual Machines and Intermediate Languages. (doi:https://doi.org/10.1145/1711506.1711509) (Full text available)

Preview

Marr, Stefan and Haupt, Michael and Timbermont, Stijn and Adams, Bram and D'Hondt, Theo and Costanza, Pascal and De Meuter, Wolfgang (2010) Virtual Machine Support for Many-Core Architectures: Decoupling Abstract From Concrete Concurrency Models. In: Second International Workshop on Programming Languages Approaches to Concurrency and Communication-cEntric Software. (doi:https://doi.org/10.4204/EPTCS.17.6) (Full text available)

Preview

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 978-3-540-22152-4. (doi:https://doi.org/10.1007/978-3-540-25951-0_13) (Full text available)

Preview

Matsuda, Kazutaka and Wang, Meng (2015) Applicative Bidirectional Programming with Lenses. In: ACM SIGPLAN International Conference on Functional Programming, 31 August – 2 September, 2015, Vancouver, British Columbia, Canada. (Full text available)

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). (doi:https://doi.org/10.1145/2505879.2505888) (Full text available)

Preview

Matsuda, Kazutaka and Wang, Meng (2014) “Bidirectionalization for Free” for Monomorphic Transformations. Science of Computer Programming, 111 (Part 1). pp. 79-109. ISSN 0167-6423. (doi:https://doi.org/10.1016/j.scico.2014.07.008) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Matsuda, Kazutaka and Wang, Meng (2013) FliPpr: A Prettier Invertible Printing System. In: European Symposium on Programming (ESOP). (doi:https://doi.org/10.1007/978-3-642-37036-6_6) (Full text available)

Preview

Mercier, Daniel (2017) dynStruct: An automatic reverse engineering tool for structure recovery and memory use analysis. Master of Science (MSc) thesis, University of Kent. (Full text available)

Preview

Mercier, Daniel and Chawdhary, Aziem and Jones, Richard E. (2017) dynStruct: An automatic reverse engineering tool for structure recovery and memory use analysis. In: 2017 IEEE 24th International Conference on Software Analysis, Evolution and Reengineering (SANER). Institute of Electrical and Electronics Engineers pp. 497-501. ISBN 978-1-5090-5502-9. E-ISBN 978-1-5090-5501-2. (doi:https://doi.org/10.1109/SANER.2017.7884661) (Full text available)

Preview

Miculan, Marino and Paviotti, Marco (2012) Synthesis of distributed mobile programs using monadic types in Coq. In: ITP 2012, 13-15 Aug 2012, Princeton, NJ, USA. (doi:https://doi.org/10.1007/978-3-642-32347-8_13) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Monks, T and Robinson, S and Kotiadis, Kathy (2015) Can involving clients in simulation studies help them solve their future problems? A transfer of learning experiment. Euorpean Journal of Operational Research, 249 (3). pp. 919-930. ISSN 0377-2217. (doi:https://doi.org/10.1016/j.ejor.2015.08.037) (Full text available)

Monks, T and Robinson, S and Kotiadis, Kathy (2014) Learning from discrete-event simulation: Exploring the high involvement hypothesis. European Journal of Operational Research, 235 (1). pp. 195-205. ISSN 0377-2217. (doi:https://doi.org/10.1016/j.ejor.2013.10.003) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

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. (doi:https://doi.org/10.1145/2628136.2628143) (Full text available)

Preview

Murgia, Maurizio (2018) On Urgency in Asynchronous Timed Session Types. In: Interaction and Concurrency Experience 2018, 20-21 June 2018, Madrid, Spain. (doi:https://doi.org/10.4204/EPTCS.279) (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. (doi:https://doi.org/10.1145/2364527.2364545) (The 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. (doi:https://doi.org/10.1017/S0956796813000282) (The 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. (doi:https://doi.org/10.1007/978-3-642-39634-2_38) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Møgelberg, Rasmus and Paviotti, Marco (2018) Denotational semantics of recursive types in synthetic guarded domain theory. Mathematical Structures in Computer Science, . ISSN 0960-1295. (doi:https://doi.org/10.1017/S0960129518000087) (Access to this publication is currently restricted. 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: 3rd International Workshop on Behavioural Types (BEAT), 1st September, 2014, Rome, Italy. (doi:https://doi.org/10.4204/EPTCS.162.3) (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

Orchard, Dominic A. (2014) Computational Semantics with Functional Programming, by Jan van Eijck and Christina Unger. Review of: Computational Semantics with Functional Programming by van Eijck, Jan and Unger, Christina. Journal of Functional Programming, 24 (4). pp. 524-527. ISSN 0956-7968. E-ISSN 1469-7653. (doi:https://doi.org/10.1017/S0956796814000057) (Full text available)

Preview

Orchard, Dominic A. (2011) The four Rs of programming language design. In: ACM Symposium on New Ideas in Programming and Reflections on Software, Onward! 2011, 22-27 Oct 2011, Portland, OR, USA. (doi:https://doi.org/10.1145/2089131.2089138) (Full text available)

Preview

Orchard, Dominic A. and Bolingbroke, Max and Mycroft, Alan (2010) Ypnos: declarative, parallel structured grid programming. In: Workshop on Declarative Aspects of Multicore Programming, DAMP 2010, January 19, 2010, Madrid, Spain. (doi:https://doi.org/10.1145/1708046.1708053) (Full text available)

Preview

Orchard, Dominic A. and Matthews, Steve (2008) Integrating Lucid's Declarative Dataflow Paradigm into Object-Orientation. Mathematics in Computer Science, 2 (1). pp. 103-122. ISSN 1661-8270. E-ISSN 1661-8289. (doi:https://doi.org/10.1007/s11786-008-0046-6) (Full text available)

Preview

Orchard, Dominic A. and Mycroft, Alan (2011) Efficient and Correct Stencil Computation via Pattern Matching and Static Typing. In: Proceedings IFIP Working Conference on Domain-Specific Languages, DSL 2011, 6-8th September 2011, Bordeaux, France. (doi:https://doi.org/10.4204/EPTCS.66.4) (Full text available)

Preview

Orchard, Dominic A. and Mycroft, Alan (2012) A Notation for Comonads. In: Revised Selected Papers from 24th International Symposium on Implementation and Application of Functional Languages, IFL 2012, August 30 - September 1, 2012, Oxford, UK. (doi:https://doi.org/10.1007/978-3-642-41582-1_1) (Full text available)

Preview

Orchard, Dominic A. and Petricek, Tomas (2014) Embedding effect systems in Haskell. In: ACM SIGPLAN symposium on Haskell, 4-5 September 2014, Gothenburg, Sweden. (doi:https://doi.org/10.1145/2633357.2633368) (Full text available)

Preview

Orchard, Dominic A. and Petricek, Tomas and Mycroft, Alan (2014) The semantic marriage of monads and effects. CoRR, abs/14 . (Unpublished) (Full text available)

Preview

Orchard, Dominic A. and Rice, Andrew C. (2014) A Computational Science Agenda for Programming Language Research. In: Proceedings of the International Conference on Computational Science, ICCS 2014, Cairns, 10-12 June 2014, Queensland, Australia. (doi:https://doi.org/10.1016/j.procs.2014.05.064) (Full text available)

Preview

Orchard, Dominic A. and Rice, Andrew C. and Oshmyan, Oleg (2015) Evolving Fortran types with inferred units-of-measure. Journal of Computational Science, 9 . pp. 156-162. ISSN 1877-7503. (doi:https://doi.org/10.1016/j.jocs.2015.04.018) (Full text available)

Preview

Orchard, Dominic A. and Schrijvers, Tom (2010) Haskell Type Constraints Unleashed. In: Functional and Logic Programming, 10th International Symposium, FLOPS 2010, April 19-21, 2010, Sendai, Japan. (doi:https://doi.org/10.1007/978-3-642-12251-4_6) (Full text available)

Preview

Orchard, Dominic A. and Yoshida, Nobuko (2016) Effects as Sessions, Sessions as Effects. Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2016, . pp. 568-581. (doi:https://doi.org/10.1145/2837614.2837634) (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. (doi:https://doi.org/10.1007/978-3-642-14107-2_23) (The 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. (doi:https://doi.org/10.1007/978-3-540-78739-6_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)

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. (doi:https://doi.org/10.1007/978-3-642-22863-6_27) (The 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. (doi:https://doi.org/10.1145/1159803.1159815) (The 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 Myreen, Magnus O. and Kumar, Ramana and Tan, Yong Kiam (2016) Functional Big-step Semantics. In: European Symposium on Programming (ESOP), 2-8 April, 2016, Eindhoven, The Netherlands. (doi:https://doi.org/10.1007/978-3-662-49498-1_23) (Full text available)

Preview

Owens, Scott and Norrish, Michael and Kumar, Ramana and Myreen, Magnus O. and Tan, Yong Kiam (2017) Verifying Efficient Function Calls in CakeML. Proceedings of the ACM Programming Languages, 1 (ICFP). ISSN 2475-1421. E-ISSN 2475-1421. (doi:https://doi.org/10.1145/3110262) (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. (doi:https://doi.org/10.1017/S0956796808007090) (The 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. (doi: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. (doi:https://doi.org/10.1007/978-3-642-03359-9_27) (The 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. (doi:https://doi.org/10.1007/s10990-008-9038-0) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

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

Paviotti, Marco and Møgelberg, Rasmus (2016) Denotational semantics of recursive types in synthetic guarded domain theory. In: LICS 2016, 05-08 Jul 2016, New York, USA. (doi:https://doi.org/10.1145/2933575.2934516) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Paviotti, Marco and Møgelberg, Rasmus and Birkedal, Lars (2015) A Model of PCF in Guarded Type Theory. Electronic Notes in Theoretical Computer Science, 319 . pp. 333-349. ISSN 1571-0661. (doi:https://doi.org/10.1016/j.entcs.2015.12.020) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Preview

Petersen, Leaf and Orchard, Dominic A. and Glew, Neal (2013) Automatic SIMD vectorization for Haskell. In: ACM SIGPLAN International Conference on Functional Programming, 25 - 27 Sep 2013, Boston, MA, USA. (doi:https://doi.org/10.1145/2500365.2500605) (Full text available)

Preview

Petricek, Tomas (2015) Against a Universal Definition of 'Type'. In: 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!), October 25 - 30, 2015, Pittsburgh, PA, USA. (doi:https://doi.org/10.1145/2814228.2814249) (Full text available)

Preview

Petricek, Tomas (2017) Data exploration through dot-driven development. In: 31st European Conference on Object-Oriented Programming, 18 Jun - 23 Jun 2017, Barcelona, Spain. (doi:https://doi.org/10.4230/LIPIcs.ECOOP.2017.0) (Full text available)

Preview

Petricek, Tomas (2017) Miscomputation in software: Learning to live with errors. The Art, Science, and Engineering of Programming, 1 (2). Article 14. ISSN 2473-7321. E-ISSN 2473-7321. (doi:https://doi.org/10.22152/programming-journal.org/2017/1/14) (Full text available)

Preview

Petricek, Tomas (2018) What we talk about when we talk about monads. The Art, Science, and Engineering of Programming, 2 (3). p. 12. ISSN 2473-7321. (doi:https://doi.org/10.22152/programming-journal.org/2018/2/12) (Full text available)

Preview

Petricek, Tomas and Guerra, Gustavo and Syme, Don (2016) Types from Data: Making Structured Data First-class Citizens in F#. In: 37th annual ACM SIGPLAN conference on Programming Language Design and Implementation, 13-17 Jun 2016, Santa Barbara, California, United States. (doi:https://doi.org/10.1145/2908080.2908115) (Full text available)

Preview

Petricek, Tomas and Orchard, Dominic A. and Mycroft, Alan (2014) Coeffects: A calculus of context-dependent computation. Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 49 (9). pp. 123-135. ISSN 0362-1340. E-ISSN 1558-1160. (doi:https://doi.org/10.1145/2692915.2628160) (Full text available)

Preview

Petricek, Tomas and Orchard, Dominic A. and Mycroft, Alan (2013) Coeffects: Unified static analysis of context-dependence. In: Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, July 8-12, 2013, Riga, Latvia. (doi:https://doi.org/10.1007/978-3-642-39212-2_35) (Full text available)

Preview

Petricek, Tomas and Syme, Don (2014) The F# Computation Expression Zoo. In: Flatt, Matthew and Guo, Hai-Feng, eds. Practical Aspects of Declarative Languages. Lecture Notes in Computer Science . Springer, New York, NY, USA, pp. 33-48. ISBN 978-3-319-04131-5. (doi:https://doi.org/10.1007/978-3-319-04132-2_3) (Full text available)

Preview

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

Renaux, Thierry and Hoste, Lode and Marr, Stefan and De Meuter, Wolfgang (2012) Parallel Gesture Recognition with Soft Real-Time Guarantees. In: Proceedings of the 2nd edition on Programming Systems, Languages and Applications based on Actors, Agents, and Decentralized Control Abstractions. (doi:https://doi.org/10.1145/2414639.2414646) (Full text available)

Preview

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 Owens, Scott (2016) Benchmarking weak memory models. In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 13-16 March, 2016, Barcelona, Spain. (doi:https://doi.org/10.1145/2851141.2851150) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

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. (doi:https://doi.org/10.1016/j.scico.2011.04.006) (The 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. (doi:https://doi.org/10.1145/2602988.2602992) (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. (doi:https://doi.org/10.1002/cpe.1433) (The 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 (2015) Theory Propagation and Reification. Science of Computer Programming, 111 (1). pp. 3-22. ISSN 0167-6423. (doi:https://doi.org/10.1016/j.scico.2014.05.013) (Full text available)

Preview

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 978-1-4503-2154-9. (doi:https://doi.org/10.1145/2505879.2505901) (Full text available)

Preview

Robbins, Ed and King, Andy and Schrijvers, Tom (2015) Benchmarks, assembly files, and witnesses. On-line. Located at: On-line. (Full text available)

Robbins, Ed and King, Andy and Schrijvers, Tom (2016) From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes. In: Guha, Arjun and Chong, Steve, eds. Symposium on Principles of Programming Languages. ACM Press, St. Petersburg, Florida, USA, pp. 191-203. (doi:https://doi.org/10.1145/2837614.2837633) (Full text available)

Preview

Robbins, Ed and King, Andy and Schrijvers, Tom (2015) Proof appendix to accompany the paper, "From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes". University of Kent (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

Rowe, Reuben N.S. and van Bakel, S.J. (2014) Semantic Types and Approximation for Featherweight Java. Theoretical Computer Science, 517 . pp. 34-74. ISSN 0304-3975. (doi:https://doi.org/10.1016/j.tcs.2013.08.017) (Full text available)

Preview

Rowe, Reuben and Brotherston, James (2017) Automatic cyclic termination proofs for recursive procedures in separation logic. In: Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs - CPP 2017. ACM pp. 53-65. ISBN 978-1-4503-4705-1. (doi:https://doi.org/10.1145/3018610.3018623) (Full text available)

Preview

Rowe, Reuben and Brotherston, James (2017) Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent. In: TABLEAUX 2017: International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, 25-28 Sep 2017, Brasilia, Brazil. (doi:https://doi.org/10.1007/978-3-319-66902-1_18) (Full text available)

Preview

Rowe, Reuben and Van Bakel, Steffen (2011) Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming. In: Typed Lambda Calculi and Applications. Springer pp. 229-244. ISBN 978-3-642-21690-9. (doi:https://doi.org/10.1007/978-3-642-21691-6_19) (Full text available)

Preview

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

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. (doi:https://doi.org/10.1145/2254064.2254102) (The 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 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: ACM SIGPLAN Conference on Programming Language Design and Implementation,, 11 - 16 Jun 2012, Beijing, China. (doi:https://doi.org/10.1145/2254064.2254102) (Full text available)

Preview

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. (doi:https://doi.org/10.1145/1480881.1480929) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Seijas, Pablo Lamela and Thompson, Simon and Francisco, Miguel Ángel (2016) Model extraction and test generation from JUnit test suites. In: Proceedings of the 11th International Workshop on Automation of Software Test - AST '16. , New York, USA pp. 8-14. ISBN 978-1-4503-4151-6. (doi:https://doi.org/10.1145/2896921.2896927) (Full text available)

Preview

Seijas, Pablo Lamela and Thompson, Simon and Francisco, Miguel Ángel (2018) Model extraction and test generation from JUnit test suites. Software Quality Journal, . ISSN 0963-9314. E-ISSN 1573-1367. (doi:https://doi.org/10.1007/s11219-017-9399-x) (Access to this publication is currently restricted. 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. (doi:https://doi.org/10.1145/1785414.1785443) (The 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. (doi:https://doi.org/10.1017/S0956796809990293) (The 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. (doi:https://doi.org/10.1145/1291151.1291155) (The 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. (doi:https://doi.org/10.1080/00207160310001650034) (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 978-3-540-28584-7. (doi:https://doi.org/10.1007/11547662_23) (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 978-3-540-74060-5. (doi:https://doi.org/10.1007/978-3-540-74061-2_8) (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 978-3-540-48937-5. (doi:https://doi.org/10.1007/11924661_11) (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. (doi:https://doi.org/10.1145/1806651.1806669) (The 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 (2015) 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, 8991 . Springer, pp. 133-147. ISBN 978-3-319-17821-9. E-ISBN 978-3-319-17822-6. (doi:https://doi.org/10.1007/978-3-319-17822-6_8) (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. (doi:https://doi.org/10.1007/978-1-4419-1539-9_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)

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. (doi:https://doi.org/10.1007/s00165-007-0028-5) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

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. (doi:https://doi.org/10.1017/S1471068401001107) (Full text available)

Smith, Connor and Kahrs, Stefan (2016) Non-omega-overlapping TRSs are UN. In: Formal Structures for Computation and Deduction, 22-26 Jun 2016, Porto, Portugal. (doi:https://doi.org/10.4230/LIPIcs.FSCD.2016.22) (Full text available)

Preview

Sorensen, Tyler and Donaldson, Alastair F. and Batty, Mark and Gopalakrishnan, Ganesh and Rakamarić, Zvonimir (2016) Portable Inter-workgroup Barrier Synchronisation for GPUs. In: 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, November 02 - 04, 2016, Amsterdam, Netherlands. (doi:https://doi.org/10.1145/2983990.2984032) (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 978-3-0348-0599-5. E-ISBN 978-3-0348-0600-8. (doi:https://doi.org/10.1007/978-3-0348-0600-8_7) (Full text available)

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. (doi:https://doi.org/10.1145/1159861.1159869) (Full text available)

Preview

Sulzmann, Martin and Wang, Meng (2004) A Systematic Translation of Guarded Recursive Data Types to Existential Types. Technical report. National University of Singapore (Unpublished) (Full text available)

Preview

Sulzmann, Martin and Wang, Meng (2005) Translating Generalized Algebraic Data Types to System F. Technical report. National University of Singapore (Unpublished) (Full text available)

Preview

Swalens, Janwillem and Marr, Stefan and De Koster, Joeri and Van Cutsem, Tom (2014) Towards Composable Concurrency Abstractions. In: Proceedings of the Workshop on Programming Language Approaches to Concurrency and communication-cEntric Software (PLACES). (doi:https://doi.org/10.4204/EPTCS.155.8) (Full text available)

Preview

Swalens, Janwillem and Renaux, Thierry and Hoste, Lode and Marr, Stefan and De Meuter, Wolfgang (2013) Cloud PARTE: Elastic Complex Event Processing based on Mobile Actors. In: Proceedings of AGERE! 2013, 3rd International Workshop on Programming based on Actors, Agents, and Decentralized Control. (Full text available)

Preview

T

Tako, Antuela and Kotiadis, Kathy (2015) PartiSim: A multi-methodology framework to support facilitated simulation modelling in healthcare. European Journal of Operational Research, 244 (2). pp. 555-564. ISSN 0377-2217. (doi:https://doi.org/10.1016/j.ejor.2015.01.046) (Full text available)

Preview

Tako, Antuela and Kotiadis, Kathy and Vasilakis, Christos and Miras, Alexander and Le Roux, Carel W (2014) Improving patient waiting times: a simulation study of an obesity care service. Improving patient waiting times: a simulation study of an obesity care service, 23 (5). pp. 373-381. ISSN 2044-5415. (doi:https://doi.org/10.1136/bmjqs-2013-002107) (Full text available)

Preview

Tan, Yong Kiam and Myreen, Magnus O. and Kumar, Ramana and Fox, Anthony and Owens, Scott and Norrish, Michael (2016) A New Verified Compiler Backend for CakeML. In: International Conference on Functional Programming, Sep 2016, Nara, Japan. (doi:https://doi.org/10.1145/2951913.2951924) (Full text available)

Preview

Tan, Yong Kiam and Myreen, Magnus O. and Kumar, Ramana and Fox, Anthony and Owens, Scott and Norrish, Michael (2018) The Verified CakeML Compiler Backend. Journal of Functional Programming, . ISSN 0956-7968. (In press) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Tan, Yong Kiam and Owens, Scott and Kumar, Ramana (2015) A Verified Type System for CakeML. In: Implementation and application of functional programming languages, 14-16 September, 2015, Koblenz, Germany. (doi:https://doi.org/10.1145/2897336.2897344) (Full text available)

Preview

Thompson, Simon (2017) A General Method for Defining Objects by Recursion over Syntax. Journal of Universal Computer Science, 23 (1). pp. 89-111. ISSN 0948-695X. E-ISSN 0948-6968. (Full text available)

Preview

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. Journal of Visual Languages & Computing, . (Full text available)

Preview

Thompson, Simon and Horpacsi, Daniel and Koszegi, Judit (2016) Towards Trustworthy Refactoring in Erlang. In: Fourth International Workshop on Verification and Program Transformation, 2 April 2016, Eindhoven, The Netherlands. (doi:https://doi.org/10.4204/EPTCS.216.5) (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. (doi:https://doi.org/10.1007/s11042-005-2713-9) (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. (doi:https://doi.org/10.1016/j.scico.2011.11.006) (Full text available)

Preview

Thompson, Simon and Lamela Seijas, Pablo (2018) Marlowe: Financial Contracts on Blockchain. In: ISoLA 2018: Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice. (doi:10.1007%2F978-3-030-03427-6_27) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Thompson, Simon and Lamela Seijas, Pablo and Adams, Darryl (2016) Scripting smart contracts for distributed ledger technology. Technical report. Cryptology ePrint Archive (Unpublished) (Full text available)

Preview

Thompson, Simon and Li, Huiqing and Baker, Robert and Adams, Stephen and Trinder, Phil and Chechina, Natalia and Papaspyrou, Nikolaos and Sagonas, Konstantinos and Aronis, Stavros and Bihari, Eva and Boudeville, Olivier and Cesarini, Francesco and de Stefano, Maurizio and Eriksson, Sverker and Fordos, Viktoria and Ghaffari, Amir and Green, Rickard and Hoch, csaba and Klaftenegger, David and Lundin, Kenneth and MacKenzie, Kenneth and Roukounaki, Katerinia and Tsiouris, Yiannis and Winblad, Kjell (2017) Scaling Reliably: Improving the Scalability of the Erlang Distributed Actor Platform. ACM Transactions on Programming Languages and Systems, 39 (4). ISSN 0164-0925. E-ISSN 1558-4593. (doi:https://doi.org/10.1145/3107937) (Full text available)

Preview

Thompson, Simon and Li, Huiqing and Schumacher, Andreas (2017) The pragmatics of clone detection and elimination. The Art, Science, and Engineering of Programming, 1 (2). ISSN 2473-7321. (doi:https://doi.org/10.22152/programming-journal.org/2017/1/8) (Full text available)

Preview

Thompson, Simon and Runciman, Colin (2015) Demur: checking functional-program properties using bounded recursion. In: Sixth Workshop on Tools for Automatic Program Analysis, 08 Sep 2015, Saint-Malo, France. (Access to this publication is currently restricted. 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)

Tsushima, Kanae and Chitil, Olaf (2018) A Common Framework Using Expected Types for Several Type Debugging Approaches. In: FLOPS 2018: Fourteenth International Symposium on Functional and Logic Programming, May 9-11, 2018, Nagoya, Japan. (doi:https://doi.org/10.1007/978-3-319-90686-7_15) (Full text available)

Preview

Tsushima, Kanae and Chitil, Olaf (2014) Enumerating Counter-Factual Type Error Messages with an Existing Type Checker. In: 16th Workshop on Programming and Programming Languages, PPL2014, 5-7 March 2014, Aso, Japan. (Full text available)

Preview

Tsushima, Kanae and Chitil, Olaf (2014) Enumerating Counter-Factual Type Error Messages with an Existing Type Checker (poster+demo). In: 12th Asian Symposium on Programming Languages and Systems, APLAS 2014, 17-19 November 2014, Singapore. (Full text available)

Preview

U

Ugawa, Tomoharu and Jones, Richard (2018) Model Checking Transactional Sapphire. Technical report. School of Computing, University of Kent, Kent, UK (Unpublished) (Full text available)

Preview

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. (doi:https://doi.org/10.1145/2602988.2602991) (Full text available)

Preview

Ugawa, Tomoharu and Ritson, Carl G. and Jones, Richard E. (2018) Transactional Sapphire: Lessons in High Performance, On-the-fly Garbage Collection. Transactions on Programming Languages and Systems, 40 (4). 15:1-15:56. ISSN 0164-0925. E-ISSN 1558-4593. (doi:https://doi.org/10.1145/3226225) (Full text available)

Preview 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). (doi:https://doi.org/10.1145/2038642.2038650) (The 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. (doi:https://doi.org/10.1017/S0956796813000130) (Full text available)

Preview

W

Wang, Meng (2011) Bidirectional Programming and its Applications. Doctor of Philosophy (PhD) thesis, University of Oxford. (Full text available)

Preview

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. (doi:https://doi.org/10.1145/1111542.1111555) (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. (doi:https://doi.org/10.1016/j.scico.2012.07.014) (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. (doi:https://doi.org/10.1145/2034773.2034825) (Full text available)

Preview

Wang, Meng and Najd, Shayan (2014) Semantic Bidirectionalization Revisited. In: Workshop on Partial Evaluation and Program Manipulation (PEPM). (doi:https://doi.org/10.1145/2543728.2543729) (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. (doi:https://doi.org/10.1145/1596614.1596621) (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, 25-28 Aug 2013, Edinburgh, Scotland. (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. (doi:https://doi.org/10.1002/cpe.1471) (The 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. (doi:https://doi.org/10.1145/1734206.1734211) (The 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. (doi:https://doi.org/10.1007/s11047-012-9304-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)

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. (doi:https://doi.org/10.1145/2464157.2466481) (Full text available)

Preview

Wickerson, John and Batty, Mark and Beckmann, Bradford M. and Donaldson, Alastair F. (2015) Remote-scope Promotion: Clarified, Rectified, and Verified. In: 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, 25-30 Oct 2015, Pittsburgh, Pennsylvania. (doi:https://doi.org/10.1145/2814270.2814283) (Full text available)

Preview

Wickerson, John and Batty, Mark and Sorensen, Tyler and Constantinides, George A. (2017) Automatically Comparing Memory Consistency Models. In: POPL 2017: Symposium on Principles of Programming Languages, 18 - 20 Jan 2017, Paris, France. (doi:https://doi.org/10.1145/3093333.3009838) (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)

Zhang, Xin and Grigore, Radu and Si, Xujie and Naik, Mayur (2017) Effective Interactive Resolution of Static Analysis Alarms. Proceedings of the ACM on Programming Languages, 1 (OOPSLA). ISSN 2475-1421. E-ISSN 2475-1421. (doi:https://doi.org/10.1145/3133881) (Full text available)

Preview

Zhang, Xin and Mangal, Ravi and Grigore, Radu and Naik, Mayur and Yang, Hongseok (2014) On abstraction refinement for program analyses in Datalog. In: Programming Language Design and Implementation, 9 June 2014 - 11 June 2014, Edinburgh, UK. (doi:https://doi.org/10.1145/2594291.2594327) (Full text available)

Preview