Sciweavers

2137 search results - page 141 / 428
» Proving Abstract Non-interference
Sort
View
PAAPP
2006
71views more  PAAPP 2006»
15 years 2 months ago
An efficient parallel termination detection algorithm
Abstract: In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributedmemory MIMD computers. We ...
Allison H. Baker, Silvia A. Crivelli, Elizabeth R....
SIAMCO
2008
56views more  SIAMCO 2008»
15 years 2 months ago
Singular Trajectories of Control-Affine Systems
Abstract. When applying methods of optimal control to motion planning or stabilization problems, some theoretical or numerical difficulties may arise, due to the presence of specif...
Yacine Chitour, Frédéric Jean, Emman...
TCAD
2008
181views more  TCAD 2008»
15 years 2 months ago
A Survey of Automated Techniques for Formal Software Verification
The quality and the correctness of software is often the greatest concern in electronic systems. Formal verification tools can provide a guarantee that a design is free of specific...
Vijay D'Silva, Daniel Kroening, Georg Weissenbache...
TIT
2008
105views more  TIT 2008»
15 years 2 months ago
Network Coding Capacity With a Constrained Number of Coding Nodes
Abstract-- We study network coding capacity under a constraint on the total number of network nodes that can perform coding. That is, only a certain number of network nodes can pro...
Jillian Cannons, Kenneth Zeger
JCT
2007
107views more  JCT 2007»
15 years 2 months ago
On a conjecture of Wilf
Abstract. Let n and k be natural numbers and let S(n, k) denote the Stirling numbers of the second kind. It is a conjecture of Wilf that the alternating sum nX j=0 (−1)j S(n, j) ...
Stefan De Wannemacker, Thomas Laffey, Robert Osbur...