Sciweavers

430 search results - page 1 / 86
» Extracting Computer Algebra Programs from Statements
Sort
View
EUROCAST
2005
Springer
97views Hardware» more  EUROCAST 2005»
14 years 4 months ago
Extracting Computer Algebra Programs from Statements
In this paper, an approach to synthesize correct programs from specifications is presented. The idea is to extract code from definitions appearing in statements which have been me...
Jesús Aransay, Clemens Ballarin, Julio Rubi...
JMLR
2010
102views more  JMLR 2010»
13 years 5 months ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...
INFSOF
1998
73views more  INFSOF 1998»
13 years 10 months ago
Restructuring programs by tucking statements into functions
Changing the internal structure of a program without changing its behavior is called restructuring. This paper presents a transformation called tuck for restructuring programs by ...
Arun Lakhotia, Jean-Christophe Deprez
TPHOL
2003
IEEE
14 years 4 months ago
Program Extraction from Large Proof Developments
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
Luís Cruz-Filipe, Bas Spitters
ENTCS
2006
153views more  ENTCS 2006»
13 years 11 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu