The nuXmv Symbolic Model Checker

R Cavada, A Cimatti, M Dorigatti, A Griggio… - … 2014, Held as Part of the …, 2014 - Springer
This paper describes the nuXmv symbolic model checker for finite-and infinite-state
synchronous transition systems. nuXmv is the evolution of the nuXmv open source model …

The blockchain litmus test

TD Smith - 2017 IEEE International Conference on Big Data …, 2017 - ieeexplore.ieee.org
Bitcoin's underlying blockchain database is a novel approach to recordkeeping that has the
potential to decentralize big data. Bitcoin's success has inspired a multitude of spinoff …

Learning invariants using decision trees and implication counterexamples

P Garg, D Neider, P Madhusudan, D Roth - ACM Sigplan Notices, 2016 - dl.acm.org
Inductive invariants can be robustly synthesized using a learning model where the teacher is
a program verifier who instructs the learner through concrete program configurations …

Enchanting program specification synthesis by large language models using static analysis and program verification

C Wen, J Cao, J Su, Z Xu, S Qin, M He, H Li… - … on Computer Aided …, 2024 - Springer
Formal verification provides a rigorous and systematic approach to ensure the correctness
and reliability of software systems. Yet, constructing specifications for the full proof relies on …

ICE: A robust framework for learning invariants

P Garg, C Löding, P Madhusudan, D Neider - … , CAV 2014, Held as Part of …, 2014 - Springer
We introduce ICE, a robust learning paradigm for synthesizing invariants, that learns using
examples, counter-examples, and implications, and show that it admits honest teachers and …

Inductive invariant generation via abductive inference

I Dillig, T Dillig, B Li, K McMillan - Acm Sigplan Notices, 2013 - dl.acm.org
This paper presents a new method for generating inductive loop invariants that are
expressible as boolean combinations of linear integer constraints. The key idea underlying …

Optimizing database-backed applications with query synthesis

A Cheung, A Solar-Lezama, S Madden - ACM SIGPLAN Notices, 2013 - dl.acm.org
Object-relational mapping libraries are a popular way for applications to interact with
databases because they provide transparent access to the database using the same …

A data driven approach for algebraic loop invariants

R Sharma, S Gupta, B Hariharan, A Aiken… - … 2013, Held as Part of the …, 2013 - Springer
We describe a Guess-and-Check algorithm for computing algebraic equation invariants of
the form∧ ifi (x 1,…, xn)= 0, where each fi is a polynomial over the variables x 1,…, xn of the …

A data-driven CHC solver

H Zhu, S Magill, S Jagannathan - ACM SIGPLAN Notices, 2018 - dl.acm.org
We present a data-driven technique to solve Constrained Horn Clauses (CHCs) that encode
verification conditions of programs containing unconstrained loops and recursions. Our CHC …

IC3 modulo theories via implicit predicate abstraction

A Cimatti, A Griggio, S Mover, S Tonetta - … , TACAS 2014, Held as Part of …, 2014 - Springer
We present a novel approach for generalizing the IC3 algorithm for invariant checking from
finite-state to infinite-state transition systems, expressed over some background theories …