Computer Aided Verification

DOI10.1007/B98490zbMATH Open1103.68628OpenAlexW4298302743MaRDI QIDQ5312932FDOQ5312932

Authors: Shuvendu K. Lahiri, Sanjit A. Seshia 

Publication date: 25 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 1903346
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 1903374
• scientific article; zbMATH DE number 1979548
• EufDPLL -- a tool to check satisfiability of equality logic formulas

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (10)

• Editorial: Symbolic computation and satisfiability checking
• Title not available (Why is that?)
• Parallelizing SMT solving: lazy decomposition and conciliation
• A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures
• Building small equality graphs for deciding equality logic with uninterpreted functions
• Combining theories with shared set operations
• Deciding Boolean algebra with Presburger arithmetic
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Linear Arithmetic with Stars
• Formal reliability analysis of redundancy architectures

Uses Software

• PVS
• UCLID

This page was built for publication: Computer Aided Verification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312932)