691 search results - page 18 / 139 » Automatically Proving Linearizability |
FPCA
1989
14 years 1 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...
AISC
2008
Springer
13 years 12 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...
ICANNGA
2007
Springer
14 years 1 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...
WEBNET
2001
13 years 11 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...
DATAMINE
1998
13 years 9 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...