μz- an efficient engine for fixed points with constraints

62Citations
Citations of this article
43Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The μZ tool is a scalable, efficient engine for fixed points with constraints. It supports high-level declarative fixed point constraints over a combination of built-in and plugin domains. The built-in domains include formulas presented to the SMT solver Z3 and domains known from abstract interpretation. We present the interface to μZ, a number of the domains, and a set of examples illustrating the use of μZ. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Hoder, K., Bjørner, N., & De Moura, L. (2011). μz- an efficient engine for fixed points with constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6806 LNCS, pp. 457–462). https://doi.org/10.1007/978-3-642-22110-1_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free