Professional Summary

  • Prof. Franco is director of the National Center of Academic Excellence in Cyber Operations at the University of Cincinnati.  The Center is a collaborative effort involving three university colleges, and two local major defense contractors for advanced training in cyber operations and cyber security.

    Prof. Franco is editor-in-chief of the Journal on Satisfiability, Boolean Modeling, and Computation, and an editor of the Annals of Mathematics and Artificial Intelligence.  He is Vice Chair of the SAT Association and a member of the steering committee for the annual Internation Conference on the Theory and Applications of Satisfiability Testing.

    Prof. Franco has been PI, Co-PI, or Senior Personnel on 18 grants and contracts from the ONR, AFOSR, EPA, NSA, and NSF. He spent 9 months sabbatical leave at Fort George G. Meade in Research and Engineering on Satisfiability research, was visiting scientist at FAW, Ulm, Germany for three summers, and visiting scientist at U. Paderborn for a summer.
     

Education

  • B.S. in E.E.: City College of New York, 1969
  • M.S. in E.E.: Columbia University , 1971
  • Ph.D in Computer Science: Rutgers the State University of New Jersey, 1981

Research/Clinical Interests

  • Information assurance, cyber defense, design & analysis of SAT algorithms, applications of SAT to network and computer security, formal methods, model checking, interactive first order logic theorem provers.

[Collapse All]

[Expand All]


Research Grants
Back to Top
  • MDA90402C1162/P0000503/27/2002-08/31/2004. National Security Agency. Satisfiability Algorithm Research and Development to Enhance Formal Verification Tools, PI, Closed.
  • MDA90499C4547/P0000406/22/1999-09/30/2001. National Security Agency. Satisfiability Algorithm Research and Development to Enhance Formal Verification Tools, PI, Closed.
  • 11/01/1998-10/31/1999. Advanced Computing Systems Association. Perl to JVM Optimization, PI, Closed.
  • SRS 00629107/06/2009-03/31/2010. National Security Agency. Integrated Algebraic and Resolution Algorithms for Improved Solutions to Difficult Problems, PI, Closed.
  • DUE-124469709/15/2013-08/31/2016. National Science Foundation. Collaborative Research: Real World Relevant Security Labware for Mobile Analysis and Protection Experience, Collaborator, Awarded.
  • EEC-140476605/01/2014-04/30/2017. National Science Foundation. RET Site on "Challenge-Based Learning and Engineering Design Process Enhanced Research Experiences for Middle and High School In-Service Teachers.", Collaborator, Awarded.
  • 0416-CS-PB-UC / NSF 163699504/01/2016-08/31/2017. National Science Foundation. Real World Relevant Security Labware for Mobile Threat Analysis and Protection Experience, PI, Active.
  • H98230-17-1-034507/01/2017-06/30/2018. National Security Agency. Train and Certify Qualified Instructors to Teach CAE's Cybersecurity Curricula, Collaborator, Awarded.
