Zap: Automated Theorem Proving for Software Analysis

DOI10.1007/11591191_2zbMath1143.68576OpenAlexW2154689462MaRDI QIDQ5387827

Shuvendu K. Lahiri, Thomas Ball, Madanlal Musuvathi

Publication date: 27 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11591191_2

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Efficient Interpolant Generation in Satisfiability Modulo Theories ⋮ E-matching for Fun and Profit

Uses Software

• Zing
• VAMPIRE
• PVS
• Spec#
• UCLID
• SIMPLIFY
• Zap
• Chaff
• ESC/Java

This page was built for publication: Zap: Automated Theorem Proving for Software Analysis