Sciweavers

128 search results - page 11 / 26
» Ensuring Termination by Typability
Sort
View
TOPNOC
2010
13 years 2 months ago
Search-Order Independent State Caching
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
Sami Evangelista, Lars Michael Kristensen
PODC
2010
ACM
13 years 11 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
IPL
2007
72views more  IPL 2007»
13 years 7 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
FOCS
2008
IEEE
14 years 1 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
SIGCSE
2009
ACM
150views Education» more  SIGCSE 2009»
14 years 8 months ago
Dereferee: exploring pointer mismanagement in student code
Dynamic memory management and the use of pointers are critical topics in teaching the C++ language. They are also some of the most difficult for students to grasp properly. The re...
Anthony Allevato, Manuel A. Pérez-Qui&ntild...