Vai al contenuto principale della pagina
Titolo: | 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 |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Edizione: | 1st ed. 2006. |
Descrizione fisica: | 1 online resource (VIII, 262 p.) |
Disciplina: | 004.0151 |
Soggetto topico: | 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 Intelligence | |
Persona (resp. second.): | MacCaullWendy |
WinterMichael (Professor) | |
DüntschIvo | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | Invited 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. |
Titolo autorizzato: | Relational Methods in Computer Science |
ISBN: | 3-540-33340-1 |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996466114903316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |