Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
The Cornell program synthesizer: a syntax-directed programming environment
Communications of the ACM
The why and wherefore of the Cornell Program Synthesizer
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
A systematic approach to advanced debugging through incremental compilation (Preliminary Draft)
SIGSOFT '83 Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging
Preliminary experience from the dice system a distributed incremantal compiling environment
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
The Cornell Program Synthesizer: A Microcomputer Implementation of PL/CS
The Cornell Program Synthesizer: A Microcomputer Implementation of PL/CS
Syntax-directed editing: towards integrated programming environments
Syntax-directed editing: towards integrated programming environments
A language-oriented interactive programming environment based on compilation technology
A language-oriented interactive programming environment based on compilation technology
A multiprocess design for an integrated programming environment
A multiprocess design for an integrated programming environment
Incremental global reoptimization of programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental compilation of optimized code
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An approach to incremental register allocation (abstract)
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Safeness of Make-Based Incremental Recompilation
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
| Hi-index | 0.00 |
The PSEP System represents a novel approach to incremental compilation for block structured languages. PSEP implements a very fine grain, “greedy” approach as a highly concurrent system of two processes: an editor and a code generator. The design allows the two processes to execute without locking their shared data objects, utilizing semantic information about the concurrent system to guarantee the consistency of the shared objects. This design is compared with the more common “demand” approach to incremental compilation.