G - Physics – 06 – F
Patent
G - Physics
06
F
G06F 15/173 (2006.01) G06F 9/44 (2006.01)
Patent
CA 2243642
This invention computes by constructing a lattice of states (figure 34). Every lattice of states (figure 6) corresponding to correct execution satisfies the temporal logic formula comprising a DANCE program (33). The invention integrates into a state-lattice (figure 34) computational model: a polymorphic strong type system; visibility-limiting domains; first-order assertions; and logic for providing a program correctness. This invention includes special hardware means (figure 24) for elimination of cache coherency among other things, necessary to construct state-lattices (figure 6) concurrently. The model of computation for the DANCE language consisting of four, interrelated, logical systems describing state-lattices (figure 6), types, domains (figure 42) and assertions. A fifth logical system (BPL) interrelates the other four systems allowing proofs of program correctness. The method of the present invention teaches programs as temporal formulas satisfied by lattices of states (figure 6) corresponding to correct execution. State-lattices (figure 6) that are short and bushy allow application of many processors simultaneously, thus reducing execution time.
L'invention concerne la construction d'un treillis d'états (figure 34). Chaque treillis d'états (figure 6) correspondant à une exécution correcte répond à la formule logique temporelle comprenant un programme DANCE (33). L'invention intègre dans un treillis d'états (figure 34) un modèle calculatoire: un système de type fort polymorphe; des domaines de limitation de visibilité; des assertions de premier ordre; une logique assurant la correction du programme. L'invention comprend des moyens de matériel spéciaux (figure 24) servant à éliminer la cohérence d'antémémoire, entre autres, et nécessaires afin de construire des treillis d'états (figure 6) simultanément. Le modèle de calcul du langage DANCE consiste en quatre systèmes logiques en corrélation décrivant des treillis d'états (figure 6), des types, des domaines (figure 42) et des assertions. Un cinquième système logique (BPL) met en corrélation les quatre autres systèmes, afin de prouver la correction du programme. Ce procédé concerne des programmes en tant que formules temporelles auxquelles répondent des treillis d'états (figure 6) correspondant à une exécution normale. Des treillis d'états (figure 6) courts et denses permettent la mise en application simultanée d'un nombre important de processeurs, ce qui limite la durée d'exécution.
Multitude Corporation
Ridout & Maybee Llp
LandOfFree
Dance/multitude concurrent computation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Dance/multitude concurrent computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dance/multitude concurrent computation will most certainly appreciate the feedback.
Profile ID: LFCA-PAI-O-1765478