691 search results - page 18 / 139 » Automatically Proving Linearizability |
149
click to vote
FPCA
1989
15 years 10 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
178
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modified to call a decision proced...
156
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper proposes an automated quantum circuit synthesis approach, using a genetic algorithm. We consider the circuit as a successive rippling of the so-called gate sec...
172
click to vote
WEBNET
2001
15 years 7 months ago
2001
: This paper presents a method that automates hypermedia presentation generation on the Web. The method is based on RMM (Relationship Management Methodology) for aspects of hyperme...
195
click to vote
DATAMINE
1998
15 years 6 months ago
1998
Decision trees have proved to be valuable tools for the description, classi cation and generalizationof data. Work on constructingdecisiontrees from data exists in multiplediscipli...