1210 search results - page 111 / 242 » Formal Techniques for Java Programs |
127
click to vote
RIA
2007
15 years 2 months ago
2007
Continuations are a well established programming concept that allows capturing and resuming the current program state. They can be found in several functional programming languages...
112
Voted
CADE
2008
Springer
16 years 2 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
130
Voted
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
226
Voted
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
OOPSLA
2004
Springer
15 years 7 months ago
2004
Springer
Inheritance is a useful mechanism for factoring and reusing code. However, it has limitations for building extensible systems. We describe nested inheritance, a mechanism that add...