论文信息 - Quantization of BiHamiltonian Systems - 字舞流文

Quantization of BiHamiltonian Systems

Peter J. Olver | David J. Kaup | P. Olver | D. Kaup

[1] Jan Friso Groote,et al. An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence , 1990, ICALP.

[2] Robert E. Tarjan,et al. Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[3] Krzysztof R. Apt,et al. Countable nondeterminism and random assignment , 1986, JACM.

[4] John-Jules Ch. Meyer,et al. On Infinite Computations in Denotational Semantics , 1983, Theor. Comput. Sci..

[5] Patrick Cousot,et al. Systematic design of program analysis frameworks , 1979, POPL.

[6] Nicolas Halbwachs,et al. Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[7] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[8] Gary A. Kildall,et al. A unified approach to global program optimization , 1973, POPL.