949 search results - page 91 / 190 » Lightweight Formal Methods for Computer Algebra Systems |
CASC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
TYPES
2004
Springer
14 years 2 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
FMCAD
2008
Springer
13 years 10 months ago
2008
Springer
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
DAC
2003
ACM
14 years 10 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
KR
2004
Springer
14 years 2 months ago
2004
Springer
In a very basic sense, the aim of knowledge discovery is to reveal structures of knowledge which can be seen as being represented by structural relationships. In this paper, we ma...