Sciweavers

1686 search results - page 65 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ESOP
2005
Springer
15 years 3 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
ICALP
1999
Springer
15 years 2 months ago
Wide Area Computation
Abstract. The last decades have seen the emergence of the sea of objects paradigm for structuring complex distributed systems on workstations and local area networks. In this appro...
Luca Cardelli
ICLP
1999
Springer
15 years 2 months ago
Computing Large and Small Stable Models
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
Miroslaw Truszczynski
TPDS
2008
113views more  TPDS 2008»
14 years 9 months ago
Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs
Computational Grids potentially offer low cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs ...
Abdallah Al Zain, Philip W. Trinder, Greg Michaels...
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
15 years 2 months ago
Configuration Relocation and Defragmentation for Reconfigurable Computing
Custom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. Howeve...
Katherine Compton, James Cooley, Stephen Knol, Sco...