Sciweavers

117 search results - page 6 / 24
» A Semantic Theory for Concurrent ML
Sort
View
ICFP
2008
ACM
15 years 11 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
ENTCS
2008
99views more  ENTCS 2008»
14 years 11 months ago
Specifying Properties of Concurrent Computations in CLF
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...
Kevin Watkins, Iliano Cervesato, Frank Pfenning, D...
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
15 years 8 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
121
Voted
IPPS
2003
IEEE
15 years 4 months ago
Towards a Theory of Bisimulation for a Fragment of Verilog
In this paper, we have developed an operational semantic framework for a non-trival subset of Verilog which features event–driven computation, shared variable concurrency. The b...
Li Yongjian, Jifeng He
PLDI
2011
ACM
14 years 2 months ago
Safe optimisations for shared-memory concurrent programs
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
Jaroslav Sevcík