Sciweavers

59 search results - page 4 / 12
» Generating all polynomial invariants in simple loops
Sort
View
TCS
2008
13 years 7 months ago
Real algebraic numbers and polynomial systems of small degree
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...
Ioannis Z. Emiris, Elias P. Tsigaridas
FAC
2008
108views more  FAC 2008»
13 years 7 months ago
Property-directed incremental invariant generation
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...
Aaron R. Bradley, Zohar Manna
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
13 years 12 months ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert
VMCAI
2009
Springer
14 years 2 months ago
Synthesizing Switching Logic Using Constraint Solving
A new approach based on constraint solving techniques was recently proposed for verification of hybrid systems. This approach works by searching for inductive invariants of a give...
Ankur Taly, Sumit Gulwani, Ashish Tiwari