959 search results - page 92 / 192 » Fundamental Concepts in Programming Languages |
111
click to vote
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
121
click to vote
ASIAN
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony i...
248
click to vote
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
138
click to vote
AI
2004
Springer
15 years 3 months ago
2004
Springer
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
153
click to vote
LCPC
2007
Springer
15 years 10 months ago
2007
Springer
Program dynamic optimization, adaptive to runtime behavior changes, has become increasingly important for both performance and energy savings. However, most runtime optimizations o...