default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan Mycroft
Person information
- affiliation: University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j17]Dylan McDermott
, Alan Mycroft:
Galois connecting call-by-value and call-by-name. Log. Methods Comput. Sci. 20(1) (2024)- [c94]Jakub Bachurski, Alan Mycroft:
Points for Free: Embedding Pointful Array Programming in Python. ARRAY@PLDI 2024: 1-12 - [i6]Henrijs Princis, Cristina David, Alan Mycroft:
Enhancing SQL Query Generation with Neurosymbolic Reasoning. CoRR abs/2408.13888 (2024) - 2023
- [j16]Lavindra de Silva, Alan Mycroft:
Toward trustworthy programming for autonomous concurrent systems. AI Soc. 38(2): 963-965 (2023) - 2022
- [j15]Swati Jaiswal, Uday P. Khedker, Alan Mycroft:
A Unified Model for Context-Sensitive Program Analyses: : The Blind Men and the Elephant. ACM Comput. Surv. 54(6): 114:1-114:37 (2022) - [c93]Dylan McDermott, Alan Mycroft:
Galois Connecting Call-by-Value and Call-by-Name. FSCD 2022: 32:1-32:19 - [i5]Dylan McDermott, Alan Mycroft:
Galois connecting call-by-value and call-by-name. CoRR abs/2202.08246 (2022) - 2021
- [c92]Indigo Orton, Alan Mycroft:
Source code patches from dynamic analysis. FTfJP@ECOOP 2021: 1-8 - [c91]Indigo Orton, Alan Mycroft:
Refactoring traces to identify concurrency improvements. FTfJP@ECOOP 2021: 16-23 - [c90]Sam Ainsworth, Lionel Zoubritzky, Alan Mycroft, Timothy M. Jones:
ParaDox: Eliminating Voltage Margins via Heterogeneous Fault Tolerance. HPCA 2021: 520-532 - [c89]Indigo Orton, Alan Mycroft:
Tracing and its observer effect on concurrency. MPLR 2021: 88-96 - 2020
- [j14]Oscar Rodriguez-Prieto, Alan Mycroft, Francisco Ortin:
An Efficient and Scalable Platform for Java Source Code Analysis Using Overlaid Graph Representations. IEEE Access 8: 72239-72260 (2020) - [j13]Pritam M. Gharat, Uday P. Khedker, Alan Mycroft:
Generalized Points-to Graphs: A Precise and Scalable Abstraction for Points-to Analysis. ACM Trans. Program. Lang. Syst. 42(2): 8:1-8:78 (2020) - [c88]Andrej Ivaskovic, Alan Mycroft, Dominic Orchard:
Data-Flow Analyses as Effects and Graded Monads. FSCD 2020: 15:1-15:23 - [c87]Andrej Ivaskovic, Alan Mycroft:
A graded Monad for deadlock-free concurrency (functional pearl). Haskell@ICFP 2020: 17-30
2010 – 2019
- 2019
- [c86]Dylan McDermott, Alan Mycroft:
Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order. ESOP 2019: 235-262 - [p3]Robert Chatley, Alastair F. Donaldson, Alan Mycroft:
The Next 7000 Programming Languages. Computing and Software Science 2019: 250-282 - 2018
- [j12]Dylan McDermott, Alan Mycroft:
Call-by-need effects via coeffects. Open Comput. Sci. 8(1): 93-108 (2018) - [i4]Pritam M. Gharat, Uday P. Khedker, Alan Mycroft:
Generalized Points-to Graphs: A New Abstraction of Memory in the Presence of Pointers. CoRR abs/1801.09189 (2018) - 2017
- [c85]Stephen Dolan, Alan Mycroft:
Polymorphism, subtyping, and type inference in MLsub. POPL 2017: 60-72 - 2016
- [c84]Alan Mycroft, Dominic A. Orchard, Tomas Petricek:
Effect Systems Revisited - Control-Flow Algebra and Semantics. Semantics, Logics, and Calculi 2016: 1-32 - [c83]Pritam M. Gharat, Uday P. Khedker, Alan Mycroft:
Flow- and Context-Sensitive Points-To Analysis Using Generalized Points-To Graphs. SAS 2016: 212-236 - 2015
- [j11]Raoul-Gabriel Urma, Alan Mycroft:
Source-code queries with graph databases - with application to programming language usage and evolution. Sci. Comput. Program. 97: 127-134 (2015) - [c82]Jyothish Soman, Negar Miralaei, Alan Mycroft, Timothy M. Jones:
REPAIR: Hard-error recovery via re-execution. DFTS 2015: 76-79 - 2014
- [c81]Rahul Asati, Amitabha Sanyal, Amey Karkare, Alan Mycroft:
Liveness-Based Garbage Collection. CC 2014: 85-106 - [c80]Raoul-Gabriel Urma, Dominic A. Orchard, Alan Mycroft:
Programming language evolution workshop report. PLE@ECOOP 2014: 1-3 - [c79]Tomas Petricek, Dominic A. Orchard, Alan Mycroft:
Coeffects: a calculus of context-dependent computation. ICFP 2014: 123-135 - [c78]Raphaël Proust, Alan Mycroft:
It's Only Illegal If You Get Caught: Breaking Invariants and Getting Away with It. Onward! 2014: 163-171 - [e4]Raoul-Gabriel Urma, Dominic A. Orchard, Alan Mycroft:
Proceedings of the 1st Workshop on Programming Language Evolution, PLE@ECOOP 2014, Uppsala, Sweden, July 28, 2014. ACM 2014, ISBN 978-1-4503-2887-6 [contents] - [i3]Dominic A. Orchard, Tomas Petricek, Alan Mycroft:
The semantic marriage of monads and effects. CoRR abs/1401.5391 (2014) - 2013
- [c77]Janina Voigt, Alan Mycroft:
Dynamic Alias Protection with Aliasing Contracts. APLAS 2013: 140-155 - [c76]Tomas Petricek, Dominic A. Orchard, Alan Mycroft:
Coeffects: Unified Static Analysis of Context-Dependence. ICALP (2) 2013: 385-397 - [c75]Wei Ming Khoo, Alan Mycroft, Ross J. Anderson:
Rendezvous: a search engine for binary code. MSR 2013: 329-338 - [c74]Leo White, Alan Mycroft:
Concise Analysis Using Implication Algebras for Task-Local Memory Optimisation. SAS 2013: 433-453 - [p2]Alan Mycroft, Janina Voigt:
Notions of Aliasing and Ownership. Aliasing in Object-Oriented Programming 2013: 59-83 - [p1]Alan Mycroft:
Aliasing Visions: Ownership and Location. Aliasing in Object-Oriented Programming 2013: 503-504 - 2012
- [c73]Dominic A. Orchard, Alan Mycroft:
A Notation for Comonads. IFL 2012: 1-17 - [c72]Thomas Bøgholm, Bent Thomsen, Kim G. Larsen, Alan Mycroft:
Schedulability Analysis Abstractions for Safety Critical Java. ISORC 2012: 71-78 - [c71]Raoul-Gabriel Urma, Alan Mycroft:
Programming language evolution via source code query languages. PLATEAU 2012: 35-38 - [c70]Peter Calvert, Alan Mycroft:
Control Flow Analysis for the Join Calculus. SAS 2012: 181-197 - [c69]Uday P. Khedker, Alan Mycroft, Prashant Singh Rawat:
Liveness-Based Pointer Analysis. SAS 2012: 265-282 - [c68]Peter Calvert, Alan Mycroft:
Mapping the Join Calculus to Heterogeneous Hardware. PLACES 2012: 7-12 - [i2]Andy King, Alan Mycroft, Thomas W. Reps, Axel Simon:
Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051). Dagstuhl Reports 2(1): 100-116 (2012) - 2011
- [j10]Eleftheria Katsiri, Alan Mycroft:
Linking temporal first-order logic with Bayesian networks for the simulation of pervasive computing systems. Simul. Model. Pract. Theory 19(1): 161-180 (2011) - [c67]Peter Calvert, Alan Mycroft:
Petri-nets as an Intermediate Representation for Heterogeneous Architectures. Euro-Par (2) 2011: 226-237 - [c66]Alan Mycroft:
Isolation Types and Multi-core Architectures. FoVeOOS 2011: 33-48 - [c65]Tomas Petricek, Alan Mycroft, Don Syme:
Extending monads with pattern matching. Haskell 2011: 1-12 - [c64]Jonathan Chee Heng Mak, Alan Mycroft:
Critical-Path-Guided Interactive Parallelisation. ICPP Workshops 2011: 427-436 - [c63]Dominic A. Orchard, Alan Mycroft:
Efficient and Correct Stencil Computation via Pattern Matching and Static Typing. DSL 2011: 68-92 - [i1]Uday P. Khedker, Alan Mycroft, Prashant Singh Rawat:
Lazy Pointer Analysis. CoRR abs/1112.5000 (2011) - 2010
- [j9]Eleftheria Katsiri, Jean Bacon, Alan Mycroft:
Linking Temporal First Order Logic and Hidden Markov Models with Abstract Events. Int. J. Artif. Intell. Tools 19(6): 857-893 (2010) - [c62]Jonathan Chee Heng Mak, Karl-Filip Faxén, Sverker Janson, Alan Mycroft:
Estimating and Exploiting Potential Parallelism by Source-Level Dependence Profiling. Euro-Par (1) 2010: 26-37 - [c61]Dominic A. Orchard, Max Bolingbroke, Alan Mycroft:
Ypnos: declarative, parallel structured grid programming. DAMP 2010: 15-24 - [c60]Boris Feigin, Alan Mycroft:
Formally Efficient Program Instrumentation. RV 2010: 245-252 - [c59]Tom Schrijvers, Alan Mycroft:
Strictness Meets Data Flow. SAS 2010: 439-454 - [e3]Kohei Honda, Alan Mycroft:
Proceedings Third Workshop on Programming Language Approaches to Concurrency and communication-cEntric Software, PLACES 2010, Paphos, Cyprus, 21st March 2010. EPTCS 69, 2010 [contents]
2000 – 2009
- 2009
- [c58]Kathryn E. Gray, Alan Mycroft:
Logical Testing. FASE 2009: 186-200 - [c57]Jonathan Chee Heng Mak, Alan Mycroft:
Limits of parallelism using dynamic dependency graphs. WODA 2009: 42-48 - [c56]Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt:
A new approach to parallelising tracing algorithms. ISMM 2009: 10-19 - [c55]Cosmin E. Oancea, Alan Mycroft, Tim Harris:
A lightweight in-place implementation for software thread-level speculation. SPAA 2009: 223-232 - 2008
- [c54]Sriram Srinivasan, Alan Mycroft:
Kilim: Isolation-Typed Actors for Java. ECOOP 2008: 104-128 - [c53]Jonathan J. Davies, Alastair R. Beresford, Alan Mycroft:
Language-Based Optimisation of Sensor-Driven Distributed Computing Applications. FASE 2008: 407-422 - [c52]Cosmin E. Oancea, Alan Mycroft:
Software thread-level speculation: an optimistic library implementation. IWMSE@ICSE 2008: 23-32 - [c51]Cosmin E. Oancea, Alan Mycroft:
Set-Congruence Dynamic Analysis for Thread-Level Speculation (TLS). LCPC 2008: 156-171 - [c50]Boris Feigin, Alan Mycroft:
Jones optimality and hardware virtualization: a report on work in progress. PEPM 2008: 169-175 - 2007
- [j8]Eleftheria Katsiri, Jean Bacon, Alan Mycroft:
SCAFOS: linking sensor data to context-aware applications using abstract events. Int. J. Pervasive Comput. Commun. 3(4): 347-377 (2007) - [j7]Sarah Thompson, Alan Mycroft:
Abstract interpretation of combinational asynchronous circuits. Sci. Comput. Program. 64(1): 166-183 (2007) - [c49]Cosmin E. Oancea, Alan Mycroft:
A Lightweight Model for Software Thread-Level Speculation (TLS). PACT 2007: 419 - [c48]Anton Lokhmotov, Alan Mycroft, Andrew Richards:
Delayed Side-Effects Ease Multi-core Programming. Euro-Par 2007: 641-650 - [c47]Anton Lokhmotov, Benedict R. Gaster, Alan Mycroft, Neil Hickey, David Stuttard:
Revisiting SIMD Programming. LCPC 2007: 32-46 - [c46]Kyoko Iwasawa, Alan Mycroft:
Choosing Method of the Most Effective Nested Loop Shearing for Parallelism. PDCAT 2007: 267-276 - [c45]Alan Mycroft:
Programming Language Design and Analysis Motivated by Hardware Evolution. SAS 2007: 18-33 - [c44]Anton Lokhmotov, Alan Mycroft:
Optimal bit-reversal using vector permutations. SPAA 2007: 198-199 - [c43]Robin Henry Message, Alan Mycroft:
Controlling Control Flow in Web Applications. WWV 2007: 119-131 - 2006
- [c42]Ben Rudiak-Gould, Alan Mycroft, Simon L. Peyton Jones:
Haskell Is Not Not ML. ESOP 2006: 38-53 - [c41]Eleftheria Katsiri, Alan Mycroft:
Applying Bayesian Networks to Sensor-Driven Systems. ISWC 2006: 149-150 - [c40]Sarah Thompson, Alan Mycroft:
Bit-level partial evaluation of synchronous circuits. PEPM 2006: 29-37 - [e2]Alan Mycroft, Andreas Zeller:
Compiler Construction, 15th International Conference, CC 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 30-31, 2006, Proceedings. Lecture Notes in Computer Science 3923, Springer 2006, ISBN 3-540-33050-X [contents] - 2005
- [c39]Robert Ennals, Richard Sharp, Alan Mycroft:
Task Partitioning for Multi-core Network Processors. CC 2005: 76-90 - [c38]Eleftheria Katsiri, Alan Mycroft:
Model Checking for Sentient Computing: An Axiomatic Approach. MCMP@MDM 2005 - 2004
- [j6]Maziar Goudarzi, Shaahin Hessabi, Alan Mycroft:
Object-Oriented Embedded System Development Based on Synthesis and Reuse of OO-ASIPs. J. Univers. Comput. Sci. 10(9): 1123-1155 (2004) - [c37]Neil Johnson, Alan Mycroft:
Using Multiple Memory Access Instructions for Reducing Code Size. CC 2004: 265-280 - [c36]Maziar Goudarzi, Shaahin Hessabi, Alan Mycroft:
Overhead-Free Polymorphism in Network-on-Chip Implementation of Object-Oriented Models. DATE 2004: 1380-1381 - [c35]Robert Ennals, Richard Sharp, Alan Mycroft:
Linear Types for Packet Processing. ESOP 2004: 204-218 - [c34]Sarah Thompson, Alan Mycroft:
Abstract Interpretation of Combinational Asynchronous Circuits. SAS 2004: 181-196 - [c33]S. N. I. Mount, Robert M. Newman, R. J. Low, Alan Mycroft:
Exstatic: a generic static checker applied to documentation systems. SIGDOC 2004: 52-57 - 2003
- [j5]Uday P. Khedker, Dhananjay M. Dhamdhere, Alan Mycroft:
Bidirectional data flow analysis for type inferencing. Comput. Lang. Syst. Struct. 29(1-2): 15-44 (2003) - [j4]Alan Mycroft, Richard Sharp:
Higher-level techniques for hardware description and synthesis. Int. J. Softw. Tools Technol. Transf. 4(3): 271-297 (2003) - [c32]Neil Johnson, Alan Mycroft:
Combined Code Motion and Register Allocation Using the Value State Dependence Graph. CC 2003: 1-16 - [c31]Anil Madhavapeddy, Alan Mycroft, David J. Scott, Richard Sharp:
The Case for Abstracting Security Policies. Security and Management 2003: 156-160 - [c30]David J. Scott, Alastair R. Beresford, Alan Mycroft:
Spatial Security Policies for Mobile Agents in a Sentient Computing Environment. FASE 2003: 102-117 - [c29]Maziar Goudarzi, Shaahin Hessabi, Alan Mycroft:
Object-Oriented ASIP Design and Synthesis. FDL 2003: 680-692 - [c28]Simon Frankau, Alan Mycroft:
Stream Processing Hardware from Functional Language Specifications. HICSS 2003: 278 - [c27]David J. Scott, Alastair R. Beresford, Alan Mycroft:
Spatial Policies for Sentient Mobile Applications. POLICY 2003: 147-157 - [c26]Nicholas Nethercote, Alan Mycroft:
Redux: A Dynamic Dataflow Tracer. RV@CAV 2003: 149-170 - 2002
- [c25]Nicholas Nethercote, Alan Mycroft:
The cache behaviour of large lazy functional programs on stock hardware. MSP/ISMM 2002: 44-55 - 2001
- [c24]Alan Mycroft, Richard Sharp:
Hardware Synthesis Using SAFL and Application to Processor Design. CHARME 2001: 13-39 - [c23]Richard Sharp, Alan Mycroft:
A Higher-Level Language for Hardware Synthesis. CHARME 2001: 228-243 - [c22]Richard Sharp, Alan Mycroft:
Soft Scheduling for Hardware. SAS 2001: 57-72 - [c21]Alan Mycroft, Richard Sharp:
Hardware/Software Co-Design Using Functional Languages. TACAS 2001: 236-251 - [c20]Alan Mycroft, Atsushi Ohori, Shin-ya Katsumata:
Comparing Type-Based and Proof-Directed Decompilation. WCRE 2001: 362-367 - 2000
- [c19]Alan Mycroft, Richard Sharp:
A Statically Allocated Parallel Functional Language. ICALP 2000: 37-48 - [c18]Alan Mycroft:
Logic Programming and Functional Nets. WFLP 2000: 1-7
1990 – 1999
- 1999
- [c17]Alan Mycroft:
Type-Based Decompilation (or Program Reconstruction via Type Reconstruction). ESOP 1999: 208-223 - 1996
- [j3]Alan Mycroft:
On Integration of Programming Paradigms. ACM Comput. Surv. 28(2): 309-311 (1996) - [c16]Flemming Nielson, Patrick Cousot, Mads Dam, Pierpaolo Degano, Pierre Jouvelot, Alan Mycroft, Bent Thomsen:
Logical and Operational Methods in the Analysis of Programs and Systems. LOMAPS 1996: 1-21 - 1995
- [j2]Christine Ernoult, Alan Mycroft:
Untyped Strictness Analysis. J. Funct. Program. 5(1): 37-49 (1995) - [c15]Alan Mycroft, Pierpaolo Degano, Corrado Priami:
Complexity as a Basis for Comparing Semantic Models of Concurrency. ASIAN 1995: 141-155 - [c14]Alan Mycroft, Kirsten Lackner Solberg:
Uniform PERs and Comportment Analysis. PLILP 1995: 169-187 - [e1]Alan Mycroft:
Static Analysis, Second International Symposium, SAS'95, Glasgow, UK, September 25-27, 1995, Proceedings. Lecture Notes in Computer Science 983, Springer 1995, ISBN 3-540-60360-3 [contents] - 1993
- [c13]Alan Mycroft:
Completeness and predicate-based abstract interpretation. PEPM 1993: 179-185 - 1992
- [c12]Alan Mycroft:
Incremental Polymorphic Type Checking with Update. LFCS 1992: 347-357 - [c11]Alan Mycroft, Mads Rosendahl:
Minimal Function Graphs are not Instrumented. WSA 1992: 60-67 - 1991
- [c10]Christine Ernoult, Alan Mycroft:
Uniform Ideals and Strictness Analysis. ICALP 1991: 47-59
1980 – 1989
- 1986
- [c9]Neil D. Jones, Alan Mycroft:
Data Flow Analysis of Applicative Programs Using Minimal Function Graphs. POPL 1986: 296-306 - 1985
- [c8]Alan Mycroft, Neil D. Jones:
A relational framework for abstract interpretation. Programs as Data Objects 1985: 156-171 - 1984
- [j1]Alan Mycroft, Richard A. O'Keefe:
A Polymorphic Type System for Prolog. Artif. Intell. 23(3): 295-307 (1984) - [c7]Ursula Goltz, Alan Mycroft:
On the Relationship of CCS and Petri Nets. ICALP 1984: 196-208 - [c6]Alan Mycroft:
Polymorphic Type Schemes and Recursive Definitions. Symposium on Programming 1984: 217-228 - [c5]Neil D. Jones, Alan Mycroft:
Stepwise Development of Operational and Denotational Semantics for Prolog. SLP 1984: 281-288 - [c4]