Back to Top
Peer Reviewed Publications (in chronological order)
Back to Top
  • MN Velev, J Franco (2014). (In Press). Application of constraints to formal verification and artificial intelligence. Ann. Math. Artif. Intell., 70 (4), 313, -314.
  • W Yue, J Franco, Q Han, W Cao (2014). Improved anytime d* algorithm. IAENG Transactions on Engineering Technologies, 383, -396.
  • J Franco, S Weaver (2013). Algorithms for the Satisfiability Problem. Handbook of Combinatorial Optimization, 311, -454.
  • J Franco, J Martin (2009). A History of Satisfiability. Handbook of Satisfiability, 185, 3, -74.
  • V Franco, WM VanFleet, J Schlipf, MR Dransfield (2005). (In Press). Method and system for non-linear state based satisfiability. US Patent 6,912,700.
  • M Kouril, J Franco (2005). (In Press). Resolution tunnels for improved SAT solver performance. International Conference on Theory and Applications of Satisfiability Testing, 143, -157.
  • J Franco, A Van Gelder (2003). (In Press). A perspective on certain polynomial-time solvable classes of satisfiability. Discrete Applied Mathematics, 125 (2), 177, -214.
  • J Franco, M Kouril, J Schlipf, J Ward, S Weaver, M Dransfield, MW Vanfleet (2003). (In Press). SBSAT: a state-based, BDD-based satisfiability solver. International Conference on Theory and Applications of Satisfiability Testing, 398, -410.
  • J. Franco (2001). (In Press). Results related to threshold phenomena research in satisfiability: lower bounds. Theoretical Computer Science, 265 (1), 147, -157.
  • J Gu, PW Purdom, J Franco, BW Wah (1999). (In Press). Algorithms for the satisfiability (sat) problem. Handbook of Combinatorial Optimization, 379, -572.
  • J Franco, J Goldsmith, J Schlipf, E Speckenmeyer, RP Swaminathan (1999). (In Press). An algorithm for the class of pure implicational formulas. Discrete Applied Mathematics, 96, 89, -106.
  • JS Schlipf, FS Annexstein, JV Franco, RP Swaminathan (1995). (In Press). On finding solutions for extended Horn formulas. Information Processing Letters, 54 (3), 133, -137.
  • K Berman, J Schlipf, J Franco (1995). (In Press). Computing the well-founded semantics faster. Logic Programming and Nonmonotonic Reasoning, 113, -126.
  • LC Murdoch, J Franco (1994). (In Press). The analysis of constant drawdown wells using instantaneous source functions. Water Resources Research, 30 (1), 117, -124.
  • J. Franco (1991). (In Press). Elimination of infrequent variables improves average case performance of satisfiability algorithms. SIAM Journal on Computing, 20 (6), 1119, -1127.
  • C Ming-Te, J Franco (1990). (In Press). Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem. Information Sciences, 51 (4), 289, -314.
  • DS Wise, J Franco (1990). Costs of quadtree representation of nondense matrices. Journal of Parallel and Distributed Computing, 9 (3), 282, -296.
  • J Franco, YC Ho (1988). (In Press). Probabilistic performance of a heuristic for the satisfiability problem. Discrete Applied Mathematics, 22 (1), 35, -51.
  • MT Chao, J Franco (1986). (In Press). Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM Journal on Computing, 15 (4), 1106, -1118.
  • J. Franco (1986). (In Press). On the probabilistic performance of algorithms for the satisfiability problem. Information Processing Letters, 23 (2), 103, -106.
  • J. Franco (1984). (In Press). Probabilistic analysis of the pure literal heuristic for the satisfiability problem. Annals of Operations Research, 1 (3), 273, -289.
  • J Franco, M Paull (1983). (In Press). Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discrete Applied Mathematics, 5 (1), 77, -87.
Back to Top
Book Chapter
Back to Top
  • J Franco and S. Weaver (2013). (In Press). Algorithms for the Satisfiability ProblemIn R. Graham, P. Pardalos, D.Z. Du (Eds.) ,Handbook on Combinatorial Optimization(pp.311 ,-454). :Springer .Author.
  • J. Franco (2010). (In Press). Probabilistic analysis of Satisfiability algorithmsIn Y. Crama and P. Hammer (Eds.) ,Boolean Methods and Models.
  • J. Franco and J. Martin (2009). (In Press). A History of SatisfiabilityIn A. Biere, H. van Maaren, T. Walsh and M. Heule (Eds.) ,Handbook on Satisfiability :IOS Press.
  • J. Gu, P.W. Purdom, J. Franco, and B.W. Wah (2002). (In Press). Algorithms for the Satisfiability (SAT) ProblemIn P. Pardalos and M.G.C. Resende (Eds.) ,Handbook of Applied Optimization(pp.640 ,-660). :Oxford University Press.
  • J. Gu, P.W. Purdom, J. Franco, and B. Wah (1999). (In Press). Algorithms for the Satisfiability (SAT) ProblemIn D-Z. Du and P. Pardalos (Eds.) ,Handbook of Combinatorial Optimization, Supplement Volume A :Kluwer.
Back to Top
More Information