الصفحة 5
الصفحة 5
Concurrency Theory : Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Concurrency Theory is a synthesis of one of the major threads of theoretical computer science research focusing on languages and graphical notations for describing collections of simultaneously evolving components that interact through synchronous communication. The main specification notation focused on in this book is LOTOS. An extensive introduction to this particular process calculus is given, highlighting how the approach differs from competitor techniques, such as CCS and CSP.
CONCUR 2008 - Concurrency Theory ; 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings
This book constitutes the refereed proceedings of the 19th International Conference on Concurrency Theory, CONCUR 2008, held in Toronto, Canada, August 19-22, 2008.
CONCUR 2007 – Concurrency Theory ; 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings
This book includes model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages.
CONCUR 2006 - Concurrency Theory ; 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006
This volume contains the proceedings of the 17th International Conference on Concurrency Theory (CONCUR) held in Bonn, Germany, August 27–30, 2006. The scope of CONCUR covers all areas of semantics, logics, and verification techniques for concurrent systems.
Computing and Combinatorics ; Vol. 4112 ; 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings
The papers are organized in topical sections on computational economics, finance, and management, graph algorithms, computational complexity and computability, quantum computing, computational biology and medicine, computational geometry, graph theory, and more.
Computing and Combinatorics ; 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings
The Book covers most aspects of theoretical computer scienceand combinatorics related to computing.It exploring research, development, and novel applications of computing and combinatorics.
Computer Viruses : from theory to applications
The purpose of this book is to propose a teaching approach to under- 1 stand what computer viruses really are and how they work. To do this, three aspects are covered ranging from theoretical fundamentals, to pr- tical applications and technical features; fully detailed, commented source 1 We will systematically use the plural form “viruses” instead of the litteral one “virii”. The latter is now an obsolete, though gramatically recommended, form. VIII Preface codes of viruses as well as inherent applications are proposed. So far, the applications-oriented aspects have hardly ever been addressed through the scarce existing literature devoted to computer viruses.
Computer science logic ; Vol. 4207 ; 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings
Coverage includes automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and formal logics, modal and temporal logic, model checking, finite model theory, and more.
Computer Science : Theory and Applications ; 2nd International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings
This book covers theory track deals with algorithms, protocols, and data structures; complexity and cryptography; formal languages, automata and their applications to computer science; computational models and concepts; proof theory; and applications of logic to computer science. Many applications are presented.
Computer science : Theory and applications ; 1st International symposium on computer science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings
This book constitutes the refereed proceedings of the First International Symposium on Computer Science in Russia, CSR 2006. The 35 revised full theory papers and 29 revised application papers together with 3 invited talks address all major areas in computer science are addressed.
Computer science : Theory and applications ; 15th International computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings
This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data.
Computer Algebra in Scientific Computing ; Vol. 4194 ; 9th International Workshop, CASC 2006, Chisinau, Moldova, September 11-15, 2006, Proceedings
This volume contains revised versions of the papers submitted to the workshop by the participants and accepted by the program committee after a thorough reviewing process. The collection of papers included in the proceedings covers not only various expanding applications of computer algebra to scienti?c computing but also the computer algebra systems themselves and the CA algorithms.
Computer Algebra in Scientific Computing ; 10th International Workshop, CASC 2007, Bonn, Germany, September 16-20, 2007, Proceedings
The book covers not only various expanding applications of computer algebra to scientific computing but also the computer algebra systems themselves and the CA algorithms. Topics addressed are studies in polynomial and matrix algebra, quantifier elimination, and Gröbner bases, as well as stability investigation of both differential equations and difference methods for them. Several papers are devoted to the application of computer algebra methods and algorithms to the derivation of new mathematical models in biology and in mathematical physics.
Computer Aided Verification ; Vol. 4144 ; 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings
Presents 35 revised full papers together with 10 tool papers and 4 invited papers adressing all current issues in computer aided verification and model checking - from foundational and methodological issues ranging to the evaluation of major tools and systems.
Computer Aided Verification ; Vol. 3576 ; 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings
This volume contains the proceedings of the International Conference on Computer Aided Veri?cation (CAV), held in Edinburgh, Scotland, 2005. CAV 2005 was the seventeenth in a series of conferences dedicated to the advancement of the theory and practice of computer-assisted formal an- ysis methods for software and hardware systems. The conference covered the spectrum from theoretical results to concrete applications, with an emphasis on practical veri?cation tools and the algorithms and techniques that are needed for their implementation.
Computer Aided Verification ; 33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part I
This two-volume set LNCS 12759 and 12760 constitutes the refereed proceedings of the 33rd International Conference on Computer Aided Verification, CAV 2021, held virtually in July 2021. The 63 full papers presented together with 16 tool papers and 5 invited papers were carefully reviewed and selected from 290 submissions. The papers were organized in the following topical sections: Part I: invited papers; AI verification; concurrency and blockchain; hybrid and cyber-physical systems; security; and synthesis. Part II: complexity and termination; decision procedures and solvers; hardware and model checking; logical foundations; and software verification.
Computer Aided Verification ; 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21–24, 2020, Proceedings, Part II
The two-volume set LNCS 12224 and 12225 constitutes the refereed proceedings of the 32st International Conference on Computer Aided Verification, CAV 2020, held in Los Angeles, CA, USA, in July 2020.*
Computer Aided Verification ; 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I
This volume presented automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems.
Computer Aided Verification ; 20th International Conference, CAV 2008 Princeton, NJ, USA, July 7-14, 2008 Proceedings
This book constitutes the refereed proceedings of the 20th International Conference on Computer Aided Verification, CAV 2008, held in Princeton, NJ, USA, in July 2008.
Computer Aided Verification ; 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings
This volume contains advancement of the theory and practice of computer-assisted formal analysis methods for software and hardware systems. covers the spectrum from theoretical - sults to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation.
