4940 search results - page 393 / 988 » On the Complexity of Universal Programs |
154
click to vote
ICECCS
2000
IEEE
15 years 11 months ago
2000
IEEE
The goal of result-verificationis toprove that one execution run of a program satisjes its speciJcation. Compared with iniplenzentation-verification,result-verification has a larg...
176
click to vote
PLDI
1999
ACM
15 years 11 months ago
1999
ACM
Previous selective dynamic compilation systems have demonstrated that dynamic compilation can achieve performance improvements at low cost on small kernels, but they have had diff...
191
click to vote
TOOLS
1999
IEEE
15 years 11 months ago
1999
IEEE
The goal of this paper is to obtain a one-to-one correspondence between state machines as e.g. used in UML and object-oriented programming languages. A proposal is made for a lang...
205
click to vote
WETICE
1997
IEEE
15 years 11 months ago
1997
IEEE
: Bugs in network application program can be exploited to compromise the system on which the application is running. When running these applications in an unsafe environment such a...
205
click to vote
HASKELL
2007
ACM
15 years 10 months ago
2007
ACM
This paper describes the design and construction of a Haskell source-level debugger built into the GHCi interactive environment. We have taken a pragmatic approach: the debugger i...