Daniel J. Dougherty

According to our database1, Daniel J. Dougherty
  • authored at least 62 papers between 1986 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
The power of "why" and "why not": enriching scenario exploration with provenance.
Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, 2017

User Studies of Principled Model Finder Output.
Proceedings of the Software Engineering and Formal Methods - 15th International Conference, 2017

CAESAR: Context-Aware Event Stream Analytics for Urban Transportation Services.
Proceedings of the 20th International Conference on Extending Database Technology, 2017

2016
Context-Aware Event Stream Analytics.
Proceedings of the 19th International Conference on Extending Database Technology, 2016

A Realizability Interpretation for Intersection and Union Types.
Proceedings of the Programming Languages and Systems - 14th Asian Symposium, 2016

2015
Exploring Theories with a Model-Finding Assistant.
Proceedings of the Automated Deduction - CADE-25, 2015

2014
A Hybrid Analysis for Security Protocols with State.
CoRR, 2014

A Hybrid Analysis for Security Protocols with State.
Proceedings of the Integrated Formal Methods - 11th International Conference, 2014

Decidability for Lightweight Diffie-Hellman Protocols.
Proceedings of the IEEE 27th Computer Security Foundations Symposium, 2014

Razor: Provenance and Exploration in Model-Finding.
Proceedings of the 4th Workshop on Practical Aspects of Automated Reasoning, 2014

2013
A balance of power: expressive, analyzable controller programming.
Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, 2013

Aluminum: principled scenario exploration through minimality.
Proceedings of the 35th International Conference on Software Engineering, 2013

2012
Symbolic Protocol Analysis for Diffie-Hellman
CoRR, 2012

An Algebra for Symbolic Diffie-Hellman Protocol Analysis.
Proceedings of the Trustworthy Global Computing - 7th International Symposium, 2012

Realtime healthcare services via nested complex event processing technology.
Proceedings of the 15th International Conference on Extending Database Technology, 2012

Toward a More Complete Alloy.
Proceedings of the Abstract State Machines, Alloy, B, VDM, and Z, 2012

2011
Optimizing complex sequence pattern extraction using caching.
Proceedings of the Workshops Proceedings of the 27th International Conference on Data Engineering, 2011

High-performance nested CEP query processing over event streams.
Proceedings of the 27th International Conference on Data Engineering, 2011

2010
Embracing policy engineering.
Proceedings of the Workshop on Future of Software Engineering Research, 2010

Logic and Computation in a Lambda Calculus with Intersection and Union Types.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

The Margrave Tool for Firewall Analysis.
Proceedings of the Uncovering the Secrets of System Administration: Proceedings of the 24th Large Installation System Administration Conference, 2010

Processing nested complex sequence pattern queries over event streams.
Proceedings of the 7th Workshop on Data Management for Sensor Networks, 2010

NEEL: The Nested Complex Event Language for Real-Time Event Analytics.
Proceedings of the Enabling Real-Time Business Intelligence - 4th International Workshop, 2010

2009
Preface.
Electr. Notes Theor. Comput. Sci., 2009

An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications
Proceedings of the Proceedings Tenth International Workshop on Rule-Based Programming, 2009

Extensional and Intensional Strategies
Proceedings of the Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming, 2009

Towards an Operational Semantics for Alloy.
Proceedings of the FM 2009: Formal Methods, 2009

Multi-Join Continuous Query Optimization: Covering the Spectrum of Linear, Acyclic, and Cyclic Queries.
Proceedings of the Dataspace: The Final Frontier, 2009

2008
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage.
Theor. Comput. Sci., 2008

Alchemy: transmuting base alloy specifications into implementations.
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2008

2007
Modular Access Control Via Strategic Rewriting.
Proceedings of the Computer Security, 2007

Obligations and Their Interaction with Programs.
Proceedings of the Computer Security, 2007

2006
Normal forms for binary relations.
Theor. Comput. Sci., 2006

Join minimization in XML-to-SQL translation: an algebraic approach.
SIGMOD Record, 2006

Addressed term rewriting systems: application to a typed object calculus.
Mathematical Structures in Computer Science, 2006

Specifying and Reasoning About Dynamic Access-Control Policies.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005
Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract.
Electr. Notes Theor. Comput. Sci., 2005

Intersection and Union Types in the lambda-my-my/tilde-calculus.
Electr. Notes Theor. Comput. Sci., 2005

Strong Normalization of the Dual Classical Sequent Calculus.
Proceedings of the Logic for Programming, 2005

2004
The complexity of the certification of properties of Stable Marriage.
Inf. Process. Lett., 2004

Intersection types for explicit substitutions.
Inf. Comput., 2004

Characterizing strong normalization in a language with control operators.
Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004

2003
Reductions, Intersection Types, and Explicit Substitutions.
Mathematical Structures in Computer Science, 2003

2002
A Decidable Variant of Higher Order Matching.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

An Improved System of Intersection Types for Explicit Substitutions.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001
Reductions, Intersection Types, and Explicit Substitutions.
TLCA, 2001

2000
Equality between Functionals in the Presence of Coproducts.
Inf. Comput., 2000

Normal Forms and Reduction for Theories of Binary Relations.
Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

1998
Equational Unification, Word Unification, and 2nd-Order Equational Unification.
Theor. Comput. Sci., 1998

1995
A Combinatory Logic Approach to Higher-Order E-Unification.
Theor. Comput. Sci., 1995

Some Independent Results for Equational Unification.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Equality between Functionals in the Presence of Coproducts
Proceedings of the Proceedings, 1995

1993
Higher-Order Unification via Combinators.
Theor. Comput. Sci., 1993

Closed Categories and Categorial Grammar.
Notre Dame Journal of Formal Logic, 1993

Some Lambda Calculi with Categorial Sums and Products.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

1992
Adding Algebraic Rewriting to the Untyped Lambda Calculus
Inf. Comput., December, 1992

An Improved General E-Unification Method.
J. Symb. Comput., 1992

A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract).
Proceedings of the Automated Deduction, 1992

1991
Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract).
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990
An Improved General E-Unification Method.
Proceedings of the 10th International Conference on Automated Deduction, 1990

1987
Decomposition of infinite matrices.
J. Comb. Theory, Ser. A, 1987

1986
Gentzen systems, resolution, and literal trees.
Notre Dame Journal of Formal Logic, 1986


  Loading...