Sciweavers

65 search results - page 11 / 13
» Program termination and well partial orderings
Sort
View
FASE
2006
Springer
13 years 11 months ago
Automated Systematic Testing of Open Distributed Programs
We present an algorithm for automatic testing of distributed programs, such as Unix processes with inter-process communication and Web services. Specifically, we assume that a prog...
Koushik Sen, Gul Agha
ENTCS
2002
134views more  ENTCS 2002»
13 years 7 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
COORDINATION
2005
Springer
14 years 1 months ago
Preserving Architectural Properties in Multithreaded Code Generation
Architectural descriptions can provide support for a formal representation of the structure and the overall behavior of software systems, which is suitable for an early assessment ...
Marco Bernardo, Edoardo Bontà
BMCBI
2010
147views more  BMCBI 2010»
13 years 7 months ago
Automatic detection of anchor points for multiple sequence alignment
Background: Determining beforehand specific positions to align (anchor points) has proved valuable for the accuracy of automated multiple sequence alignment (MSA) software. This f...
Florian Pitschi, Claudine Devauchelle, Eduardo Cor...
CONCUR
2007
Springer
14 years 1 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