![]() In proceedings of the l Oth Symposium on Theory of Computing, ACM Press, New York, NY, 326-337. A practical decision method for propositional dynamic logic. Massachusetts Institute of Technology, Cambridge, MA. MIT Press series in the foundations of computing. Equational Logic as a Programming Language. AKM series in theoretical computer science. Algebraic Approaches to Program Semantics. subsumption) non-conjunctive concepts C which system-subsume A, do not. Our logical formalism is entirely compositional and it subsumes the non-compositional formalism of safety games on finite graphs. Springer Lecture Notes in Computer Science, vol. of deriving those logical consequences suitable for natural language presentation. to take up into a more inclusive classification. to bring (a case, instance, etc.) under a rule. to consider or include (an idea, term, proposition, etc.) as part of a more comprehensive one. verb (used with object), subsumed, subsuming. In Proceedings of the fifth international conference on Mathematical Foundations of Programming Semantics (Tulane Univ., New Orleans, LA, Mar. See synonyms for: subsume / subsumed on. Semantic models for total correctness and fairness. Springer Lecture Notes in Computer Science Springer-Verlag, New York, 244-259. In Proceedings of the lOth International Workshop on Computer Science Logic (CSL '96, Utrecht, The Netherlands, Sept.), D. Other- wise some current or future SRL approaches will. Kleene algebra with tests: Completeness and decidability. The framework must subsume both first-order logic and probabilistic graphical models. A completeness theorem for Kleene algebras and the algebra of regular events. Princeton University Press, Princeton, NJ, 3-41. Representation of events in nerve nets and finite automata. A semiring on convex polygons and zero-sum cycle problems. An axiomatic basis for computer programming. The propositional logic of deterministic, well-structured programs. Algebraic Semantics of Imperative Programs. Propositional dynamic logic of regular programs. In Handbook of Theoretical Computer Science, Vol. Soundness and completeness of an axiom system for program verification. Department of Computer Science, Cornell University, Ithaca, NY. The complexity of Kleene algebra with tests. Effective axiomatizations of Hoare logics. In Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics (MFPS '92), Springer Lecture Notes in Computer Science, vol. ![]() Program correctness and matricial iteration theories.
0 Comments
Leave a Reply. |