
Z
 Referenced in 203 articles
[sw10291]
 Using Z. Specification, refinement, and proof. The book is an indepth introduction to the specification language $Z$. It is primarily directed to the user; the ...

Z2sal
 Referenced in 6 articles
[sw07087]
 Z2sal: a translationbased model checker for z. Complex computer systems are difficult to implement correctly. To aid in the process, formal methods use mathematics in ...

z3
 Referenced in 221 articles
[sw04887]
 Z3 is a highperformance theorem prover being developed at Microsoft Research.Z3 supports linear real and integer arithmetic, fixedsize bitvectors, extensional arrays, uninterpreted functions, and quantifiers. ...

Z3str
 Referenced in 2 articles
[sw19493]
 Zheng Y, Zhang X, Ganesh V (2013) Z3str: a Z3based string solver for web application analysis. Analyzing web applications requires reasoning about strings and nonstrings ...

Z88
 Referenced in 2 articles
[sw06846]
 Z88 Freeware: The fast and compact Open Source FEprogram

Z88Aurora
 Referenced in 2 articles
[sw04909]
 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 ...

ZAERO
 Referenced in 3 articles
[sw07624]
 Aeroelastic tailoring using fiber orientation and topology optimization We present a structural optimization aided design methodology for composite laminated plates subject to fluidstructure interaction. The ...

Zap
 Referenced in 6 articles
[sw06823]
 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. ...

ZBDD
 Referenced in 2 articles
[sw12885]
 A ZBDD Package for Efficient Model Checking of Petri Nets.

zChaff
 Referenced in 20 articles
[sw04757]
 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 ...

Zchaff2004
 Referenced in 20 articles
[sw01032]
 The Boolean Satisfiability Problem (SAT) is a well known NPcomplete problem. While its complexity remains a source of many interesting questions for theoretical computer scientists, ...

ZDC
 Referenced in 1 article
[sw10499]
 Towards a practical engineering tool for rostering. The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability ...

ZDOCK
 Referenced in 3 articles
[sw12737]
 Protein Docking. ZDOCK: Performs a full rigidbody search of docking orientations between two proteins. The current version, 3.0.2, includes performance optimization and a novel pairwise ...

ZEAL
 Referenced in 13 articles
[sw01033]
 ZEAL is a general purpose package for computing zeros of analytic functions. It can be used in various physical applications. More precisely, given a rectangular ...

ZEBEC
 Referenced in 8 articles
[sw01034]
 A reliable and portable software package, called ZEBEC (ZEros of BEssel functions Complex), is presented, which localizes and computes simple zeros of Bessel functions of ...

Zebra
 Referenced in 2 articles
[sw01035]
 The main goal of developing the Zebra technology was to decrease the overall costs of software development and support. Another objective was to raise the ...

ZEBRA
 Referenced in 1 article
[sw15672]
 All offline programming in highenergy physics is carried out, for various reasons, in the Fortran 77 programming language. While this language offers certain advantages over ...

zebu
 Referenced in 0 articles
[sw16512]
 R package zebu. Implements the estimation of local (and global) association measures: Ducher’s Z, pointwise mutual information and normalized pointwise mutual information. The significance of ...

ZeBuLoN
 Referenced in 3 articles
[sw01564]
 Modelling of contact problems with friction. Implementation by the code ZeBuLoN using C++ This paper presents a general tool to solve contact problems with friction ...

ZeckFibBijections
 Referenced in 3 articles
[sw12647]
 A translation method for finding combinatorial bijections. Consider a combinatorial identity that can be proved by induction. In this paper, we describe a general method ...