Sciweavers

153 search results - page 12 / 31
» Symbolic Implementation of the Best Transformer
Sort
View
AISC
2006
Springer
15 years 1 months ago
Operator Calculus Approach to Solving Analytic Systems
Solving analytic systems using inversion can be implemented in a variety of ways. One method is to use Lagrange inversion and variations. Here we present a different approach, base...
Philip Feinsilver, René Schott
ENTCS
2007
168views more  ENTCS 2007»
14 years 9 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 9 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
ITS
2004
Springer
124views Multimedia» more  ITS 2004»
15 years 2 months ago
Combining Competing Language Understanding Approaches in an Intelligent Tutoring System
When implementing a tutoring system that attempts a deep understanding of students’ natural language explanations, there are three basic approaches to choose between; symbolic, i...
Pamela W. Jordan, Maxim Makatchev, Kurt VanLehn
69
Voted
SCAM
2002
IEEE
15 years 2 months ago
Parallel Support for Source Code Analysis and Modification
Tools that analyze and enhance large-scale software systems using symbolic reasoning are computationally expensive, and yet processors are cheap. We believe that enabling tools wi...
Ira D. Baxter