and Abstract Interpretation

This book constitutes the refereed proceedings of the 20th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2019, held in Cascais, Portugal, in January

This book constitutes the refereed proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2013, held in Rome, Italy, in January 2013, co-l

The book constitutes the refereed proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2009, held in Savannah, GA, USA, in January 2009

This book constitutes the refereed proceedings of the 15th International Conference on Verification, Model Checking and Abstract Interpretation, VMCAI 2014, held in San Diego, CA, USA, in January 2013

The existing literature currently available to students and researchers is very general, covering only the formal techniques of static analysis.This book presents real examples of the formal technique

Some believe that there is a God who is the source of all things; and some believe that there are necessarily existing abstract objects. But can one believe both these things? That is the question of this Element. First, Einar Duenger Bøhn clarifies the concepts involved, and the problem that arises from believing in both God and abstract objects. Second, he presents and discusses the possible kinds of solutions to that problem. Third, Bøhn discusses a new kind of solution to the problem, according to which reality is most fundamentally made of information.

Abstract painting and abstraction can be a daunting and frustrating genre of art. How should you approach a surface? How can you use color effectively? How can you make better, more expressive paintin

Art and Abstract Objects presents a lively philosophical exchange between the philosophy of art and the core areas of philosophy. The standard way of thinking about non-repeatable (single-instance) ar

This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open pr

A Discovery-Based Approach to Learning about Algebraic StructuresAbstract Algebra: Structures and Applications helps students understand the abstraction of modern algebra. It emphasizes the more gener