Relational and algebraic methods in computer science : 13th International Conference, RAMiCS 2012, Cambridge, UK, September 17-20, 2012. Proceedings / Wolfram Kahl, Timothy G. Griffin (eds.).
Contributor(s): Kahl, W. (Wolfram) | Griffin, Timothy GMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 7560.; LNCS sublibrary: Publisher: Berlin ; New York : Springer, ©2012Description: 1 online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642333149; 3642333141; 3642333133; 9783642333132Other title: RAMiCS 2012Subject(s): Computer science -- Mathematics -- Congresses | Informatique | Computer science -- Mathematics | Computer science | Software engineering | Logic design | Computational complexity | Artificial intelligence | Mathematical Logic and Formal Languages | Symbolic and Algebraic Manipulation | Logics and Meanings of Programs | Discrete Mathematics in Computer ScienceGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Printed edition:: No titleDDC classification: 004.01/51 LOC classification: QA76.9.M35 | R36 2012Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Transitive Separation Logic / Han-Hing Dang and Bernhard Möller -- Unifying Lazy and Strict Computations / Walter Guttmann -- Foundations of Coloring Algebra with Consequences for Feature-Oriented Programming / Peter Höfner, Bernhard Möller and Andreas Zelend -- Towards an Algebra for Real-Time Programs / Brijesh Dongol, Ian J. Hayes, Larissa Meinicke and Kim Solin -- Automated Reasoning in Higher-Order Regular Algebra / Alasdair Armstrong and Georg Struth -- Towards Certifiable Implementation of Graph Transformation via Relation Categories / Wolfram Kahl -- Deciding Regular Expressions (In- )Equivalence in Coq / Nelma Moreira, David Pereira and Simão Melo de Sousa -- Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures / Rudolf Berghammer and Sebastian Fischer -- Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings / Nikita Danilenko -- Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants / Nuno Macedo, Hugo Pacheco and Alcino Cunha -- Left-Handed Completeness / Dexter Kozen and Alexandra Silva -- On Completeness of Omega-Regular Algebras / Michael R. Laurence and Georg Struth -- Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings / Peter Jipsen -- Relational Representation Theorem for Powerset Quantales / Koki Nishizawa and Hitoshi Furusawa -- Point Axioms in Dedekind Categories / Hitoshi Furusawa and Yasuo Kawahara -- Two Observations in Dioid Based Model Refinement / Roland Glück -- Relation Algebras, Matrices, and Multi-valued Decision Diagrams / Francis Atampore and Michael Winter -- Incremental Pseudo Rectangular Organization of Information Relative to a Domain / Sahar Ismail and Ali Jaoua -- Relational Concepts in Social Choice / Gunther Schmidt -- An Algebra of Layered Complex Preferences / Bernhard Möller and Patrick Roocks -- Continuous Relations and Richardson's Theorem / Hitoshi Furusawa, Toshikazu Ishida and Yasuo Kawahara -- Relations on Hypergraphs / John G. Stell -- Extension Properties of Boolean Contact Algebras / Ivo Düntsch and Sanjiang Li.
Includes bibliographical references and author index.
This book constitutes the thoroughly refereed post-conference proceedings of the 13th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 13, held in Cambridge, UK, in September 2012. The 23 revised full papers presented were carefully selected from 39 submissions in the general area of relational and algebraic methods in computer science, adding special focus on formal methods for software engineering, logics of programs and links with neighboring disciplines. The papers are structured in specific fields on applications to software specification and correctness, mechanized reasoning in relational algebras, algebraic program derivation, theoretical foundations, relations and algorithms, and properties of specialized relations.