Sciweavers

1686 search results - page 119 / 338
» Programs as polygraphs: computability and complexity
Sort
View
116
Voted
SIGPLAN
2008
15 years 3 months ago
Languages and performance engineering: method, instrumentation, and pedagogy
Programs encounter increasingly complex and fragile mappings to computing platforms, resulting in performance characteristics that are often mysterious to students, practitioners,...
Doug Lea, David F. Bacon, David Grove
149
Voted
ERLANG
2003
ACM
15 years 8 months ago
ARMISTICE: an experience developing management software with Erlang
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...
David Cabrero, Carlos Abalde, Carlos Varela, Laura...
256
Voted
PLDI
2009
ACM
16 years 4 months ago
Semantics-aware trace analysis
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
Kevin J. Hoffman, Patrick Eugster, Suresh Jagannat...
132
Voted
ICFP
2003
ACM
16 years 3 months ago
Software is discrete mathematics
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
Rex L. Page
150
Voted
FAC
2010
121views more  FAC 2010»
15 years 26 days ago
Blaming the client: on data refinement in the presence of pointers
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...
Ivana Filipovic, Peter W. O'Hearn, Noah Torp-Smith...