1878 search results - page 168 / 376 » The Vienna Abstract Machine |
147
click to vote
ANOR
2002
15 years 6 months ago
2002
Abstract: We define events so as to reduce the number of events and decision variables needed for modeling batchscheduling problems such as described in [Westenberger and Kallrath ...
158
click to vote
FAC
2002
15 years 6 months ago
2002
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. More...
149
click to vote
IMCSIT
2010
15 years 4 months ago
2010
Abstract--We present a tool that facilitates the efficient extension of morphological lexica. The tool exploits information from a morphological lexicon, a morphological grammar an...
162
click to vote
MST
2011
15 years 1 months ago
2011
Abstract. In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product Z ≀ (Z × Z). ...
283
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...