Sciweavers

1613 search results - page 159 / 323
» Functional and Constraint Logic Programming
Sort
View
125
Voted
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
15 years 3 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm
121
Voted
ECOOP
1999
Springer
15 years 7 months ago
Towards Automatic Specialization of Java Programs
Abstract. Automatic program specialization can derive efficient implementations from generic components, thus reconciling the often opposing goals of genericity and efficiency. Thi...
Ulrik Pagh Schultz, Julia L. Lawall, Charles Conse...
DAC
2002
ACM
16 years 4 months ago
Hole analysis for functional coverage data
One of the main goals of coverage tools is to provide the user with informative presentation of coverage information. Specifically, information on large, cohesive sets of uncovere...
Oded Lachish, Eitan Marcus, Shmuel Ur, Avi Ziv
145
Voted
ASIAN
2006
Springer
118views Algorithms» more  ASIAN 2006»
15 years 7 months ago
An Approach to Formal Verification of Arithmetic Functions in Assembly
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
Reynald Affeldt, Nicolas Marti
129
Voted
DAGSTUHL
2004
15 years 5 months ago
Testing with Functions as Specifications
Although computer systems penetrate all facets of society, the software running those systems may contain many errors. Producing high quality software appears to be difficult and v...
Pieter W. M. Koopman