Sciweavers

2656 search results - page 276 / 532
» Design and analysis of algorithms reconsidered
Sort
View
OSDI
2008
ACM
16 years 7 months ago
Hunting for Problems with Artemis
Artemis is a modular application designed for analyzing and troubleshooting the performance of large clusters running datacenter services. Artemis is composed of four modules: (1)...
Gabriela F. Cretu-Ciocarlie, Mihai Budiu, Mois&eac...
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
16 years 2 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
ISSAC
2009
Springer
171views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Computing cylindrical algebraic decomposition via triangular decomposition
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang
FCCM
2007
IEEE
146views VLSI» more  FCCM 2007»
16 years 1 months ago
Mitrion-C Application Development on SGI Altix 350/RC100
This paper provides an evaluation of SGI® RASC™ RC100 technology from a computational science software developer’s perspective. A brute force implementation of a two-point an...
Volodymyr V. Kindratenko, Robert J. Brunner, Adam ...
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
16 years 1 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...