Leonid Libkin

Erich Grädel

Scott Weinstein

Moshe Y. Vardi

Joel Spencer

Phokion G. Kolaitis

Maarten Marx

Yde Venema

Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our understanding of mathematical phenomena is enriched by elevating the languages we use to describe mathematical structures to objects of explicit study. If mathematics is the science of patterns, then the media through which we discern patterns, as well as the structures in which we discern them, command our attention. It isthis aspect oflogicwhichis mostprominentin model theory,“thebranchof mathematical logic which deals with the relation between a formal language and its interpretations”. No wonder, then, that mathematical logic, and ?nite model theory in particular, should ?nd manifold applications in computer science: from specifying programs to querying databases, computer science is rife with phenomena whose understanding requires close attention to the interaction between language and structure. This volume gives a broadoverviewof some central themes of ?nite model theory: expressive power, descriptive complexity, and zero–one laws, together with selected applications to database theory and arti?cial intelligence, es- cially constraint databases and constraint satisfaction problems. The ?nal chapter provides a concise modern introduction to modal logic,which emp- sizes the continuity in spirit and technique with ?nite model theory.

Finite Model Theory and Its Applications

Doron A. Peled

The IFIP TC6 WG 6.1 Joint International Conference on Formal Techniques for Networked and Distributed Systems, FORTE 2002, was held this year at Rice University, Houston, Texas, on November 11–14. This annual conference provides a forum for researchers and practitioners from universities and industry to meet and advance technologies in areas of speci?cation, testing, and veri?cation of distributed systems and communication protocols. The main topics are: – FDT-based system and protocol engineering. – Semantical foundations. – Extensions of FDTs. – Formal approaches to concurrent/distributed object-oriented systems. – Real-time and probability aspects. – Performance modeling and analysis. – Quality of service modeling and analysis. – Veri?cation and validation. – Relations between informal and formal speci?cation. – FDT-based protocol implementation. – Software tools and support environments. – FDT application to distributed systems. – Protocol testing, including conformance testing, interoperability testing, and performance testing. – Test generation, selection, and coverage. – Practical experience and case studies. – Corporate strategic and ?nancial consequences of using formal methods. A total of 61 papers were submitted to FORTE 2002, and reviewed by m- bers of the program committee and additional reviewers. The program committee selected 22 regular papers, two tool papers, and two posters for presentation at the conference. The program also included three tutorials and ?ve invited talks.

22nd IFIP WG 6.1 International Conference Houston, Texas, USA, November 11-14, 2002, Proceedings

Formal Techniques for Networked and Distributed Systems - FORTE 2002

Moshe Y. Vardi

About

Books

Join the club