500 search results - page 76 / 100 » Coalgebraic semantics for timed processes |
162
click to vote
DLOG
1998
15 years 5 months ago
1998
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
205
click to vote
SMALLTALK
2007
Springer
15 years 10 months ago
2007
Springer
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
122
click to vote
WWW
2003
ACM
16 years 4 months ago
2003
ACM
A modern approach for generating individualized web-sites is to compose a page out of individual elements, for instance XML-fragments, which is eventually transformed to . If the ...
172
click to vote
HASKELL
2009
ACM
15 years 10 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
157
click to vote
EDBT
2010
ACM
15 years 7 months ago
2010
ACM
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...