| 2008 |
|---|
| 33 | EE | Shriram Krishnamurthi,
Kathi Fisler,
Daniel J. Dougherty,
Daniel Yoo:
Alchemy: transmuting base alloy specifications into implementations.
SIGSOFT FSE 2008: 158-169 |
| 32 | EE | Daniel J. Dougherty,
Silvia Ghilezan,
Pierre Lescanne:
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage.
Theor. Comput. Sci. 398(1-3): 114-128 (2008) |
| 2007 |
|---|
| 31 | EE | Daniel J. Dougherty,
Kathi Fisler,
Shriram Krishnamurthi:
Obligations and Their Interaction with Programs.
ESORICS 2007: 375-389 |
| 30 | EE | Daniel J. Dougherty,
Claude Kirchner,
Hélène Kirchner,
Anderson Santana de Oliveira:
Modular Access Control Via Strategic Rewriting.
ESORICS 2007: 578-593 |
| 2006 |
|---|
| 29 | EE | Daniel J. Dougherty,
Kathi Fisler,
Shriram Krishnamurthi:
Specifying and Reasoning About Dynamic Access-Control Policies.
IJCAR 2006: 632-646 |
| 28 | EE | Daniel J. Dougherty,
Pierre Lescanne,
Luigi Liquori:
Addressed term rewriting systems: application to a typed object calculus.
Mathematical Structures in Computer Science 16(4): 667-709 (2006) |
| 27 | EE | Murali Mani,
Song Wang,
Daniel J. Dougherty,
Elke A. Rundensteiner:
Join minimization in XML-to-SQL translation: an algebraic approach.
SIGMOD Record 35(1): 20-25 (2006) |
| 26 | EE | Daniel J. Dougherty,
Claudio Gutiérrez:
Normal forms for binary relations.
Theor. Comput. Sci. 360(1-3): 228-246 (2006) |
| 2005 |
|---|
| 25 | EE | Daniel J. Dougherty,
Silvia Ghilezan,
Pierre Lescanne,
Silvia Likavec:
Strong Normalization of the Dual Classical Sequent Calculus.
LPAR 2005: 169-183 |
| 24 | EE | Daniel J. Dougherty,
Pierre Lescanne,
Luigi Liquori,
Frédéric Lang:
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract.
Electr. Notes Theor. Comput. Sci. 127(5): 57-82 (2005) |
| 23 | EE | Daniel J. Dougherty,
Silvia Ghilezan,
Pierre Lescanne:
Intersection and Union Types in the lambda-my-my/tilde-calculus.
Electr. Notes Theor. Comput. Sci. 136: 153-172 (2005) |
| 2004 |
|---|
| 22 | EE | Daniel J. Dougherty,
Silvia Ghilezan,
Pierre Lescanne:
Characterizing strong normalization in a language with control operators.
PPDP 2004: 155-166 |
| 21 | EE | Stéphane Lengrand,
Pierre Lescanne,
Daniel J. Dougherty,
Mariangiola Dezani-Ciancaglini,
Steffen van Bakel:
Intersection types for explicit substitutions.
Inf. Comput. 189(1): 17-42 (2004) |
| 20 | EE | Daniel J. Dougherty,
Stanley M. Selkow:
The complexity of the certification of properties of Stable Marriage.
Inf. Process. Lett. 92(6): 275-277 (2004) |
| 2003 |
|---|
| 19 | | Daniel J. Dougherty,
Pierre Lescanne:
Reductions, Intersection Types, and Explicit Substitutions.
Mathematical Structures in Computer Science 13(1): 55-85 (2003) |
| 2002 |
|---|
| 18 | | Daniel J. Dougherty,
Stéphane Lengrand,
Pierre Lescanne:
An Improved System of Intersection Types for Explicit Substitutions.
IFIP TCS 2002: 511-523 |
| 17 | EE | Daniel J. Dougherty,
Tomasz Wierzbicki:
A Decidable Variant of Higher Order Matching.
RTA 2002: 340-351 |
| 2001 |
|---|
| 16 | EE | Daniel J. Dougherty,
Pierre Lescanne:
Reductions, Intersection Types, and Explicit Substitutions.
TLCA 2001: 121-135 |
| 2000 |
|---|
| 15 | | Daniel J. Dougherty,
Claudio Gutiérrez:
Normal Forms and Reduction for Theories of Binary Relations.
RTA 2000: 95-109 |
| 14 | | Daniel J. Dougherty,
Ramesh Subrahmanyam:
Equality between Functionals in the Presence of Coproducts.
Inf. Comput. 157(1-2): 52-83 (2000) |
| 1998 |
|---|
| 13 | EE | Friedrich Otto,
Paliath Narendran,
Daniel J. Dougherty:
Equational Unification, Word Unification, and 2nd-Order Equational Unification.
Theor. Comput. Sci. 198(1-2): 1-47 (1998) |
| 1995 |
|---|
| 12 | | Daniel J. Dougherty,
Ramesh Subrahmanyam:
Equality between Functionals in the Presence of Coproducts
LICS 1995: 282-291 |
| 11 | | Friedrich Otto,
Paliath Narendran,
Daniel J. Dougherty:
Some Independent Results for Equational Unification.
RTA 1995: 367-381 |
| 10 | EE | Daniel J. Dougherty,
Patricia Johann:
A Combinatory Logic Approach to Higher-Order E-Unification.
Theor. Comput. Sci. 139(1&2): 207-242 (1995) |
| 1993 |
|---|
| 9 | | Daniel J. Dougherty:
Some Lambda Calculi with Categorial Sums and Products.
RTA 1993: 137-151 |
| 8 | | Daniel J. Dougherty:
Closed Categories and Categorial Grammar.
Notre Dame Journal of Formal Logic 34(1): 36-49 (1993) |
| 7 | | Daniel J. Dougherty:
Higher-Order Unification via Combinators.
Theor. Comput. Sci. 114(2): 273-298 (1993) |
| 1992 |
|---|
| 6 | | Daniel J. Dougherty,
Patricia Johann:
A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract).
CADE 1992: 79-93 |
| 5 | | Daniel J. Dougherty:
Adding Algebraic Rewriting to the Untyped Lambda Calculus
Inf. Comput. 101(2): 251-267 (1992) |
| 4 | | Daniel J. Dougherty,
Patricia Johann:
An Improved General E-Unification Method.
J. Symb. Comput. 14(4): 303-320 (1992) |
| 1991 |
|---|
| 3 | | Daniel J. Dougherty:
Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract).
RTA 1991: 37-48 |
| 1990 |
|---|
| 2 | | Daniel J. Dougherty,
Patricia Johann:
An Improved General E-Unification Method.
CADE 1990: 261-275 |
| 1987 |
|---|
| 1 | EE | Daniel J. Dougherty:
Decomposition of infinite matrices.
J. Comb. Theory, Ser. A 45(2): 277-289 (1987) |
