3653 search results - page 339 / 731 » On Recognizable Timed Languages |
160
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
This paper presents an approach to searching for deadlocks in Concurrent Haskell programs. The search is based on a redefinition of the IO monad which allows the reversal of Concu...
183
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
165
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
189
click to vote
AOSD
2010
ACM
16 years 1 months ago
2010
ACM
Aspect-Oriented Modeling (AOM) provides support for separating concerns at the design level. Even though most AOM approaches provide means to execute the composition of the modula...
205
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Ensuring transactional behavior of business processes and web service compositions is an essential issue in the area of serviceoriented computing. Transactions in this context may ...