291 search results - page 54 / 59 » Generating Unit Tests from Formal Proofs |
CICLING
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...
66
Voted
ISCAS
2006
IEEE
15 years 3 months ago
2006
IEEE
— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...
IS
2008
14 years 9 months ago
2008
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
JSAC
2006
14 years 9 months ago
2006
Abstract-- Information about the topology and link-level characteristics of a network is critical for many applications including network diagnostics and management. However, this ...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
The presence of encyclopedic Web sources, such as Wikipedia, the Internet Movie Database (IMDB), World Factbook, etc. calls for new querying techniques that are simple and yet mor...