4480 search results - page 215 / 896 » Prototyping Completion with Constraints Using Computational ... |
161
click to vote
EUC
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. In ubiquitous computing, as more and more devices are embedded into the environment, there is a risk that the user loses the understanding of the system. In normal use th...
149
click to vote
RTA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
189
click to vote
SACMAT
2006
ACM
16 years 13 days ago
2006
ACM
In recent years, trust negotiation (TN) has been proposed as a novel access control solution for use in open system environments in which resources are shared across organizationa...
184
click to vote
ICFEM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
168
click to vote
ICPP
2008
IEEE
16 years 28 days ago
2008
IEEE
Parallel I/O plays an increasingly important role in today’s data intensive computing applications. While much attention has been paid to parallel read performance, most of this...