5377 search results - page 570 / 1076 » Programming Languages For Interactive Computing |
160
click to vote
CAV
2010
Springer
15 years 11 months ago
2010
Springer
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the gener...
142
click to vote
ICALP
2004
Springer
16 years 10 days ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
214
click to vote
MFCS
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. We provide concise abstract code for running the Java Virtual Machine (JVM) to execute compiled Java programs, and define a general compilation scheme of Java programs to...
182
click to vote
AMAST
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...
182
click to vote
PPOPP
2009
ACM
16 years 7 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...