Sciweavers

5090 search results - page 199 / 1018
» Constructing Strategies for Programming
Sort
View
CONCUR
2007
Springer
14 years 3 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
QSIC
2006
IEEE
14 years 3 months ago
Control-Flow Analysis and Representation for Aspect-Oriented Programs
Aspect-oriented programming (AOP) has been proposed as a technique for improving the separation of concerns in software design and implementation. The field of AOP has, so far, f...
Jianjun Zhao
ASWEC
2005
IEEE
14 years 3 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...
VL
2003
IEEE
128views Visual Languages» more  VL 2003»
14 years 2 months ago
Development and evaluation of a model of programming errors
Models of programming and debugging suggest many causes of errors, and many classifications of error types exist. Yet, there has been no attempt to link causes of errors to these ...
Andrew Jensen Ko, Brad A. Myers
ICSM
1996
IEEE
14 years 1 months ago
Using Informal and Formal Techniques for the Reverse Engineering of C Programs
Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be...
Gerald C. Gannod, Betty H. C. Cheng