Titlebook: Verification, Model Checking, and Abstract Interpretation; 18th International C Ahmed Bouajjani,David Monniaux Conference proceedings 2017

变色龙

松紧带

HARD

engrave

Matching Multiplications in Bit-Vector Formulas,he pre-processed formulas are then solved using an SMT solver. Our experiments with three SMT solvers show that our heuristic allows several formulas to be solved quickly, while the same formulas time out without the pre-processing step.

领袖气质

Dynamic Reductions for Model Checking Concurrent Software,enables us to derive an efficient symbolic encoding, which we implemented for IC3 and BMC. The experiments demonstrate the power of dynamic reduction on several case studies and a large set of SVCOMP benchmarks.

Diatribe

Independence Abstractions and Models of Concurrency,vent structures, and transition systems with independence. These results establish the first connections between abstraction interpretation and event-based models of concurrency and show that there is a precise sense in which independence is a form of abstraction.

Cpr951

Complete Abstractions and Subclassical Modal Logics, synthesize both models for positive modal logics and a notion of simulation for these models. The Kripke structures that can be synthesized using forwards-completeness satisfy a saturation condition which ensures that transition relations behave like best abstract transformers.

scotoma