Change search
CiteExportLink to record
Permanent link

Direct link
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Flow Java: declarative concurrency for Java.
RISE, Swedish ICT, SICS, Computer Systems Laboratory.
RISE, Swedish ICT, SICS, Computer Systems Laboratory.ORCID iD: 0000-0002-6718-0144
RISE, Swedish ICT, SICS, Computer Systems Laboratory.
2003 (English)In: Proceedings of the Nineteenth International Conference on Logic Programming, 2003, 1Conference paper, Published paper (Refereed)
Abstract [en]

Logic variables pioneered by (concurrent) logic and concurrent constraint programming are powerful mechanisms for automatically synchronizing concurrent computations. They support a declarative model of concurrency that avoids explicitly suspending and resuming computations. This paper presents Flow Java which conservatively extends Java with single assignment variables and futures as variants of logic variables. The extension is conservative with respect to object-orientation, types, parameter passing, and concurrency in Java. Futures support secure concurrent abstractions and are essential for seamless integration of single assignment variables into Java. We show how Flow Java supports the construction of simple and concise concurrent programming abstractions. We present how to moderately extend compilation and the runtime architecture of an existing Java implementation for Flow Java. Evaluation using standard Java benchmarks shows that in most cases the overhead is between 10% and 40%. For some pathological cases the runtime increases by up to 75%.

Place, publisher, year, edition, pages
2003, 1.
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-22403OAI: diva2:1041948
Nineteenth International Conference on Logic Programming, 9-13 Dec 2003, Mumbai, India
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2017-08-21Bibliographically approved

Open Access in DiVA

fulltext(159 kB)