Search Results

ENGLISH

Formal Methods For Software Engineering - Languages, Methods, Application Domains

by Antonio Cerone, Bernd-Holger Schlingloff, Gerardo Schneider, Markus Roggenbach e Siraj Ahmed Shaikh

72,86€ + 10% CARD

 Software programs are formal entities with precise meanings independent of their programmers, so the transition from ideas to programs necessarily involves a formalisation at some point.The first part of this graduate-level introduction to formal methods develops an understanding of what constitutes formal methods and what their place is in Software Engineering. It also introduces logics as languages to describe reasoning and the process algebra CSP as a language to represent behaviours. The second part offers specification and testing methods for formal development of software, based on the modelling languages CASL and UML. The third part takes the reader into the application domains of normative documents, human machine interfaces, and security. Use of notations and formalisms is uniform throughout the book.Topics and features:<ul> <li>Explains foundations, and introduces specification, verification, and testing methods</li> <li>Exploresvarious application domains</li> <li>Presents realistic and practical examples, illustrating concepts</li> Brings together contributions from highly experienced educators and researchers <li>Offers modelling and analysis methods for formal development of software</li> </ul> Suitable for graduate and undergraduate courses in software engineering, this uniquely practical textbook will also be of value to students in informatics, as well as to scientists and practical engineers, who want to learn about or work more effectively with formal theories and methods.Markus Roggenbach is a Professor in the Dept. of Computer Science of Swansea University. Antonio Cerone is an Associate Professor in the Dept. of Computer Science of Nazarbayev University, Nur-Sultan. Bernd-Holger Schlingloff is a Professor in the Institut für Informatik of Humboldt-Universität zu Berlin. Gerardo Schneider is a Professor in the Dept. of Computer Science and Engineering of University of Gothenburg. Siraj Ahmed Shaikh is a Professor in the Institute for Future Transport and Cities of Coventry University.The companion site for the book offers additional resources, including further material for selected chapters, prepared lab classes, a list of errata, slides and teaching material, and virtual machines with preinstalled tools and resources for hands-on experience with examples from the book. The URL is: https://sefm-book.github.io
ENGLISH

Decision Procedures - An Algorithmic Point Of View

by Daniel Kroening e Ofer Strichman

74,34€ + 10% CARD

free shipping

 The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework.
ENGLISH

Decision Procedures - An Algorithmic Point Of View

by Daniel Kroening e Ofer Strichman

72,86€ + 10% CARD

 The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework.
ENGLISH

Introduction To Online Computation - Determinism, Randomization, Advice

by Dennis Komm

79,49€ + 10% CARD

 This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs. This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity.
ENGLISH

Extremal Combinatorics - With Applications In Computer Science

by Stasys Jukna

82,14€ + 10% CARD

 Extremal Combinatorics provides a concise, up-to-date introduction to extremal combinatorics for nonspecialists. The text emphasizes theorems with particularly elegant and informative proofs, and presents a wide range of combinatorial tools.
ENGLISH

Elements Of Finite Model Theory

by Leonid Libkin

116,60€ + 10% CARD

 Provides an introduction to finite model theory which stresses the computer science origins of the area. This book deals with the applications in databases, complexity theory, and formal languages, as well as other branches of computer science. It covers Ehrenfeucht-Fraisse games, locality-based techniques, and the complexity analysis of logics.
ENGLISH

Interactive Theorem Proving And Program Development - Coq’Art: The Calculus Of Inductive Constructions

by Pierre Casteran e Yves Bertot

98,71€ + 10% CARD

 Coq is an interactive proof assistant for the development of mathematical theories and formally certified software. This book provides a pragmatic introduction to the development of proofs and certified programs using Coq. It includes a collection of examples and exercises.
ENGLISH

Extremal Combinatorics - With Applications In Computer Science

by Stasys Jukna

83,81€ + 10% CARD

