![]() | 2010 | |
---|---|---|
87 | ![]() ![]() ![]() ![]() ![]() ![]() | Trevor Jim, Yitzhak Mandelbaum, David Walker: Semantics and algorithms for data-dependent grammars. POPL 2010: 417-430 |
86 | ![]() ![]() ![]() ![]() ![]() ![]() | Kathleen Fisher, Yitzhak Mandelbaum, David Walker: The next 700 data description languages. J. ACM 57(2): (2010) |
2009 | ||
85 | ![]() ![]() ![]() ![]() ![]() ![]() | Qian Xi, Kathleen Fisher, David Walker, Kenny Qili Zhu: Ad Hoc Data and the Token Ambiguity Problem. PADL 2009: 91-106 |
84 | ![]() ![]() ![]() ![]() ![]() ![]() | Kenny Qili Zhu, Daniel S. Dantas, Kathleen Fisher, Limin Jia, Yitzhak Mandelbaum, Vivek Pai, David Walker: Language support for processing distributed ad hoc data. PPDP 2009: 243-254 |
83 | ![]() ![]() ![]() ![]() ![]() ![]() | Jay Ligatti, Lujo Bauer, David Walker: Run-Time Enforcement of Nonsafety Policies. ACM Trans. Inf. Syst. Secur. 12(3): (2009) |
82 | ![]() ![]() ![]() ![]() ![]() ![]() | Lujo Bauer, Jay Ligatti, David Walker: Composing expressive runtime security policies. ACM Trans. Softw. Eng. Methodol. 18(3): (2009) |
2008 | ||
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Henry Rolka, Jean C. O'Connor, David Walker: Public Health Information Fusion for Situation Awareness. BioSecure 2008: 1-9 |
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Sadowitz, Shahram Latifi, David Walker: An Overview of Iris and Retina Scans and their Fusion in a Biometric System. IPCV 2008: 119-123 |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | Kathleen Fisher, David Walker, Kenny Qili Zhu, Peter White: From dirt to shovels: fully automatic tool generation from ad hoc data. POPL 2008: 421-434 |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | Frances Perry, David Walker: Reasoning about Control Flow in the Presence of Transient Faults. SAS 2008: 332-346 |
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Kathleen Fisher, David Walker, Kenny Qili Zhu: LearnPADS: automatic tool generation from ad hoc data. SIGMOD Conference 2008: 1299-1302 |
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel S. Dantas, David Walker, Geoffrey Washburn, Stephanie Weirich: AspectML: A polymorphic aspect-oriented functional programming language. ACM Trans. Program. Lang. Syst. 30(3): (2008) |
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Kevin Watkins, Iliano Cervesato, Frank Pfenning, David Walker: Specifying Properties of Concurrent Computations in CLF. Electr. Notes Theor. Comput. Sci. 199: 67-87 (2008) |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Sadowitz, Shahram Latifi, David Walker: An iris and retina multimodal biometric system. IJSN 3(4): 250-257 (2008) |
2007 | ||
73 | ![]() ![]() ![]() ![]() ![]() ![]() | Shayan Farahvash, Chee Quek, William Roberts, David Walker, Mohamed Mostafa, Hauw Liem, Robert Koupal: A Two-port GFSK Direct Modulator for Wideband Applications at 5.8 GHz. ISCAS 2007: 2128-2131 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | Frances Perry, Lester W. Mackey, George A. Reis, Jay Ligatti, David I. August, David Walker: Fault-tolerant typed assembly language. PLDI 2007: 42-53 |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | Yitzhak Mandelbaum, Kathleen Fisher, David Walker, Mary F. Fernández, Artem Gleyzer: PADS/ML: a functional data description language. POPL 2007: 77-83 |
70 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker, Ewa Deelman: Dynamic computational workflows: Discovery, optimisation and scheduling. Scientific Programming 15(4): 191-192 (2007) |
2006 | ||
69 | ![]() ![]() ![]() ![]() ![]() ![]() | Limin Jia, David Walker: ILC: A Foundation for Automated Reasoning About Pointer Programs. ESOP 2006: 131-145 |
68 | ![]() ![]() ![]() ![]() ![]() ![]() | Frances Perry, Limin Jia, David Walker: Expressing heap-shape contracts in linear logic. GPCE 2006: 101-110 |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker, Lester W. Mackey, Jay Ligatti, George A. Reis, David I. August: Static typing for a faulty lambda calculus. ICFP 2006: 38-49 |
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Maria Ángeles Moraga, Coral Calero, Mario Piattini, David Walker: Towards a quality model for grid portals. ICSOFT (1) 2006: 333-338 |
65 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Daly, Mary F. Fernández, Kathleen Fisher, Yitzhak Mandelbaum, David Walker: LAUNCHPADS: A System for Processing Ad Hoc Data. PLAN-X 2006: 90-91 |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Kathleen Fisher, Yitzhak Mandelbaum, David Walker: The next 700 data description languages. POPL 2006: 2-15 |
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel S. Dantas, David Walker: Harmless advice. POPL 2006: 383-396 |
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Mark Daly, Yitzhak Mandelbaum, David Walker, Mary F. Fernández, Kathleen Fisher, Robert Gruber, Xuan Zheng: PADS: an end-to-end system for processing ad hoc data. SIGMOD Conference 2006: 727-729 |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Jay Ligatti, David Walker, Steve Zdancewic: A type-theoretic interpretation of pointcuts and advice. Sci. Comput. Program. 63(3): 240-266 (2006) |
2005 | ||
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Jay Ligatti, Lujo Bauer, David Walker: Enforcing Non-safety Security Policies with Program Monitors. ESORICS 2005: 355-373 |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel S. Dantas, David Walker, Geoffrey Washburn, Stephanie Weirich: PolyAML: a polymorphic aspect-oriented functional programming language. ICFP 2005: 306-319 |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Limin Jia, Frances Spalding, David Walker, Neal Glew: Certifying Compilation for a Language with Stack Allocation. LICS 2005: 407-416 |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Lujo Bauer, Jay Ligatti, David Walker: Composing security policies with polymer. PLDI 2005: 305-314 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Shrideep Pallickara, Geoffrey Fox, Ahmet Uyar, Hongbin Liu, Xi Rao, David Walker, Beytullah Yildiz: Performance of a possible Grid message infrastructure. Concurrency - Practice and Experience 17(2-4): 193-214 (2005) |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Paola Quaglia, David Walker: Types and full abstraction for polyadic pi-calculus. Inf. Comput. 200(2): 215-246 (2005) |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Jay Ligatti, Lujo Bauer, David Walker: Edit automata: enforcement mechanisms for run-time security policies. Int. J. Inf. Sec. 4(1-2): 2-16 (2005) |
2004 | ||
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Limin Jia, David Walker: Modal Proofs as Distributed Programs (Extended Abstract). ESOP 2004: 219-233 |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Arbenz, Rolf Hempel, David Walker: Topic 7: Applications on High Performance Computers. Euro-Par 2004: 476 |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Xinming Ou, Gang Tan, Yitzhak Mandelbaum, David Walker: Dynamic Typing with Dependent Types. IFIP TCS 2004: 437-450 |
2003 | ||
50 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker, Steve Zdancewic, Jay Ligatti: A theory of aspects. ICFP 2003: 127-139 |
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Yitzhak Mandelbaum, David Walker, Robert Harper: An effective theory of type refinements. ICFP 2003: 213-225 |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Amal J. Ahmed, Limin Jia, David Walker: Reasoning about Hierarchical Storage. LICS 2003: 33-44 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Amal J. Ahmed, David Walker: The logical approach to stack typing. TLDI 2003: 74-85 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Kevin Watkins, Iliano Cervesato, Frank Pfenning, David Walker: A Concurrent Logical Framework: The Propositional Fragment. TYPES 2003: 355-377 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Gregory Morrisett, Karl Crary, Neal Glew, David Walker: Stack-based typed assembly language. J. Funct. Program. 13(5): 957-959 (2003) |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker, Steve Zdancewic, Jay Ligatti: A theory of aspects. SIGPLAN Notices 38(9): 127-139 (2003) |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Yitzhak Mandelbaum, David Walker, Robert Harper: An effective theory of type refinements. SIGPLAN Notices 38(9): 213-225 (2003) |
2002 | ||
42 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker: A "Low-Tech" Design Experiment Improving Student Work. ICCE 2002: 849-850 |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Lujo Bauer, Jarred Ligatti, David Walker: Types and Effects for Non-interfering Program Monitors. ISSS 2002: 154-171 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Gregory Morrisett, Karl Crary, Neal Glew, David Walker: Stack-based typed assembly language. J. Funct. Program. 12(1): 3-88 (2002) |
2001 | ||
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Davide Sangiorgi, David Walker: On Barbed Equivalences in pi-Calculus. CONCUR 2001: 292-304 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker, Kevin Watkins: On Regions and Linear Types. ICFP 2001: 181-192 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Anna Philippou, David Walker: A Process-Calculus Analysis of Concurrent Operations on B-Trees. J. Comput. Syst. Sci. 62(1): 73-122 (2001) |
2000 | ||
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Frederick Smith, David Walker, J. Gregory Morrisett: Alias Types. ESOP 2000: 366-381 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Paola Quaglia, David Walker: On Synchronous and Asynchronous Mobile Processes. FoSSaCS 2000: 283-296 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker: A Type System for Expressive Security Policies. POPL 2000: 254-267 |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Xinxin Liu, David Walker: Concurrent objects as mobile processes. Proof, Language, and Interaction 2000: 639-658 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker, J. Gregory Morrisett: Alias Types for Recursive Data Structures. Types in Compilation 2000: 177-206 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker, Karl Crary, J. Gregory Morrisett: Typed memory management via static capabilities. ACM Trans. Program. Lang. Syst. 22(4): 701-771 (2000) |
1999 | ||
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Karl Crary, David Walker, J. Gregory Morrisett: Typed Memory Management in a Calculus of Capabilities. POPL 1999: 262-275 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Gregory Morrisett, David Walker, Karl Crary, Neal Glew: From system F to typed assembly language. ACM Trans. Program. Lang. Syst. 21(3): 527-568 (1999) |
1998 | ||
28 | ![]() ![]() ![]() ![]() ![]() ![]() | William F. McColl, David Walker: Theory and Algorithms for Parallel Computation. Euro-Par 1998: 863-864 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Paola Quaglia, David Walker: On Encoding p-pi in m-pi. FSTTCS 1998: 42-53 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Gregory Morrisett, David Walker, Karl Crary, Neal Glew: From System F to Typed Assembly Language. POPL 1998: 85-97 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | J. Gregory Morrisett, Karl Crary, Neal Glew, David Walker: Stack-Based Typed Assembly Language. Types in Compilation 1998: 28-52 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Anna Philippou, David Walker: On Transformations of Concurrent-Object Programs. Theor. Comput. Sci. 195(2): 259-289 (1998) |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Xinxin Liu, David Walker: Partial Confluence of Proceses and Systems of Objects. Theor. Comput. Sci. 206(1-2): 127-162 (1998) |
1997 | ||
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Anna Philippou, David Walker: A Rigorous Analysis of Concurrent Operations on B-Trees. CONCUR 1997: 361-375 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Anna Philippou, David Walker: On Confluence in the pi-Calculus. ICALP 1997: 314-324 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Linda Smith, D. Brett Ridgely, David Walker, Jim Luke: Application of a mixed H2/Hinfinity approach with a singular Hinfinityconstraint. Int. J. Systems Science 28(1): 55-64 (1997) |
1996 | ||
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Anna Philippou, David Walker: On Transformations of Concurrent Object Programs. CONCUR 1996: 131-146 |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Anna Philippou, David Walker: Social Confluence in Client-Server Systems. CSL 1996: 385-398 |
1995 | ||
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Xinxin Liu, David Walker: A Polymorphic Type System for the Polyadic pi-calculus. CONCUR 1995: 103-116 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Anna Philippou, David Walker: On Sharing and Determinacy in Concurrent Systems. CONCUR 1995: 456-470 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Xinxin Liu, David Walker: Confluence of Processes and Systems of Objects. TAPSOFT 1995: 217-231 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker: Objects in the pi-Calculus Inf. Comput. 116(2): 253-271 (1995) |
1994 | ||
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Penny Collins, David Walker, Frank Hicks, Anne McMahon, Errol Martin: A comparison of methods for teaching information systems design. CHI Conference Companion 1994: 245-246 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker: On Bisimulation in the pi-calculus. CONCUR 1994: 315-330 |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker: Algebraic Proofs of Properties of Objects. ESOP 1994: 501-516 |
1993 | ||
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Robin Milner, Joachim Parrow, David Walker: Modal Logics for Mobile Processes. Theor. Comput. Sci. 114(1): 149-171 (1993) |
1992 | ||
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Robin Milner, Joachim Parrow, David Walker: A Calculus of Mobile Processes, I Inf. Comput. 100(1): 1-40 (1992) |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Robin Milner, Joachim Parrow, David Walker: A Calculus of Mobile Processes, II Inf. Comput. 100(1): 41-77 (1992) |
1991 | ||
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Robin Milner, Joachim Parrow, David Walker: Modal Logics for Mobile Processes. CONCUR 1991: 45-60 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker: Pi-Calculus Semantics of Object-Oriented Programming Languages. TACS 1991: 532-547 |
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Colin Stirling, David Walker: Local Model Checking in the Modal mu-Calculus. Theor. Comput. Sci. 89(1): 161-177 (1991) |
1990 | ||
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul Messina, Clive F. Baillie, Edward W. Felten, Paul Hipes, Ray Williams, Arnold Alagar, Anke Kamrath, Robert Leary, Wayne Pfeiffer, Jack M. Rogers, David Walker: Benchmarking Advanced Architecture Computers. Concurrency - Practice and Experience 2(3): 195-255 (1990) |
1989 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Colin Stirling, David Walker: CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus. Automatic Verification Methods for Finite State Systems 1989: 166-178 |
2 | ![]() ![]() ![]() ![]() ![]() ![]() | David Walker: Some Results on the pi-Calculus. Concurrency: Theory, Language, And Architecture 1989: 21-35 |
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Colin Stirling, David Walker: Local Model Checking in the Modal Mu-Calculus. TAPSOFT, Vol.1 1989: 369-383 |