Sciweavers

5606 search results - page 1005 / 1122
» Randomization Techniques for Graphs.
Sort
View
CAISE
2004
Springer
15 years 10 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
CGO
2004
IEEE
15 years 10 months ago
Optimizing Translation Out of SSA Using Renaming Constraints
Static Single Assignment form is an intermediate representation that uses instructions to merge values at each confluent point of the control flow graph. instructions are not ma...
Fabrice Rastello, François de Ferriè...
CAV
2006
Springer
116views Hardware» more  CAV 2006»
15 years 10 months ago
Lazy Shape Analysis
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...
EGH
2004
Springer
15 years 10 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan
ACSAC
2001
IEEE
15 years 10 months ago
Information Flow Analysis of Component-Structured Applications
Software component technology facilitates the costeffective development of specialized applications. Nevertheless, due to the high number of principals involved in a component-str...
Peter Herrmann
« Prev « First page 1005 / 1122 Last » Next »