Sciweavers

684 search results - page 73 / 137
» Requirements for an Elucidative Programming Environment
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 1 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
PLDI
2010
ACM
15 years 9 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
ICFP
2010
ACM
15 years 5 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
TASE
2007
IEEE
15 years 10 months ago
Realizing Live Sequence Charts in SystemVerilog
The design of an embedded control system starts with an investigation of properties and behaviors of the process evolving within its environment, and an analysis of the requiremen...
Hai H. Wang, Shengchao Qin, Jun Sun 0001, Jin Song...
SEKE
2007
Springer
15 years 10 months ago
TRAP.NET: A Realization of Transparent Shaping in .NET
We define adaptability as the capacity of software in adjusting its behavior in response to changing conditions. To list just a few examples, adaptability is important in pervasiv...
Seyed Masoud Sadjadi, Fernando Trigoso