Using Z. Specification, refinement, and proof. The book is an in-depth introduction to the specification language $Z$. It is primarily directed to the user; the ...
Z2Pack: Numerical Implementation of Hybrid Wannier Centers for Identifying Topological Materials. The intense theoretical and experimental interest in topological insulators and semimetals has established band ...
Z2sal: a translation-based model checker for z. Complex computer systems are difficult to implement correctly. To aid in the process, formal methods use mathematics in ...
Z3 is a high-performance theorem prover being developed at Microsoft Research.Z3 supports linear real and integer arithmetic, fixed-size bit-vectors, extensional arrays, uninterpreted functions, and quantifiers. ...
Z34Bio: An SMT- based framework for analyzing biological computation. The basic principles governing the development and function of living organisms remain only partially understood, despite ...
Zheng Y, Zhang X, Ganesh V (2013) Z3-str: a Z3-based string solver for web application analysis. Analyzing web applications requires reasoning about strings and non-strings ...
Z3str2: an efficient solver for strings, regular expressions, and length constraints. In recent years, string solvers have become an essential component in many formal verification, ...
Z3str3: a string solver with theory-aware heuristics. Z3str3 is a constraint solver for the quantifier-free theory of string equations, the regular-expression membership predicates, and linear ...
The open source program Z88OS is suitable as a really basic FEM program for learning the fundamentals of finite element analysis by examining and, if ...
R package zalpha: Run a Suite of Selection Statistics. A suite of statistics for identifying areas of the genome under selective pressure. See Jacobs, Sluckin ...
ZAME: Interactive Large-Scale Graph Visualization. We present the zoomable adjacency matrix explorer (ZAME), a visualization tool for exploring graphs at a scale of millions of ...
Zanzibar OpenIVR: An open-source framework for development of spoken dialog systems. The maturity of standards and the availability of open source components for all levels ...
Zap: Automated theorem proving for software analysis Automated theorem provers (ATPs) are a key component that many software verification and program analysis tools rely on. ...
zapato: Automatic theorem proving for predicate abstraction refinement. Counterexample-driven abstraction refinement is an automatic process that produces abstract models of finite and infinite-state systems. When ...
zChaff is an implementation of the well known CHAFF, an algorithm for solving satisfiability (SAT) problems. It won the Best Complete Solver in both industrial ...