2621 search results - page 443 / 525 » Near orders and codes |
125
click to vote
CC
2001
Springer
15 years 8 months ago
2001
Springer
Compilers can exploit knowledge that a variable has a fixed known value at a program point for optimizations such as code specialization and constant folding. Recent work has shown...
163
Voted
ICSE
2000
IEEE-ACM
15 years 8 months ago
2000
IEEE-ACM
This paper proposes to use SDL block diagrams, UML class diagrams, and UML behavior diagrams like collaboration diagrams, activity diagrams, and statecharts as a visual programmin...
152
click to vote
CAV
1997
Springer
15 years 8 months ago
1997
Springer
We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular,...
127
Voted
PG
2000
IEEE
15 years 8 months ago
2000
IEEE
A novel progressive geometry compression scheme is presented in the paper. In this scheme a mesh is represented as a base mesh followed by some groups of vertex split operations us...
210
click to vote
PLDI
1995
ACM
15 years 8 months ago
1995
ACM
Compile-time type information should be valuable in efficient compilation of statically typed functional languages such as Standard ML. But how should type-directed compilation w...