Sciweavers

5090 search results - page 121 / 1018
» Constructing Strategies for Programming
Sort
View
KBSE
1997
IEEE
14 years 1 months ago
A Formal Automated Approach for Reverse Engineering Programs with Pointers
Given a program S and a precondition Q, the strongest postcondition, denoted sp(S Q), is defined as the strongest condition that holds after the execution of S, given that S term...
Gerald C. Gannod, Betty H. C. Cheng
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 9 months ago
Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks
Abstract- We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source ...
Lawrence Ong, Mehul Motani
ICFP
2010
ACM
13 years 10 months ago
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
Stefan Holdermans, Jurriaan Hage
JUCS
2007
104views more  JUCS 2007»
13 years 9 months ago
Achieving Atomicity for Web Services Using Commutativity of Actions
: Web Services enable the creation of complex business activities through the cooperation of independently developed software programs. However, Web Services incur the risk of long...
P. Michael Melliar-Smith, Louise E. Moser
CAV
2006
Springer
122views Hardware» more  CAV 2006»
14 years 27 days ago
Repair of Boolean Programs with an Application to C
We show how to find and fix faults in Boolean programs by extending the program to a game. In the game, the protagonist can select an alternative implementation for an incorrect st...
Andreas Griesmayer, Roderick Bloem, Byron Cook