Sciweavers

CASC
2009
Springer
97views Mathematics» more  CASC 2009»
14 years 2 months ago
On Invariant Manifolds of Dynamical Systems in Lie Algebras
Valentin Irtegov, Tatyana Titorenko
ASMTA
2009
Springer
75views Mathematics» more  ASMTA 2009»
14 years 3 months ago
Moments Characterization of Order 3 Matrix Exponential Distributions
András Horváth, Sándor R&aacu...
EUROCAL
1987
115views Mathematics» more  EUROCAL 1987»
14 years 3 months ago
Number-theoretic transforms of prescribed length
Abstract. A new constructive method for finding all convenient moduli m for a number-theoretic transform with given length N and given primitive Nth root of unity modulo m is prese...
Reiner Creutzburg, Manfred Tasche
ISSAC
1991
Springer
89views Mathematics» more  ISSAC 1991»
14 years 3 months ago
On the Resolution of Index Form Equations
In the present paper we describe a new algorithm to determine the minimal index and all elements with minimal index in totally real biquadratic fields with Galois group D8. The m...
István Gaál, Attila Pethö, Mich...
MPC
1995
Springer
91views Mathematics» more  MPC 1995»
14 years 3 months ago
A Refinement Relation Supporting the Transition from Unbounded to Bounded Communication Buffers
This paper proposes a refinement relation supporting the transition from unbounded to bounded communication buffers. Employing this refinement relation, a system specification base...
Ketil Stølen
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
14 years 3 months ago
Computer-Aided Computing
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
Natarajan Shankar
MPC
1995
Springer
93views Mathematics» more  MPC 1995»
14 years 3 months ago
Extracting Programs with Exceptions in an Impredicative Type System
Abstract. This paper is about exceptions handling using classical techniques of program extraction. We propose an impredicative formalization in the calculus of constructions and w...
Jean-François Monin
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
14 years 3 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent