Sciweavers

6149 search results - page 515 / 1230
» Revealing the programming process
Sort
View
ICFP
2006
ACM
16 years 7 months ago
The missing link: dynamic components for ML
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so f...
Andreas Rossberg
ICFP
2005
ACM
16 years 7 months ago
A principled approach to operating system construction in Haskell
We describe a monadic interface to low-level hardware features that is a suitable basis for building operating systems in Haskell. The interface includes primitives for controllin...
Thomas Hallgren, Mark P. Jones, Rebekah Leslie, An...
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
16 years 4 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
FM
2009
Springer
124views Formal Methods» more  FM 2009»
16 years 1 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
INFOCOM
2007
IEEE
16 years 1 months ago
Stream: Low Overhead Wireless Reprogramming for Sensor Networks
— Wireless reprogramming of a sensor network is useful for uploading new code or for changing the functionality of existing code. Through the process, a node should remain recept...
Rajesh Krishna Panta, Issa Khalil, Saurabh Bagchi