 | 2009 |
|---|
| 62 |       | Kathryn E. Gray,
Alan Mycroft:
Logical Testing.
FASE 2009: 186-200 |
| 61 | | Cosmin E. Oancea,
Alan Mycroft,
Stephen M. Watt:
A new approach to parallelising tracing algorithms.
ISMM 2009: 10-19 |
| 60 | | Cosmin E. Oancea,
Alan Mycroft,
Tim Harris:
A lightweight in-place implementation for software thread-level speculation.
SPAA 2009: 223-232 |
| 2008 |
|---|
| 59 | | Sriram Srinivasan,
Alan Mycroft:
Kilim: Isolation-Typed Actors for Java.
ECOOP 2008: 104-128 |
| 58 | | Jonathan J. Davies,
Alastair R. Beresford,
Alan Mycroft:
Language-Based Optimisation of Sensor-Driven Distributed Computing Applications.
FASE 2008: 407-422 |
| 57 | | Cosmin E. Oancea,
Alan Mycroft:
Set-Congruence Dynamic Analysis for Thread-Level Speculation (TLS).
LCPC 2008: 156-171 |
| 56 | | Boris Feigin,
Alan Mycroft:
Jones optimality and hardware virtualization: a report on work in progress.
PEPM 2008: 169-175 |
| 55 | | Robin Message,
Alan Mycroft:
Controlling Control Flow in Web Applications.
Electr. Notes Theor. Comput. Sci. 200(3): 119-131 (2008) |
| 2007 |
|---|
| 54 | | Anton Lokhmotov,
Alan Mycroft,
Andrew Richards:
Delayed Side-Effects Ease Multi-core Programming.
Euro-Par 2007: 641-650 |
| 53 | | Anton Lokhmotov,
Benedict R. Gaster,
Alan Mycroft,
Neil Hickey,
David Stuttard:
Revisiting SIMD Programming.
LCPC 2007: 32-46 |
| 52 | | Cosmin E. Oancea,
Alan Mycroft:
A Lightweight Model for Software Thread-Level Speculation (TLS).
PACT 2007: 419 |
| 51 | | Kyoko Iwasawa,
Alan Mycroft:
Choosing Method of the Most Effective Nested Loop Shearing for Parallelism.
PDCAT 2007: 267-276 |
| 50 | | Alan Mycroft:
Programming Language Design and Analysis Motivated by Hardware Evolution.
SAS 2007: 18-33 |
| 49 | | Anton Lokhmotov,
Alan Mycroft:
Optimal bit-reversal using vector permutations.
SPAA 2007: 198-199 |
| 48 | | Sarah Thompson,
Alan Mycroft:
Abstract interpretation of combinational asynchronous circuits.
Sci. Comput. Program. 64(1): 166-183 (2007) |
| 2006 |
|---|
| 47 |  | 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
Springer 2006 |
| 46 | | Ben Rudiak-Gould,
Alan Mycroft,
Simon L. Peyton Jones:
Haskell Is Not Not ML.
ESOP 2006: 38-53 |
| 45 | | Eleftheria Katsiri,
Alan Mycroft:
Applying Bayesian Networks to Sensor-Driven Systems.
ISWC 2006: 149-150 |
| 44 | | Sarah Thompson,
Alan Mycroft:
Bit-level partial evaluation of synchronous circuits.
PEPM 2006: 29-37 |
| 2005 |
|---|
| 43 | | Robert Ennals,
Richard Sharp,
Alan Mycroft:
Task Partitioning for Multi-core Network Processors.
CC 2005: 76-90 |
| 2004 |
|---|
| 42 | | Neil Johnson,
Alan Mycroft:
Using Multiple Memory Access Instructions for Reducing Code Size.
CC 2004: 265-280 |
| 41 | | Maziar Goudarzi,
Shaahin Hessabi,
Alan Mycroft:
Overhead-Free Polymorphism in Network-on-Chip Implementation of Object-Oriented Models.
DATE 2004: 1380-1381 |
| 40 | | Robert Ennals,
Richard Sharp,
Alan Mycroft:
Linear Types for Packet Processing.
ESOP 2004: 204-218 |
| 39 | | Sarah Thompson,
Alan Mycroft:
Abstract Interpretation of Combinational Asynchronous Circuits.
SAS 2004: 181-196 |
| 38 | | Maziar Goudarzi,
Shaahin Hessabi,
Alan Mycroft:
Object-Oriented Embedded System Development Based on Synthesis and Reuse of OO-ASIPs.
J. UCS 10(9): 1123-1155 (2004) |
| 2003 |
|---|
| 37 | | Neil Johnson,
Alan Mycroft:
Combined Code Motion and Register Allocation Using the Value State Dependence Graph.
CC 2003: 1-16 |
| 36 | | David Scott,
Alastair R. Beresford,
Alan Mycroft:
Spatial Security Policies for Mobile Agents in a Sentient Computing Environment.
FASE 2003: 102-117 |
| 35 | | Maziar Goudarzi,
Shaahin Hessabi,
Alan Mycroft:
Object-Oriented ASIP Design and Synthesis.
FDL 2003: 680-692 |
| 34 | | Simon Frankau,
Alan Mycroft:
Stream Processing Hardware from Functional Language Specifications.
HICSS 2003: 278 |
| 33 | | David Scott,
Alastair R. Beresford,
Alan Mycroft:
Spatial Policies for Sentient Mobile Applications.
POLICY 2003: 147-157 |
| 32 | | Anil Madhavapeddy,
Alan Mycroft,
David Scott,
Richard Sharp:
The Case for Abstracting Security Policies.
Security and Management 2003: 156-160 |
| 31 | | Uday P. Khedker,
Dhananjay M. Dhamdhere,
Alan Mycroft:
Bidirectional data flow analysis for type inferencing.
Computer Languages, Systems & Structures 29(1-2): 15-44 (2003) |
| 30 | | Nicholas Nethercote,
Alan Mycroft:
Redux: A Dynamic Dataflow Tracer.
Electr. Notes Theor. Comput. Sci. 89(2): (2003) |
| 29 | | Alan Mycroft,
Richard Sharp:
Higher-level techniques for hardware description and synthesis.
STTT 4(3): 271-297 (2003) |
| 2002 |
|---|
| 28 | | Nicholas Nethercote,
Alan Mycroft:
The cache behaviour of large lazy functional programs on stock hardware.
MSP/ISMM 2002: 44-55 |
| 2001 |
|---|
| 27 | | Alan Mycroft,
Richard Sharp:
Hardware Synthesis Using SAFL and Application to Processor Design.
CHARME 2001: 13-39 |
| 26 | | Richard Sharp,
Alan Mycroft:
A Higher-Level Language for Hardware Synthesis.
CHARME 2001: 228-243 |
| 25 | | Richard Sharp,
Alan Mycroft:
Soft Scheduling for Hardware.
SAS 2001: 57-72 |
| 24 | | Alan Mycroft,
Richard Sharp:
Hardware/Software Co-Design Using Functional Languages.
TACAS 2001: 236-251 |
| 23 | | Alan Mycroft,
Atsushi Ohori,
Shin-ya Katsumata:
Comparing Type-Based and Proof-Directed Decompilation.
WCRE 2001: 362-367 |
| 2000 |
|---|
| 22 | | Alan Mycroft,
Richard Sharp:
A Statically Allocated Parallel Functional Language.
ICALP 2000: 37-48 |
| 21 | | Alan Mycroft:
Logic Programming and Functional Nets.
WFLP 2000: 1-7 |
| 1999 |
|---|
| 20 | | Alan Mycroft:
Type-Based Decompilation (or Program Reconstruction via Type Reconstruction).
ESOP 1999: 208-223 |
| 1996 |
|---|
| 19 | | 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 |
| 18 | | Alan Mycroft:
On Integration of Programming Paradigms.
ACM Comput. Surv. 28(2): 309-311 (1996) |
| 1995 |
|---|
| 17 | | Alan Mycroft:
Static Analysis, Second International Symposium, SAS'95, Glasgow, UK, September 25-27, 1995, Proceedings
Springer 1995 |
| 16 | | Alan Mycroft,
Pierpaolo Degano,
Corrado Priami:
Complexity as a Basis for Comparing Semantic Models of Concurrency.
ASIAN 1995: 141-155 |
| 15 | | Alan Mycroft,
Kirsten Lackner Solberg:
Uniform PERs and Comportment Analysis
PLILP 1995: 169-187 |
| 14 | | Christine Ernoult,
Alan Mycroft:
Untyped Strictness Analysis.
J. Funct. Program. 5(1): 37-49 (1995) |
| 1993 |
|---|
| 13 | | Alan Mycroft:
Completeness and predicate-based abstract interpretation.
PEPM 1993: 179-185 |
| 1992 |
|---|
| 12 | | Alan Mycroft:
Incremental Polymorphic Type Checking with Update.
LFCS 1992: 347-357 |
| 11 | | Alan Mycroft,
Mads Rosendahl:
Minimal Function Graphs are not Instrumented.
WSA 1992: 60-67 |
| 1991 |
|---|
| 10 | | Christine Ernoult,
Alan Mycroft:
Uniform Ideals and Strictness Analysis.
ICALP 1991: 47-59 |
| 1986 |
|---|
| 9 | | Neil D. Jones,
Alan Mycroft:
Data Flow Analysis of Applicative Programs Using Minimal Function Graphs.
POPL 1986: 296-306 |
| 1985 |
|---|
| 8 | | Alan Mycroft,
Neil D. Jones:
A relational framework for abstract interpretation.
Programs as Data Objects 1985: 156-171 |
| 1984 |
|---|
| 7 | | Ursula Goltz,
Alan Mycroft:
On the Relationship of CCS and Petri Nets.
ICALP 1984: 196-208 |
| 6 | | Neil D. Jones,
Alan Mycroft:
Stepwise Development of Operational and Denotational Semantics for Prolog.
SLP 1984: 281-288 |
| 5 | | Alan Mycroft:
Logic Programs and Many-Valued Logic.
STACS 1984: 274-286 |
| 4 | | Alan Mycroft:
Polymorphic Type Schemes and Recursive Definitions.
Symposium on Programming 1984: 217-228 |
| 3 | | Alan Mycroft,
Richard A. O'Keefe:
A Polymorphic Type System for Prolog.
Artif. Intell. 23(3): 295-307 (1984) |
| 1983 |
|---|
| 2 | | Alan Mycroft,
Flemming Nielson:
Strong Abstract Interpretation Using Power Domains (Extended Abstract).
ICALP 1983: 536-547 |
| 1980 |
|---|
| 1 | | Alan Mycroft:
The Theory and Practice of Transforming Call-by-need into Call-by-value.
Symposium on Programming 1980: 269-281 |
