Proceedings Fourth International Symposium on Symbolic Computation in Software Science
نویسندگان
چکیده
منابع مشابه
Sixth International Symposium on Symbolic Computation in Software Science
Generalization problems arise in many areas of software science: code clone detection, program reuse, partial evaluation, program synthesis, invariant generation, etc. Anti-unification is a technique used often to solve generalization problems. In this paper we describe an open-source library of some newly developed anti-unification algorithms in various theories: for firstand second-order unra...
متن کاملFifth International Symposium on Symbolic Computation in Software
This work aims to build a semantic framework for automated debugging. A debugging process consists of tracing, locating, and fixing processes consecutively. The first two processes are accomplished by a tracing procedure and a locating procedure, respectively. The tracing procedure reproduces the execution of a failed test case with well-designed data structures and saves necessary information ...
متن کاملFourth International Symposium on Molecular Insect Science
s are listed in alphabetical order by the last name of the
متن کاملProceedings of ISSAC ' 96 ( International Symposium on Symbolic and Algebraic Computation )
We investigate sources of parallelism in the Grr obner Basis algorithm for their practical use on the desk-top. Our execution environment is a standard multi-processor workstation, and our parallel programming environment is PARSAC-2 on top of a multi-threaded operating system. We investigate the performance of two main variants of our master parallel algorithm on a standard set of examples. Th...
متن کاملPASCO ' 94 : First International Symposium on Parallel Symbolic Computation
The idea using polynomial factorization for speeding up the computation of Buch-berger's Grr obner bases algorithm for the purpose of polynomial equation solving leads to major improvements in the computation time. In this paper we show how one may introduce factoriza-tion within a parallel Grr obner basis algorithm, without unnecessary doubling parts of the work. A reformulation of the sequent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.122.0