Sciweavers

506 search results - page 2 / 102
» Proving Properties about Lists Using Containers
Sort
View
IWAR
1992
13 years 6 months ago
Automated Reasoning in Differential Geometry and Mechanics Using Characteristic Method
This paper reports the study of properties of the curve pairs of the Bertrand types using our automated reasoning program based on Wu's method of mechanical theorem proving fo...
Shang-Ching Chou, Xiao-Shan Gao
POPL
2007
ACM
14 years 5 months ago
Proving that programs eventually do something good
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
Byron Cook, Alexey Gotsman, Andreas Podelski, Andr...
ICSM
2009
IEEE
13 years 3 months ago
An empirical study on the risks of using off-the-shelf techniques for processing mailing list data
Mailing list repositories contain valuable information about the history of a project. Research is starting to mine this information to support developers and maintainers of longl...
Nicolas Bettenburg, Emad Shihab, Ahmed E. Hassan
FASE
2011
Springer
12 years 8 months ago
Testing Container Classes: Random or Systematic?
Abstract. Container classes such as lists, sets, or maps are elementary data structures common to many programming languages. Since they are a part of standard libraries, they are ...
Rohan Sharma, Milos Gligoric, Andrea Arcuri, Gordo...
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
13 years 10 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...