258 search results - page 51 / 52 » Static Semantics as Program Transformation and Well-founded ... |
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
ISCA
2010
IEEE
13 years 10 months ago
2010
IEEE
Over the past decade there has been a surge of academic and industrial interest in optimistic concurrency, i.e. the speculative parallel execution of code regions that have the se...
TGC
2005
Springer
13 years 10 months ago
2005
Springer
Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the acade...
PPOPP
2009
ACM
14 years 5 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
CLUSTER
2003
IEEE
13 years 10 months ago
2003
IEEE
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...