Sciweavers

4940 search results - page 523 / 988
» On the Complexity of Universal Programs
Sort
View
ARTS
1997
Springer
15 years 10 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke
169
Voted
CSUR
2000
78views more  CSUR 2000»
15 years 6 months ago
Developing flexible and high-performance Web servers with frameworks and patterns
The goal of this paper is to illustrate how frameworks and patterns address complexities that arise in the design and implementation of high-performance distributed software syste...
Douglas C. Schmidt, James C. Hu
POPL
2008
ACM
16 years 7 months ago
Multiparty asynchronous session types
Communication is becoming one of the central elements in software development. As a potential typed foundation for structured communication-centred programming, session types have...
Kohei Honda, Nobuko Yoshida, Marco Carbone
323
Voted
POPL
2008
ACM
16 years 7 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
278
Voted
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 3 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