the Gamma programming paradigm is based on the multiset data structure. In this model a succession of chemical reactions consume the elements of the multiset or multiset of tuples, and produce new elements according t...
详细信息
the Gamma programming paradigm is based on the multiset data structure. In this model a succession of chemical reactions consume the elements of the multiset or multiset of tuples, and produce new elements according to specific rules. this paper describes how the Gamma paradigm can be integrated withthe entity-relationship (ER) model to structure parallel and distributed programs. Such an integration can permit querying as well as application programming in a seamless fashion based on the notion of transactions and provides for heterogeneous processing. We also describe how to design a scheduler for the Gamma paradigm and how this paradigm is useful in heterogeneous programming.
SIGNAL, a synchronous and data-flow oriented language, allows the user to design safe real-time applications. Its compiler uses a single formalism called "synchronized data-flow graphs" (SDFGs) all along the...
详细信息
SIGNAL, a synchronous and data-flow oriented language, allows the user to design safe real-time applications. Its compiler uses a single formalism called "synchronized data-flow graphs" (SDFGs) all along the conception chain from specification to proof and verification. We show how this formalism can be kept on until distributed code generation. the described implementation, called synchronous distribution, respects the semantics of SIGNAL. We finally show the limits of SDFGs and conclude with a discussion on the necessity of another model describing dynamic behaviours of distributed executions.
the proceedings contain 29 papers. the special focus in this conference is on Automated Deduction. the topics include: Termination of a Set of Rules Modulo a Set of Equations;associative-Commutative Unification;a Line...
ISBN:
(纸本)9780387960227
the proceedings contain 29 papers. the special focus in this conference is on Automated Deduction. the topics include: Termination of a Set of Rules Modulo a Set of Equations;associative-Commutative Unification;a Linear Time Algorithm for a Subcase of Second Order Instantiation;a New Equational Unification Method: A Generalisation of Martelli-Montanari’s Algorithm;a Case Study of theorem Proving by the Knuth-Bendix Method: Discovering that x3= x Implies Ring Commutativity;a Narrowing Procedure for theories with Constructors;a General inductive Completion Algorithm and Application to Abstract Data Types;the Next Generation of Interactive theorem Provers;the Linked Inference Principle, II: the User’s Viewpoint;a Portable Environment for Research in Automated Reasoning;a New Interpretation of the Resolution Principle;using Examples, Case Analysis, and Dependency Graphs in theorem Proving;expansion Tree Proofs and their Conversion to Natural Deduction Proofs;analytic and Non-analytic Proofs;applications of Protected Circumscription;implementation Strategies for Plan-Based Deduction;a programming Notation for Tactical Reasoning;the Mechanization of Existence Proofs of Recursive Predicates;solving Word Problems in Free Algebras Using Complexity Functions;solving a Problem in Relevance logic with an Automated theorem Prover;a Natural Proof System Based on Rewriting Techniques;EKL—A Mathematically Oriented Proof Checker;A Linear Characterization of NP-Complete Problems;a Satisfiability Tester for Non-Clausal Propositional Calculus;a Decision Method for Linear Temporal logic;a Progress Report on New Decision Algorithms for Finitely Presented Abelian Groups;canonical Forms in Finitely Presented Algebras.
暂无评论