Sciweavers

1547 search results - page 65 / 310
» Randomized Variable Elimination
Sort
View
LPAR
2007
Springer
15 years 9 months ago
HORPO with Computability Closure: A Reconstruction
Abstract. This paper provides a new, decidable definition of the higherorder recursive path ordering in which type comparisons are made only when needed, therefore eliminating the...
Frédéric Blanqui, Jean-Pierre Jouann...
CORR
2007
Springer
103views Education» more  CORR 2007»
15 years 3 months ago
HORPO with Computability Closure : A Reconstruction
This paper provides a new, decidable definition of the higher-order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for...
Frédéric Blanqui, Jean-Pierre Jouann...
CONCUR
1991
Springer
15 years 6 months ago
A Method for the Development of Totally Correct Shared-State Parallel Programs
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
Ketil Stølen
FMSD
2006
104views more  FMSD 2006»
15 years 3 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
DAC
1999
ACM
15 years 7 months ago
A Two-State Methodology for RTL Logic Simulation
This paper describes a two-state methodology for register transfer level (RTL) logic simulation in which the use of the Xstate is completely eliminated inside ASIC designs. Exampl...
Lionel Bening