| Model Finding for Exploration. | 0 | 0.34 | 2021 |
| Homomorphisms and Minimality for Enrich-by-Need Security Analysis. | 0 | 0.34 | 2018 |
| Security Protocol Analysis In Context: Computing Minimal Executions Using Smt And Cpsa | 0 | 0.34 | 2018 |
| The power of \"why\" and \"why not\": enriching scenario exploration with provenance | 5 | 0.45 | 2017 |
| User Studies of Principled Model Finder Output. | 3 | 0.38 | 2017 |
| CAESAR: Context-Aware Event Stream Analytics for Urban Transportation Services. | 0 | 0.34 | 2017 |
| Context-Aware Event Stream Analytics. | 1 | 0.40 | 2016 |
| A Realizability Interpretation for Intersection and Union Types. | 2 | 0.37 | 2016 |
| Exploring Theories with a Model-Finding Assistant | 7 | 0.49 | 2015 |
| Decidability for Lightweight Diffie-Hellman Protocols | 7 | 0.45 | 2014 |
| Razor: Provenance and Exploration in Model-Finding. | 1 | 0.35 | 2014 |
| Aluminum: principled scenario exploration through minimality | 7 | 0.56 | 2013 |
| A balance of power: expressive, analyzable controller programming | 22 | 1.10 | 2013 |
| An Algebra for Symbolic Diffie-Hellman Protocol Analysis. | 4 | 0.37 | 2012 |
| Realtime healthcare services via nested complex event processing technology | 1 | 0.36 | 2012 |
| Symbolic Protocol Analysis for Diffie-Hellman | 3 | 0.38 | 2012 |
| Toward a more complete alloy | 5 | 0.47 | 2012 |
| Optimizing complex sequence pattern extraction using caching | 1 | 0.37 | 2011 |
| The margrave tool for firewall analysis | 46 | 1.52 | 2010 |
| Embracing policy engineering | 3 | 0.37 | 2010 |
| NEEL: The Nested Complex Event Language for Real-Time Event Analytics. | 4 | 0.46 | 2010 |
| Logic and computation in a lambda calculus with intersection and union types | 2 | 0.39 | 2010 |
| Processing nested complex sequence pattern queries over event streams | 8 | 0.59 | 2010 |
| An Improved Algorithm For Generating Database Transactions From Relational Algebra Specifications | 1 | 0.38 | 2009 |
| Towards an Operational Semantics for Alloy | 5 | 0.56 | 2009 |
| Extensional And Intensional Strategies | 5 | 0.45 | 2009 |
| Alchemy: transmuting base alloy specifications into implementations | 10 | 0.66 | 2008 |
| Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage | 11 | 0.55 | 2008 |
| Obligations and their interaction with programs | 22 | 0.84 | 2007 |
| Modular access control via strategic rewriting | 19 | 0.67 | 2007 |
| Normal forms for binary relations | 3 | 0.43 | 2006 |
| Specifying and reasoning about dynamic access-control policies | 52 | 1.74 | 2006 |
| Addressed term rewriting systems: application to a typed object calculus | 5 | 0.45 | 2006 |
| Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract | 6 | 0.47 | 2005 |
| Strong normalization of the dual classical sequent calculus | 7 | 0.66 | 2005 |
| Intersection and Union Types in the lambda-my-my/tilde-calculus | 0 | 0.34 | 2005 |
| Characterizing strong normalization in a language with control operators | 5 | 0.45 | 2004 |
| The complexity of the certification of properties of stable marriage | 0 | 0.34 | 2004 |
| A Decidable Variant of Higher Order Matching | 9 | 0.67 | 2002 |
| An Improved System of Intersection Types for Explicit Substitutions | 2 | 0.40 | 2002 |
| Normal Forms and Reduction for Theories of Binary Relations | 10 | 0.69 | 2000 |
| Equational unification, word unification, and 2nd-order equational unification | 0 | 0.34 | 1998 |
| A combinatory logic approach to higher-order E-unification | 1 | 0.43 | 1995 |
| Some Independent Results for Equational Unification | 3 | 0.45 | 1995 |
| Equality between functionals in the presence of coproducts | 5 | 0.63 | 1995 |
| Closed Categories and Categorial Grammar | 0 | 0.34 | 1993 |
| Higher-order unification via combinators | 18 | 1.32 | 1993 |
| Some Lambda Calculi with Categorial Sums and Products | 23 | 1.98 | 1993 |
| A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract) | 3 | 0.38 | 1992 |
| Adding algebraic rewriting to the untyped lambda calculus | 37 | 2.31 | 1992 |
