Sciweavers

5128 search results - page 323 / 1026
» When Abstraction Fails
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
15 years 7 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
IJCOMSYS
2006
82views more  IJCOMSYS 2006»
15 years 7 months ago
Reorder notifying TCP (RN-TCP) with explicit packet drop notification (EPDN)
Abstract. Numerous studies have shown that packet reordering is common, especially in networks where there is high degree of parallelism and different link speeds. Reordering of pa...
Arjuna Sathiaseelan, Tomasz Radzik
IJHPCA
2006
105views more  IJHPCA 2006»
15 years 7 months ago
Advances, Applications and Performance of the Global Arrays Shared Memory Programming Toolkit
This paper describes capabilities, evolution, performance, and applications of the Global Arrays (GA) toolkit. GA was created to provide application programmers with an interface ...
Jarek Nieplocha, Bruce Palmer, Vinod Tipparaju, Ma...
148
Voted
JSCIC
2008
58views more  JSCIC 2008»
15 years 7 months ago
A Local Semi-Implicit Level-Set Method for Interface Motion
Abstract This paper proposes and implements a novel hybrid level set method which combines the numerical efficiency of the local level set approach with the temporal stability affo...
David Salac, Wei Lu
IJAC
2007
59views more  IJAC 2007»
15 years 7 months ago
Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
Laura Ciobanu