free shipping

 Extremal Combinatorics provides a concise, up-to-date introduction to extremal combinatorics for nonspecialists. The text emphasizes theorems with particularly elegant and informative proofs, and presents a wide range of combinatorial tools.
ENGLISH

Decision Procedures - An Algorithmic Point Of View

by Daniel Kroening e Ofer Strichman

94,62€ + 10% CARD

free shipping

 The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework.
ENGLISH

Parameterized Complexity Theory

by J. Flum e M. Grohe

98,71€ + 10% CARD

 Parameterized complexity theory is a branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. This book presents an introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes.
ENGLISH

Elements Of Finite Model Theory

by Leonid Libkin

118,97€ + 10% CARD

free shipping

 Finite model theory is an area of mathematical logic that grew out of computer science applications. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable;
ENGLISH

Formal Methods For Software Engineering - Languages, Methods, Application Domains

by Antonio Cerone, Bernd-Holger Schlingloff, Gerardo Schneider, Markus Roggenbach e Siraj Ahmed Shaikh

74,34€ + 10% CARD

free shipping
ENGLISH

Formal Methods For Software Engineering - Languages, Methods, Application Domains

by Antonio Cerone, Bernd-Holger Schlingloff, Gerardo Schneider, Markus Roggenbach e Siraj Ahmed Shaikh

94,62€ + 10% CARD

free shipping
ENGLISH

Simulation Algorithms For Computational Systems Biology

by Corrado Priami, Luca Marchetti e Vo Hong Thanh

62,18€

free shipping

OUT OF STOCK OR NOT AVAILABLE

 Starting from basic simulation algorithms, the book also introduces more advanced techniques that support delays, diffusion in space, or that are based on hybrid simulation strategies.This is a valuable self-contained resource for graduate students and practitioners in computer science, biology and bioinformatics.
Introduction To Concurrency Theory - Transition Systems And Ccs

by Cristian Versari e Roberto Gorrieri

60,82€

free shipping

OUT OF STOCK OR NOT AVAILABLE
ENGLISH

Simulation Algorithms For Computational Systems Biology

by Corrado Priami, Luca Marchetti e Vo Hong Thanh

62,18€

free shipping

OUT OF STOCK OR NOT AVAILABLE

 Starting from basic simulation algorithms, the book also introduces more advanced techniques that support delays, diffusion in space, or that are based on hybrid simulation strategies.This is a valuable self-contained resource for graduate students and practitioners in computer science, biology and bioinformatics.
An Introduction To Online Computation - Determinism, Randomization, Advice

by Dennis Komm

121,66€

free shipping

OUT OF STOCK OR NOT AVAILABLE
ENGLISH

Universal Artificial Intelligence - Sequential Decisions Based On Algorithmic Probability

by Marcus Hutter

105,34€ + 10% CARD

 Personal motivation. The dream of creating artificial devices that reach or outperform human inteUigence is an old one. It is also one of the dreams of my youth, which have never left me. What makes this challenge so interesting? A solution would have enormous implications on our society, and there are reasons to believe that the AI problem can be solved in my expected lifetime. So, it's worth sticking to it for a lifetime, even if it takes 30 years or so to reap the benefits. The AI problem. The science of artificial intelligence (AI) may be defined as the construction of intelligent systems and their analysis. A natural definition of a system is anything that has an input and an output stream. Intelligence is more complicated. It can have many faces like creativity, solving prob lems, pattern recognition, classification, learning, induction, deduction, build ing analogies, optimization, surviving in an environment, language processing, and knowledge. A formal definition incorporating every aspect of intelligence, however, seems difficult. Most, if not all known facets of intelligence can be formulated as goal driven or, more precisely, as maximizing some utility func tion. It is, therefore, sufficient to study goal-driven AI; e. g. the (biological) goal of animals and humans is to survive and spread. The goal of AI systems should be to be useful to humans.

DIDN'T FIND WHAT YOU'RE LOOKING FOR?

Browse by the menu categories.

Check the search criteria in help .

Finally, if needed, use the we'll search for you .