Sciweavers

544 search results - page 13 / 109
» The Algebra of Equality Proofs
Sort
View
CADE
2007
Springer
14 years 8 months ago
Combining Deduction and Algebraic Constraints for Hybrid System Analysis
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
André Platzer
KBSE
1997
IEEE
14 years 3 days ago
Distributed Cooperative Formal Methods Tools
Abstract: This paper describes some tools to support formal methods, and conversely some formal methods for developing such tools. We focus on distributed cooperative proving over ...
Joseph A. Goguen, Kai Lin, A. Mori, Grigore Rosu, ...
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 11 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
FMOODS
2003
13 years 9 months ago
Proof Scores in the OTS/CafeOBJ Method
A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several ca...
Kazuhiro Ogata, Kokichi Futatsugi
CORR
2010
Springer
129views Education» more  CORR 2010»
13 years 8 months ago
The complexity of positive first-order logic without equality
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
Florent R. Madelaine, Barnaby Martin