362 search results - page 40 / 73 » Formal Theories for Linear Algebra |
FORMATS
2010
Springer
13 years 6 months ago
2010
Springer
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
ICCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
JLP
2006
13 years 8 months ago
2006
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
ICFEM
2007
Springer
14 years 11 days ago
2007
Springer
Abstract. CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective t...