146 search results - page 27 / 30 » Local Reasoning about Programs that Alter Data Structures |
108
click to vote
PEPM
1994
ACM
15 years 6 months ago
1994
ACM
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...
135
click to vote
SCP
2010
15 years 25 days ago
2010
Constraint automata have been introduced to provide a compositional, operational semantics for the exogenous coordination language Reo, but they can also serve interface specifica...
149
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
121
click to vote
ICPP
1999
IEEE
15 years 6 months ago
1999
IEEE
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
128
click to vote
CACM
2010
15 years 2 months ago
2010
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...