My Account Log in

1 option

Relational Methods in Computer Science : 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.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
MacCaull, Wendy, editor.
Winter, Michael (Professor), editor.
Düntsch, Ivo, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3929.
Theoretical Computer Science and General Issues ; 3929
Language:
English
Subjects (All):
Computers.
Logic, Symbolic and mathematical.
Software engineering.
Computer logic.
Computer science--Mathematics.
Computer science.
Artificial intelligence.
Theory of Computation.
Mathematical Logic and Formal Languages.
Software Engineering.
Logics and Meanings of Programs.
Symbolic and Algebraic Manipulation.
Artificial Intelligence.
Local Subjects:
Theory of Computation.
Mathematical Logic and Formal Languages.
Software Engineering.
Logics and Meanings of Programs.
Symbolic and Algebraic Manipulation.
Artificial Intelligence.
Physical Description:
1 online resource (VIII, 262 pages).
Edition:
First edition 2006.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
System Details:
text file PDF
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-33340-1
9783540333401
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account