Relational Methods in Computer Science [electronic resource] : 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra, Workshop of COST Action 274: TARSKI, St. Catharines, ON, Canada, February 22-26, 2005, Selected Revised Papers / edited by Wendy MacCaull, Michael Winter, Ivo Düntsch.
Contributor(s): MacCaull, Wendy [editor.] | Winter, Michael [editor.] | Düntsch, Ivo [editor.] | SpringerLink (Online service).
Material type: BookSeries: Theoretical Computer Science and General Issues: 3929Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006Edition: 1st ed. 2006.Description: VIII, 262 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540333401.Subject(s): Computer science | Machine theory | Software engineering | Computer science -- Mathematics | Artificial intelligence | Theory of Computation | Formal Languages and Automata Theory | Software Engineering | Computer Science Logic and Foundations of Programming | Symbolic and Algebraic Manipulation | Artificial IntelligenceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access onlineInvited Papers -- Topological Representation of Precontact Algebras -- Relational Semantics Through Duality -- Duality Theory for Projective Algebras -- Contributed Papers -- Relational Approach to Boolean Logic Problems -- Static Analysis of Programs Using Omega Algebra with Tests -- Weak Contact Structures -- On Relational Cycles -- A Framework for Kleene Algebra with an Embedded Structure -- Non-termination in Unifying Theories of Programming -- Towards an Algebra of Hybrid Systems -- Relational Correspondences for Lattices with Operators -- Control-Flow Semantics for Assembly-Level Data-Flow Graphs -- Relational Implementation of Simple Parallel Evolutionary Algorithms -- Lattice-Based Paraconsistent Logic -- Verification of Pushdown Systems Using Omega Algebra with Domain -- wp Is wlp -- Relational Representability for Algebras of Substructural Logics -- Knuth-Bendix Completion as a Data Structure -- Quantifier Elimination in Elementary Set Theory -- Time-Dependent Contact Structures in Goguen Categories.
There are no comments for this item.