Joe Hendrix

Joe Hendrix

Contact

Research and Engineering
Office: 503.626.6616 x163
Email: jhendrix (at) galois (dot) com
Webpage: http://whoisjoe.info/
LinkedIn: http://www.linkedin.com/pub/joe-hendrix/7/504/423

Publications

  • Coverset Induction with Partiality and Subsorts: A Powerlist Case Study, Joe Hendrix, Deepak Kapur, and José Meseguer In Proc. of ITP 2010, LNCS 6172, Springer-Verlag, 275–290.
  • Linear Functional Fixied-Points Nikolaj Bjorner and Joe Hendrix In Proc. of CAV 2009, LNCS 5643, Springer-Verlag, 124–139.
  • Combining Equational Tree Automata Over AC and ACI Theories. Joe Hendrix and Hitoshi Ohsaki In Proc. of RTA 2008, LNCS 5117, Springer-Verlag, 142–156 (preprint Tech. Report UIUCDCS-R-2008-2940).
  • Diffie-Hellman Cryptographic Reasoning in the Maude-NRL Protocol Analyzer. Santiago Escobar, Joe Hendrix, Catherine Meadows, and José Meseguer In proceedings of 2nd International Workshop on Security and Rewriting Techniques (SecReT 2007),
  • The Maude Formal Tool Environment Manuel Clavel, Francisco Durán, Joe Hendrix, Salvador Lucas, José Meseguer, and Peter Ölveczky In Proc. of CALCO 2007, LNCS 4624, Springer-Verlag, 173–178.
  • On the Completeness of Context-Sensitive Order-sorted Specifications. Joe Hendrix and José Meseguer In Proc. of RTA 2007, LNCS 4533, Springer-Verlag, 229–245 (preprint Tech. Report UIUCDCS-R-2007-2812).
  • A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms. Joe Hendrix, José Meseguer, and Hitoshi Ohsaki In Proc. of IJCAR 2006, LNAI 4130, Springer-Verlag, 151–155 (Preprint)
  • Propositional Tree Automata. Joe Hendrix, Hitoshi Ohsaki, and Mahesh Viswanathan In Proc. of RTA 2006, LNCS 4098, Springer-Verlag, 50–65, and also available as Tech. Report UIUCDCS-R-2006-2695.
  • A Sufficient Completeness Reasoning Tool for Partial Specifications. Joe Hendrix, Manuel Clavel, and José Meseguer In Proc. of RTA 2005, LNCS 3467, Springer-Verlag, 165–174. (Preprint) (Tool Website)
  • Matrices in ACL2. Joe Hendrix. In Fourth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2-2003).