Conference rusure::math

374.0. "Bibliography" by TOOLS::STAN () Fri Nov 08 1985 10:24

From:	ROLL::USENET  "USENET Newsgroup Distributor  28-Oct-1985 2053" 28-OCT-1985 21:19
To:	@[.net.math.symbolic]NEWS.DIS
Subj:	USENET net.math.symbolic newsgroup articles

Newsgroups: net.math.symbolic
Path: decwrl!decvax!ittatc!dcdwest!sdcsvax!sdcrdcf!randvax!leff%[email protected]
Subject: Bibliography
Posted: 24 Oct 85 17:30:37 GMT
Organization: Rand Corp., Santa Monica
 
This bibliography was collected from various sources and is in bib/refer
format.  It was just a few articles relevant to symbolic math.
 
%A James H. Davenport
%T Integration: Formal and Numeric Approaches
%J Tools, Methods and Languages for Scientific and
Engineering Computation
%E B. Ford
%E J. C. Rault
%E F. Thomasset
%I Elsevier Science Publishers
%C North-Holland
%P 417-426
 
%A Daniel Lazard
%T Le Calcul Formel Un Complement Necessaire A L'Analyse Numerique
%J Tools, Methods and Languages for Scientific and
Engineering Computation
%E B. Ford
%E J. C. Rault
%E F. Thomasset
%I Elsevier Science Publishers
%C North-Holland
%P 411-416
 
%A James M. Purtilo
%T POLYLITH The Early Goals
%R Department of Computer Science Report No. 1208
%I University of Illinois at Urbana-Champaign
%D APR 1985
 
%A Scott McCallum
%T An Improved Projection Operation for Cylindrical Algebraic Decomposition
%R TR 578
%I University of Wisconsin-Madison Department of Computer Science
%D FEB 1985
%X Charge of $15.60
 
 
%A P. Cherenack
%T Conditions for Cubic Spline Interpolation on Triangular Elements
%J Computers and Mathematics with Applications
%V 10
%N 3
%P 235-244
%D 1984
 
%A M. J. L. Tiernego
%T Formula Manipulation in the Bond Graph Modeling and Simulation of
Large Mechanical Systems
%J Journal of the Franklin INstitute
%V 319
%N 1-2
%D JAN-FEB 1985
%P 51-65
 
%A Randal E. Bryant
%T Symbolic Verification of MOS Circuits
%I Carnegie Mellon University Department of Computer Science
%D APR 1985
%X The program MOSSYS simulates the behavior of a MOS circuit
represented as a switch-level symbolically.  That is, during
simulator the user can set an input to either 0, 1 or a Boolean
variable.  The simulator then computes the behavior of hte circuit as
a function of past and present and input variables.  By using heuristically
efficient Boolean function manipulation algorithms, the verification
of a circuit by symbolic simualtion can proceed much more quickly than by 
exhaustive logic simulation.  In this paper we present our concept of
symbolic simualtion, dervie an algorithm for switch-level symbolic
simulation, and present experimental measurements from MOSSYM
 
%A J. M.Shearer
%A M. A. Wolfe
%T Alglib, A Simple Symbol-Manipulation Package
%J Communicatons of the ACM
%D AUG 1985
%V 28
%N 8
%P 820-825
 
%A F. Winkler
%A B. Buchberger
%A F. Lichtenberger
%A H. Rolletschek
%T Algorithm 628. An Algorithm for Constructing Canonical Bases of
Polynomial Ideals
%J ACM Transactions on Mathematical Software
%D MAR 1985
%V 11
%N 1
%P 66-78
From:	ROLL::USENET  "USENET Newsgroup Distributor  28-Oct-1985 2053" 28-OCT-1985 21:19
To:	@[.net.math.symbolic]NEWS.DIS
Subj:	USENET net.math.symbolic newsgroup articles

Newsgroups: net.math.symbolic
Path: decwrl!decvax!ittatc!dcdwest!sdcsvax!sdcrdcf!randvax!leff%[email protected]
Subject: Bibliography
Posted: 24 Oct 85 17:30:37 GMT
Organization: Rand Corp., Santa Monica
 
This bibliography was collected from various sources and is in bib/refer
format.  It was just a few articles relevant to symbolic math.
 
%A James H. Davenport
%T Integration: Formal and Numeric Approaches
%J Tools, Methods and Languages for Scientific and
Engineering Computation
%E B. Ford
%E J. C. Rault
%E F. Thomasset
%I Elsevier Science Publishers
%C North-Holland
%P 417-426
 
%A Daniel Lazard
%T Le Calcul Formel Un Complement Necessaire A L'Analyse Numerique
%J Tools, Methods and Languages for Scientific and
Engineering Computation
%E B. Ford
%E J. C. Rault
%E F. Thomasset
%I Elsevier Science Publishers
%C North-Holland
%P 411-416
 
%A James M. Purtilo
%T POLYLITH The Early Goals
%R Department of Computer Science Report No. 1208
%I University of Illinois at Urbana-Champaign
%D APR 1985
 
%A Scott McCallum
%T An Improved Projection Operation for Cylindrical Algebraic Decomposition
%R TR 578
%I University of Wisconsin-Madison Department of Computer Science
%D FEB 1985
%X Charge of $15.60
 
 
%A P. Cherenack
%T Conditions for Cubic Spline Interpolation on Triangular Elements
%J Computers and Mathematics with Applications
%V 10
%N 3
%P 235-244
%D 1984
 
%A M. J. L. Tiernego
%T Formula Manipulation in the Bond Graph Modeling and Simulation of
Large Mechanical Systems
%J Journal of the Franklin INstitute
%V 319
%N 1-2
%D JAN-FEB 1985
%P 51-65
 
%A Randal E. Bryant
%T Symbolic Verification of MOS Circuits
%I Carnegie Mellon University Department of Computer Science
%D APR 1985
%X The program MOSSYS simulates the behavior of a MOS circuit
represented as a switch-level symbolically.  That is, during
simulator the user can set an input to either 0, 1 or a Boolean
variable.  The simulator then computes the behavior of hte circuit as
a function of past and present and input variables.  By using heuristically
efficient Boolean function manipulation algorithms, the verification
of a circuit by symbolic simualtion can proceed much more quickly than by 
exhaustive logic simulation.  In this paper we present our concept of
symbolic simualtion, dervie an algorithm for switch-level symbolic
simulation, and present experimental measurements from MOSSYM
 
%A J. M.Shearer
%A M. A. Wolfe
%T Alglib, A Simple Symbol-Manipulation Package
%J Communicatons of the ACM
%D AUG 1985
%V 28
%N 8
%P 820-825
 
%A F. Winkler
%A B. Buchberger
%A F. Lichtenberger
%A H. Rolletschek
%T Algorithm 628. An Algorithm for Constructing Canonical Bases of
Polynomial Ideals
%J ACM Transactions on Mathematical Software
%D MAR 1985
%V 11
%N 1
%P 66-78