Sciweavers

6740 search results - page 557 / 1348
» Using Classification as a Programming Language
Sort
View
POPL
2007
ACM
16 years 5 months ago
Variance analyses from invariance analyses
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Di...
POPL
2006
ACM
16 years 5 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
SIGSOFT
2007
ACM
16 years 5 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
ASPLOS
2009
ACM
16 years 5 months ago
Commutativity analysis for software parallelization: letting program transformations see the big picture
Extracting performance from many-core architectures requires software engineers to create multi-threaded applications, which significantly complicates the already daunting task of...
Farhana Aleen, Nathan Clark
EDO
2006
Springer
15 years 8 months ago
Improving modularity of reflective middleware with aspect-oriented programming
Reflective middleware has been proposed as an effective way to enhance adaptability of component-oriented middleware architectures. To be effectively adaptable, the implementation...
Nélio Cacho, Thaís Vasconcelos Batis...