The complexity of linear problems in fields
Journal of Symbolic Computation
Complexity and uniformity of elimination in Presburger arithmetic
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
Nonlinear control system design by quantifier elimination
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Testing stability by quantifier elimination
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Simulation and optimization by quantifier elimination
Journal of Symbolic Computation - Special issue: applications of quantifier elimination
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
Journal of Symbolic Computation
Linear problems in valued fields
Journal of Symbolic Computation
A New Approach for Automatic Theorem Proving in Real Geometry
Journal of Automated Reasoning
A New Class of Decidable Hybrid Systems
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Computational Geometry Problems in REDLOG
Selected Papers from the International Workshop on Automated Deduction in Geometry
A generic projection operator for partial cylindrical algebraic decomposition
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Efficient path conditions in dependence graphs for software safety analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
SyNRAC: a maple toolbox for solving real algebraic constraints
ACM Communications in Computer Algebra
Quantifier Elimination via Functional Composition
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Hi-index | 0.00 |
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practical problems. This includes work by the group around the redlog developers as well as by many others. redlog is, however, not at all restricted to the real numbers but comprises a variety of other domains. We particularly point at the immense potential of quantifier elimination techniques for the integers. We also address another new redlog domain, which is queues over arbitrary basic domains. Both have most promising applications in practical computer science, viz. automatic loop parallelization and software security.