You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This thesis presents a completely automatic verification framework to check safety properties of parameterized systems. A parameterized system is a family of finite state systems where every system consists of a finite number of processes running in parallel the same algorithm. All the systems in the family differ only in the number of the processes and, in general, the number of systems in a family may be unbounded. Examples of parameterized systems are communication protocols, mutual exclusion protocols, cache coherence protocols, distributed algorithms etc. Model-checking of finite state systems is a well-developed formal verification approach of proving properties of systems in an automa...
This book constitutes the thoroughly refereed postconference proceedings of the 5th International Andrei Ershov Memorial Conference, PSI 2003, held in Akademgorodok, Novosibirsk, Russia in July 2003. The 55 revised full papers presented were carefully reviewed and selected from 110 submissions during two rounds of evaluation and improvement. The papers are organized in topical sections on programming, software engineering, software education, program synthesis and transformation, graphical interfaces, partial evaluation and supercompilation, verification, logic and types, concurrent and distributed systems, reactive systems, program specification, verification and model checking, constraint programming, documentation and testing, databases, and natural language processing.
While the classic model checking problem is to decide whether a finite system satisfies a specification, the goal of parameterized model checking is to decide, given finite systems (n) parameterized by n ∈ N, whether, for all n ∈ N, the system (n) satisfies a specification. In this book we consider the important case of (n) being a concurrent system, where the number of replicated processes depends on the parameter n but each process is independent of n. Examples are cache coherence protocols, networks of finite-state agents, and systems that solve mutual exclusion or scheduling problems. Further examples are abstractions of systems, where the processes of the original systems actually d...
This book constitutes the refereed proceedings of the 15th International Conference on Concurrency Theory, CONCUR 2004, held in London, UK in August/September 2004. The 29 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 134 submissions. Among the topics covered are concurrency related aspects of models of computation, semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model checking, verification techniques, refinement, term and graph rewriting, distributed programming, constraint logic programming, object-oriented programming, typing systems and algorithms, case studies, tools, and environments for programming and verification.
Includes tutorials, invited lectures, and refereed papers on all aspects of logic programming including: Constraints, Concurrency and Parallelism, Deductive Databases, Implementations, Meta and Higher-order Programming, Theory, and Semantic Analysis. September 2-6, 1996, Bonn, Germany Every four years, the two major international scientific conferences on logic programming merge in one joint event. JICSLP'96 is the thirteenth in the two series of annual conferences sponsored by The Association for Logic Programming. It includes tutorials, invited lectures, and refereed papers on all aspects of logic programming including: Constraints, Concurrency and Parallelism, Deductive Databases, Implementations, Meta and Higher-order Programming, Theory, and Semantic Analysis. The contributors are international, with strong contingents from the United States, United Kingdom, France, and Japan. Logic Programming series, Research Reports and Notes
This book constitutes the refereed proceedings of the 17th European Symposium on Programming, ESOP 2008, held in Budapest, Hungary, in March/April 2008, as part of ETAPS 2008, the European Joint Conferences on Theory and Practice of Software. The 25 revised full papers presented together with the abstract of one invited talk and two tool presentations were carefully reviewed and selected from 104 submissions and address fundamental issues in the specification, analysis, and implementation of programming languages and sytems. The papers are organized in topical sections on static analysis, security, concurrency and program verification.
This book constitutes the refereed proceedings of workshops, held at the 31st International Conference on Conceptual Modeling, ER 2012, in Florence, Italy in October 2012. The 32 revised papers presented together with 6 demonstrations were carefully reviewed and selected from 84 submissions. The papers are organized in sections on the workshops CMS 2012, EDCM-NoCoDa, MODIC, MORE-BI, RIGIM, SeCoGIS and WISM. The workshops cover different conceptual modeling topics, from requirements, goal and service modeling, to evolution and change management, to non-conventional data access, and they span a wide range of domains including Web information systems, geographical information systems, business intelligence, data-intensive computing.
This book constitutes the refereed proceedings of the 5th International Symposium on Functional and Logic Programming, FLOPS 2001, held in Tokyo, Japan in March 2001. The 21 revised full papers presented together with three invited papers were carefully reviewed and selected from 40 submissions. The book offers topical sections on functional programming, logic programming, functional logic programming, types, program analysis and transformation, and Lambda calculus.
This book constitutes the refereed proceedings of the 4th International Conference on Frontiers of Combining Systems, FroCoS 2002, held in Santa Margherita Ligure, Italy, in April 2002. The 14 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 35 submissions. Among the topics covered are combination of logics, combination of constraint solving techniques, combination of decision procedures, combination problems in verification, modular problems of theorem proving, and the integration of decision procedures and other solving processes into constraint programming and deduction systems.