Sciweavers

107 search results - page 3 / 22
» Specifying the Correctness of Binding-Time Analysis
Sort
View
ICIC
2010
Springer
13 years 5 months ago
The Intelligent Music Editor: Towards an Automated Platform for Music Analysis and Editing
Digital music editing is a standard process in music production for correcting mistakes and enhancing quality, but this is tedious and timeconsuming. The Intelligent Music Editor, ...
Yuxiang Liu, Roger B. Dannenberg, Lianhong Cai
POPL
2004
ACM
14 years 7 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
PLDI
2003
ACM
14 years 17 days ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
SAC
2010
ACM
14 years 1 months ago
General constant expressions for system programming languages
Most mainstream system programming languages provide support for builtin types, and extension mechanisms through userdefined types. They also come with a notion of constant expre...
Gabriel Dos Reis, Bjarne Stroustrup
SIGSOFT
2010
ACM
13 years 5 months ago
Realizability analysis for message-based interactions using shared-state projections
The global interaction behavior in message-based systems can be specified as a finite-state machine defining acceptable sequences of messages exchanged by a group of peers. Realiz...
Sylvain Hallé, Tevfik Bultan