Skip To Main Content
Jam Kabeer Ali on Muck Rack

Jam Kabeer Ali

Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Jam Kabeer

Contact Jam Kabeer, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Computer Science > Programming Languages

|
By Nico Lehmann, Jam Kabeer Ali, Petros Markopoulos
| arXiv
SMT-based program verifiers are hamstrung by two problems: expressiveness, because predictable verification restricts to the boundaries of SMT decidability, and trust, because the solver is a large, unverified artifact whose soundness bugs may quietly compromise every tool built on it.
Open in Who Shared Issue with article?
See all 1 articles