Sciweavers

2290 search results - page 198 / 458
» Extensible Protected Types
Sort
View
BIRTHDAY
2009
Springer
16 years 1 months ago
Mobile Processes and Termination
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
297
Voted
DAARC
2009
Springer
268views Algorithms» more  DAARC 2009»
16 years 1 months ago
Binding without Identity: Towards a Unified Semantics for Bound and Exempt Anaphors
Expressions such as English himself are interpreted as locally bound anaphors in certain syntactic environments and are exempt from the binding conditions in others. This article p...
Eric Reuland, Yoad Winter
147
Voted
IAT
2008
IEEE
16 years 1 months ago
Extending a Defeasible Reasoner with Modal and Deontic Logic Operators
Defeasible logic is a non-monotonic formalism that deals with incomplete and conflicting information. Modal logic deals with necessity and possibility, exhibiting defeasibility; t...
Efstratios Kontopoulos, Nick Bassiliades, Guido Go...
173
Voted
IPPS
2007
IEEE
16 years 1 months ago
GridCopy: Moving Data Fast on the Grid
An important type of communication in grid and distributed computing environments is bulk data transfer. GridFTP has emerged as a de facto standard for secure, reliable, high-perf...
Rajkumar Kettimuthu, William E. Allcock, Lee Limin...
195
Voted
TIME
2006
IEEE
16 years 1 months ago
Ultimately Periodic Simple Temporal Problems (UPSTPs)
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
Jean-François Condotta, Gérard Ligoz...