Sciweavers

1733 search results - page 140 / 347
» On the naturalness of software
Sort
View
TAPSOFT
1997
Springer
15 years 10 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
TAPSOFT
1993
Springer
15 years 10 months ago
Optimal Reductions in Interaction Systems
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
Andrea Asperti, Cosimo Laneve
UIST
1993
ACM
15 years 10 months ago
SpeechSkimmer: Interactively Skimming Recorded Speech
Skimming or browsing audio recordings is much more difficult than visually scanning a document because of the temporal nature of audio. By exploiting properties of spontaneous spe...
Barry Arons
APSEC
2007
IEEE
15 years 10 months ago
Realizability of Collaboration-based Service Specifications
This paper is concerned with compositional specification of services using UML 2 collaborations, activity and interaction diagrams. It addresses the problem of realizability: give...
Humberto Nicolás Castejón, Rolv Br&a...
AMAST
2006
Springer
15 years 10 months ago
Realizability Criteria for Compositional MSC
Synthesizing a proper implementation for a scenario-based specification is often impossible, due to the distributed nature of implementations. To be able to detect problematic spec...
Arjan J. Mooij, Judi Romijn, Wieger Wesselink