Sciweavers

1175 search results - page 17 / 235
» Abstract computability and algebraic specification
Sort
View
EUROCAST
2009
Springer
153views Hardware» more  EUROCAST 2009»
13 years 5 months ago
Algorithm for Testing the Leibniz Algebra Structure
Abstract. Given a basis of a vector space V over a field K and a multiplication table which defines a bilinear map on V , we develop a computer program on Mathematica which checks ...
José Manuel Casas, Manuel A. Insua, Manuel ...
MFCS
1997
Springer
13 years 11 months ago
Dependency-Based Action Refinement
Abstract. Action refinement in process algebras has been widely studied in the last few years as a means to support top-down design of systems. A specific notion of refinement aris...
Arend Rensink, Heike Wehrheim
JAR
1998
134views more  JAR 1998»
13 years 7 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
IWCIA
2004
Springer
14 years 27 days ago
Tensor Algebra: A Combinatorial Approach to the Projective Geometry of Figures
Abstract. This paper explores the combinatorial aspects of symmetric and antisymmetric forms represented in tensor algebra. The development of geometric perspective gained from ten...
David N. R. McKinnon, Brian C. Lovell
IFIP
2004
Springer
14 years 27 days ago
Complementing Computational Protocol Analysis with Formal Specifications
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco...