Proofs that count

DOI10.1145/2535838.2535885zbMath1284.68395OpenAlexW2014175609MaRDI QIDQ5408413

Andreas Podelski, Zachary Kincaid, Azadeh Farzan

Publication date: 10 April 2014

Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2535838.2535885

zbMATH Keywords

verificationstatic analysisconcurrency

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

What’s Decidable About Program Verification Modulo Axioms?, Automated Program Verification, Shortest Paths in One-Counter Systems, Domains for Higher-Order Games