الصفحة 1
الصفحة 1
Foundations of software science and computation structures ; Vol. 3921 ; 9th International conference, FOSSACS 2006, Held as part of the joint European conferences on theory and practice of software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, proceedings
This book constitutes the refereed proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2006, held in Vienna, Austria in March 2006 as part of ETAPS. The 28 revised full papers presented together with 1 invited paper were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections on mobile processes, software science, distributed computation, categorical models, real time and hybrid systems, process calculi, automata and logic, domains, lambda calculus, types, and security.
Foundations of software science and computation structures ; 21st International conference, FOSSACS 2018, Held as part of the European joint conferences on theory and practice of software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. proceedings
Contains the papers presented at the 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2018), which was held April 16–19, 2018, in Thessaloniki, Greece. The conference is dedicated to foundational research with a clear significance for software science and brings together research on theories and methods to support the analysis, integration, synthesis,transformation, and verification of programs and software systems.
Finite model theory and its applications
This book gives a broad overview of core topics of finite model theory: expressive power, descriptive complexity, and zero-one laws, together with selected applications to database theory and artificial intelligence, especially, constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, which emphasizes the continuity in spirit and technique with finite model theory. This underlying spirit involves the use of various fragments of, and hierarchies within, first order, second order, fixed point, and infinitary logics to gain insight into phenomena in complexity theory and combinatorics.
Diagrammatic Representation and Inference ; 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020, Proceedings
This book constitutes the refereed proceedings of the 11th International Conference on the Theory and Application of Diagrams, Diagrams 2020, held in Tallinn, Estonia, in August 2020.* The 20 full papers and 16 short papers presented together with 18 posters were carefully reviewed and selected from 82 submissions. The papers are organized in the following topical sections: diagrams in mathematics; diagram design, principles, and classification; reasoning with diagrams; Euler and Venn diagrams; empirical studies and cognition; logic and diagrams; and posters.
Logic, Language, and Computation ; 6th International Tbilisi Symposium on Logic, Language, and Computation. Batumi, Georgia, September 12-16, 2005, Revised Selected Papers
Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the second volume of the FoLLI LNAI subline. It represents the thoroughly refereed post-proceedings of the 6th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2005, held in Batumi, Georgia, in September 2005.
Automated Reasoning with Analytic Tableaux and Related Methods ; 16th International Conference, TABLEAUX 2007, Aix en Provence, France, July 3-6, 2007, Proceedings
It covers the wide range of logics, from intuitionistic and substructural logics to modal logics (including temporal and dynamic logics), from many-valued logics to nonmonotonic logics, and from classical first-order logic to description logics.
Algebraic informatics ; 2nd International conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers
It covers algebraic semantics on graphs and trees, formal power series, syntactic objects, algebraic picture processing, infinite computation, acceptors and transducers for strings, trees, graphs, arrays, etc., and decision problems.
Algebra and Coalgebra in Computer Science; First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005, Proceedings
CALCO, the Conference on Algebra and Coal-gebra in Computer Science, was created to bring together researchers and practitio-ners to exchange new results related to foundational aspects, and both traditional and emerging uses of algebras and coalgebras in computer science. CALCO 2005 was the first instance of this new conference. The interest that it generated in the scientific community suggests that it will not be the last. Indeed, it attracted as many as 62 submissions covering a wide range of topics roughly divided into two areas: Algebras and Coalgebras as Mathematical Objects: Automata and languages; categorical semantics; hybrid, probabilistic, and timed systems; inductive and coin-ductive methods; modal logics; relational systems and term rewriting.
25 Years of Model Checking : History, Achievements, Perspectives
Model checking technology is among the foremost applications of logic to computer science and computer engineering. The model checking community has achieved many breakthroughs, bridging the gap between theoretical computer science and hardware and software engineering, and it is reaching out to new challenging areas such as system biology and hybrid systems. Model checking is extensively used in the hardware industry and has also been applied to the verification of many types of software. Model checking has been introduced into computer science and electrical engineering curricula at universities worldwide and has become a universal tool for the analysis of systems.
