Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
8,594
Table 1. Predicates for partial Java semantics.
2003
"... In PAGE 7: ...Table1 to record information used by the properties dis- cussed in this paper. The nullary predicate at[pt]() records the program location in a configuration and holds in configurations in which the program is immediately after line pt.... ..."
Cited by 19
Table 1. Predicates for partial Java semantics.
2003
"... In PAGE 7: ...Table1 to record information used by the properties dis- cussed in this paper. The nullary predicate at[pt]() records the program location in a configuration and holds in configurations in which the program is immediately after line pt.... ..."
Cited by 19
Table 1 Predicates for the semantics of a Java fragment.
2003
"... In PAGE 6: ... The integrity constraints for integers are simply the Peano axioms encoded using F OTC formu- lae. Table1 presents some of the predicates used to analyze the example programs. Predicates in the table are written in a generic way and can be applied to analyze different Java programs by modifying the set of labels and fields.... In PAGE 7: ... 2.3 in TVLA/3VMC is to formulate them in F OTC using the predicates defined in Table1 . In Table 2 these formulae are given for the non-blocking queue algorithm.... ..."
Cited by 13
Table 1 Predicates for the semantics of a Java fragment.
2003
"... In PAGE 6: ... The integrity constraints for integers are simply the Peano axioms encoded using F OTC formu- lae. Table1 presents some of the predicates used to analyze the example programs. Predicates in the table are written in a generic way and can be applied to analyze different Java programs by modifying the set of labels and fields.... In PAGE 7: ... 2.3 in TVLA/3VMC is to formulate them in F OTC using the predicates defined in Table1 . In Table 2 these formulae are given for the non-blocking queue algorithm.... ..."
Cited by 13
Table 1. Behavior of di erent Java/JVM implementations. The row `Underspeci ed apos; shows whether an interface is initialized lazy or eager. The row `Ambigous apos; shows whether the implementation uses Java or JVM semantics for initialization. The row `Correct apos; shows whether compiler optimizations respect the point of initialization.
"... In PAGE 2: ... Even the main vendors of Java (ma- chines) implement the initialization strategy di erently, which obviously contradicts portability. Table1 shows the interface initialization behavior of di erent imple- mentations. 3 Initialization is Ambiguous Initialization in Java is based on the concept of rst ac- tive use: if a constructor or a member of a class is used, the class must be initialized.... ..."
Table 1. Behavior of di erent Java/JVM implementations. The row `Underspeci ed apos; shows whether an interface is initialized lazy or eager. The row `Ambigous apos; shows whether the implementation uses Java or JVM semantics for initialization. The row `Correct apos; shows whether compiler optimizations respect the point of initialization.
"... In PAGE 2: ... Even the main vendors of Java (ma- chines) implement the initialization strategy di erently, which obviously contradicts portability. Table1 shows the interface initialization behavior of di erent imple- mentations. 3 Initialization is Ambiguous Initialization in Java is based on the concept of rst ac- tive use: if a constructor or a member of a class is used, the class must be initialized.... In PAGE 3: ... In his de- scription of the defensive JVM Cohen already noticed a discrepancy [4], however, his observation was never con- rmed. Table1 describes the behavior of our program for several di erent systems. A similar problem arises in the context of array cre- ation expressions.... ..."
Table 1 shows the design aspect supported by Ada 95, C++, Java, Eiffel and our mechanism and Fig. 1 illustrates the complete semantics of our mechanism.
"... In PAGE 11: ...Block x x x X Methods x Attachment of Handlers Class x x Automatic x Configurable X Propagation of Exceptions Explicit x x x Termination x x x x X Continuation of Control Flow Retry x X Explicit Propagations x x x Semi Automatic Clean- up x x Clean-up Actions Specific Construct x X Unsupported x x Concurrent Exception Handling Limited x x X Table1 . Comparison of Exception Handling Mechanism.... ..."
Table 3. Combined Java and JVM languages
"... In PAGE 3: ... The paper contains three tables which provide an index into the relevant liter- ature. These are Table 1 (on Java), Table 2 (on the JVM), and Table3 (on the compiler). 2.... In PAGE 27: ... The only work we have been able to find that com- plements Java and JVM semantics with a specification of the compiler is discussed in a separate section on the Abstract State Machine approach. Table3 includes summaries of the efforts described below. 6.... ..."
Table 1 The most obvious cause of this performance is using heavy use of regexes, and also it was written as a last minute extension, so is completely unoptimised. In another project, a different example was of a genetic algorithm being translated from C++ to Java which also showed a slowdown. The rest of the project was rewriting it, so in the end all it did was pop integers off a stack, semantically equivalent to the C++ implementation of tree traversal. Rewriting this Java code in a similar way not the type of project I personally wanted. Also, it is a case of using the best tool for the job, which means Java for server side user processing, and Prolog for heavy searching, so it was abandoned, and original Prolog version reconsidered.
Results 1 - 10
of
8,594
