2635 search results - page 184 / 527 » Computing multihomogeneous resultants using straight-line pr... |
102
Voted
CDES
2006
15 years 2 months ago
2006
- Many memory-sensitive embedded applications can tolerate small performance degradations if doing so can reduce the memory space requirements significantly. This paper explores th...
115
Voted
BIRTHDAY
2010
Springer
14 years 11 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
130
click to vote
FAC
2010
14 years 10 months ago
2010
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
97
Voted
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
128
click to vote
ACMSE
2006
ACM
15 years 2 months ago
2006
ACM
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...