This book constitutes the refereed proceedings of the 8th International Conference on Concurrency Theory, CONCUR'97. held in Warsaw, Poland, in July 1997. The 24 revised full papers presented were selected by the program committee for inclusion in the volume from a total of 41 high-quality submissions. The volume covers all current topics in the science of concurrency theory and its applications, such as reactive systems, hybrid systems, model checking, partial orders, state charts, program logic calculi, infinite state systems, verification, and others.
Object-based Distributed Computing is being established as the most pertinent basis for the support of large, heterogeneous computing and telecommunications systems. The advent of Open Object-based Distributed Systems (OODS) brings new challenges and opportunities for the use and development of formal methods. Formal Methods for Open Object-based Distributed Systems presents the latest research in several related fields, and the exchange of ideas and experiences in a number of topics including: formal models for object-based distributed computing; semantics of object-based distributed systems and programming languages; formal techniques in object-based and object oriented specification, analysis and design; refinement and transformation of specifications; multiple viewpoint modeling and consistency between different models; formal techniques in distributed systems verification and testing; types, service types and subtyping; specification, verification and testing of quality of service constraints and formal methods and the object life cycle. It contains the selected proceedings of the International Workshop on Formal Methods for Open Object-based Distributed Systems, sponsored by the International Federation for Information Processing, and based in Paris, France, in March 1996.
Recent developments in computer science clearly show the need for a better theoretical foundation for some central issues. Methods and results from mathematical logic, in particular proof theory and model theory, are of great help here and will be used much more in future than previously. This book provides an excellent introduction to the interplay of mathematical logic and computer science. It contains extensively reworked versions of the lectures given at the 1997 Marktoberdorf Summer School by leading researchers in the field. Topics covered include: proof theory and specification of computation (J.-Y. Girard, D. Miller), complexity of proofs and programs (S. R. Buss, S. S. Wainer), computational content of proofs (H. Schwichtenberg), constructive type theory (P. Aczel, H. Barendregt, R. L. Constable), computational mathematics, (U. Martin), rewriting logic (J. Meseguer), and game semantics (S. Abramski).
This book constitutes the refereed proceedings of the 10th International Conference on Algebraic Methodology and Software Technology, AMAST 2004, held in Stirling, Scotland, UK in July 2004. The 35 revised full papers presented together with abstracts of 5 invited talks and an invited paper were carefully reviewed and selected from 63 submissions. Among the topics covered are all current issues in formal methods related to algebraic approaches to software engineering including abstract data types, process algebras, algebraic specification, model checking, abstraction, refinement, model checking, state machines, rewriting, Kleene algebra, programming logic, etc.
This volume constitutes the proceedings of the 2nd International Joint C- ference on Automated Reasoning (IJCAR 2004) held July 4–8, 2004 in Cork, Ireland. IJCAR 2004 continued the tradition established at the ?rst IJCAR in Siena,Italyin2001,whichbroughttogetherdi?erentresearchcommunitieswo- ing in automated reasoning. The current IJCAR is the fusion of the following conferences: CADE: The International Conference on Automated Deduction, CALCULEMUS: Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, FroCoS: Workshop on Frontiers of Combining Systems, FTP: The International Workshop on First-Order Theorem Proving, and TABLEAUX: The International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. There were 74 research papers submitted to IJCAR as well as 12 system descriptions. After extensive reviewing, 26 research papers and 6 system - scriptions were accepted for presentation at the conference and publication in this volume. In addition, this volume also contains papers from the three invited speakers and a description of the CADE ATP system competition. We would like to acknowledge the enormous amount of work put in by the members of the program committee, the various organizing and steering c- mittees, the IJCAR o?cials, the invited speakers, and the additional referees named on the following pages. We would also like to thank Achim Brucker and Barbara Geiser for their help in producing this volume.
Maude is a language and system based on rewriting logic. In this comprehensive account, you’ll discover how Maude and its formal tool environment can be used in three mutually reinforcing ways: as a declarative programming language, as an executable formal specification language, and as a formal verification system. Examples used throughout the book illustrate key concepts, features, and the many practical uses of Maude.
This book discusses issues concerning functional programming, logic programming, and integration of the two. The topics include language design, formal semantics, type theory, compilation techniques, program transformation, programming methods, integration of programming paradigms, constraint solving, and distributed computation.
It is with great pleasure that we are presenting to the community the second edition of this extraordinary handbook. It has been over 15 years since the publication of the first edition and there have been great changes in the landscape of philosophical logic since then. The first edition has proved invaluable to generations of students and researchers in formal philosophy and language, as well as to consumers of logic in many applied areas. The main logic article in the Encyclopaedia Britannica 1999 has described the first edition as 'the best starting point for exploring any of the topics in logic'. We are confident that the second edition will prove to be just as good! The first edition was the second handbook published for the logic com- nity. It followed the North Holland one volume Handbook of Mathematical Logic, published in 1977, edited by the late Jon Barwise. The four volume Handbook of Philosophical Logic, published 1983-1989 came at a fortunate temporal junction at the evolution of logic. This was the time when logic was gaining ground in computer science and artificial intelligence circles. These areas were under increasing commercial pressure to provide devices which help and/or replace the human in his daily activity. This pressure required the use of logic in the modelling of human activity and organi- tion on the one hand and to provide the theoretical basis for the computer program constructs on the other.
