Reliable Linear Program Solver for Coho
نویسنده
چکیده
Coho[3],[4],[5],[6] is a hardware verification system. It models a circuit by a continuous, differential equations; then verifies that some properties are hold by reachability analysis.However, closed form solutions for reachable problems usually do not exist, approximation techniques are performed. Coho computes an over-approximation of the reachable space: including every point that is actually reachable. Therefore, Coho may fail to verify a correct system, but will never erroneously verify an incorrect system.
منابع مشابه
Coho: A Verification Tool for Circuit Verification by Reachability Analysis
Coho is a verification tool for systems modeled by nonlinear ordinary differential equations (ODEs). Verification is performed using reachability analysis. The reachable space is represented by projectagons which are the polyhedron described by their projection onto two dimensional subspace. Coho approximates nonlinear ODEs with linear differential inclusions to compute the reachable state. We ...
متن کاملConcurrent Cooperating Solvers over Reals
Systems combining an interval narrowing solver and a linear programming solver can tackle constraints over the reals that none of these solvers can handle on their own. In this paper we introduce a cooperating scheme where an interval narrowing solver and a linear programming solver work concurrently. Information exchanged by the solvers is therefore handled as soon as it becomes available. Mor...
متن کاملPresent State of Asian Coho Salmon (Oncorhynchus kisutch) Stocks
Data from pelagic trawl surveys by TINRO-center from 1987 to 1996 in the Okhotsk Sea indicate that coho abundance is underestimated by coastal observations. The approximate Asian coho spawning biomass is 7,300-16,000 tons for the 1990s. Ways of improving Asian coho salmon resource management are discussed. Collection of precise fishery and escapement statistics must be expanded in areas previou...
متن کاملSolving non-linear Horn clauses using a linear solver
Developing an efficient non-linear Horn clause solver is a challenging task since the solver has to reason about the tree structures rather than the linear ones as in a linear solver. In this paper we propose an incremental approach to solving a set of non-linear Horn clauses using a linear Horn clause solver. We achieve this by interleaving a program transformation and a linear solver. The pro...
متن کاملUniCalc.LIN: a linear constraint solver for the UniCalc system
In this short paper we present a linear constraint solver for the UniCalc system, an environment for reliable solution of mathematical modeling problems.
متن کامل