5904 search results - page 932 / 1181 » Requirements for a Composition Language |
228
Voted
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
240
Voted
POPL
2008
ACM
16 years 4 months ago
2008
ACM
An ad hoc data source is any semistructured data source for which useful data analysis and transformation tools are not readily available. Such data must be queried, transformed a...
245
Voted
POPL
2006
ACM
16 years 4 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
233
Voted
POPL
2006
ACM
16 years 4 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
229
Voted
POPL
2006
ACM
16 years 4 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...