Sciweavers

1073 search results - page 51 / 215
» Formal Program Development with Approximations
Sort
View
STACS
2005
Springer
15 years 7 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
101
Voted
ICTAC
2009
Springer
15 years 9 months ago
The Secret Art of Computer Programming
“Classical” program development by refinement [12, 2, 3] is a technique for ensuring that source-level program code remains faithful to the semantic goals set out in its corre...
Annabelle McIver
ENTCS
2010
141views more  ENTCS 2010»
15 years 2 months ago
Debugging as a Science, that too, when your Program is Changing
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...
Abhik Roychoudhury
PADL
2012
Springer
13 years 10 months ago
Recent Advances in Declarative Networking
Declarative networking is a programming methodology that enables developers to concisely specify network protocols and services, and directly compile these specifications into a d...
Boon Thau Loo, Harjot Gill, Changbin Liu, Yun Mao,...
HOPL
2007
15 years 6 months ago
Statecharts in the making: a personal account
This paper is a highly personal and subjective account of how the language of statecharts came into being. The main novelty of the language is in being a fully executable visual f...
David Harel