Sciweavers

4722 search results - page 292 / 945
» Representation-independent program analysis
Sort
View
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
16 years 6 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman
POPL
2010
ACM
16 years 1 months ago
Ypnos: declarative, parallel structured grid programming
A fully automatic, compiler-driven approach to parallelisation can result in unpredictable time and space costs for compiled code. On the other hand, a fully manual approach to pa...
Dominic A. Orchard, Max Bolingbroke, Alan Mycroft
HICSS
2009
IEEE
109views Biometrics» more  HICSS 2009»
16 years 1 months ago
The Construction of Peers and Artifacts: The Organizing Role of "Programming Guidelines"
In this paper, we1 study new organizational forms for production processes that emerge in large scale Free/Libre Open Source Software (FLOSS) projects. We will focus on the textua...
Vincenzo D'Andrea, Stefano De Paoli, Maurizio Teli
HYBRID
2010
Springer
16 years 1 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
SEFM
2007
IEEE
16 years 25 days ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook