Sciweavers

1147 search results - page 170 / 230
» Termination in language-based systems
Sort
View
IWMM
2010
Springer
137views Hardware» more  IWMM 2010»
14 years 1 months ago
The locality of concurrent write barriers
Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular ...
Laurence Hellyer, Richard Jones, Antony L. Hosking
RTA
2010
Springer
14 years 1 months ago
Infinitary Rewriting: Foundations Revisited
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
Stefan Kahrs
DSN
2004
IEEE
14 years 1 months ago
An Architectural Framework for Providing Reliability and Security Support
This paper explores hardware-implemented error-detection and security mechanisms embedded as modules in a hardware-level framework called the Reliability and Security Engine (RSE)...
Nithin Nakka, Zbigniew Kalbarczyk, Ravishankar K. ...
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
14 years 1 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
ATAL
2008
Springer
13 years 12 months ago
A best-first anytime algorithm for computing optimal coalition structures
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
Chattrakul Sombattheera, Aditya Ghose