Listing 1 - 10 of 2320 | << page >> |
Sort by
|
Choose an application
Kompakt und leicht verständlich führt dieses Lehrbuch in die formalen Grundlagen der Programmierung ein. Von der Syntax über Semantik und Verifikation bis hin zur Brechenbarkeit werden alle relevanten Themen fundiert dargestellt. Der Inhalt Syntax von Programmiersprachen - Semantik von Programmiersprachen - Die Grenzen des Berechenbaren Die Zielgruppe Studierende der Informatik im Bachelor-Studiengang an Fachhochschulen und Universitäten Der Autor Prof. Dr. Markus Nebel lehrt und forscht an der TU Kaiserslautern. Die Reihe "Studienbücher Informatik" wird herausgegeben von Prof. Dr. Walter Hower.
Choose an application
This handbook explores the salient perspectives of dominant schools of logical thought in ancient, medieval, and early modern India, and the relationship between logic and other disciplines in India. It also discusses the contribution of Indian logicians to contemporary developments in mathematics and computer science. The study of Indian logic is important for many reasons. The fundamental themes of Indian logical traditions differ in important ways from those of Greek and later European traditions. These include the empirical nature of Indian logic, lack of clear demarcation between logic and epistemology, emphasis on invariable concomitance, description of logical processes as cognitive processes, a complex description of methods of debate that are essential to logical analysis, and the use of logic in fields ranging from linguistics, medicine and theology. This handbook therefore highlights the major developments in Indian logic through the centuries and points to future directions of development from these strands.
Logic. --- Philosophy, Asian. --- Computer logic. --- Non-Western Philosophy. --- Logics and Meanings of Programs.
Choose an application
A classic exposition of the branch of mathematical logic known as category theory, this text is suitable for advanced undergraduates and graduate students and accessible to both philosophically and mathematically oriented readers. Beginning with a survey of set theory and its role in mathematics, it proceeds to definitions and examples of categories and explains the use of arrows in the place of epsilon. Subsequent topics include topos logic, algebra of subobjects, instituionism and its logic, functors, set concepts and validity, and elementary truth. Explorations of categorial set theory, local truth, and adjointness and quantifiers conclude with a study of logical geometry. 1983 ed.
Choose an application
Testing is the primary hardware and software verification technique used by industry today. Usually, it is ad hoc, error prone, and very expensive. In recent years, however, many attempts have been made to develop more sophisticated formal testing methods. This coherent book provides an in-depth assessment of this emerging field, focusing on formal testing of reactive systems. This book is based on a seminar held in Dagstuhl Castle, Germany, in January 2004. It presents 19 carefully reviewed and revised lectures given at the seminar in a well-balanced way ensuring competent complementary coverage of all relevant aspects. An appendix provides a glossary for model-based testing and basics on finite state machines and on labelled transition systems. The lectures are presented in topical sections on testing of finite state machines, testing of labelled transition systems, model-based test case generation, tools and case studies, standardized test notation and execution architectures, and beyond testing.
Choose an application
Testing is the primary hardware and software verification technique used by industry today. Usually, it is ad hoc, error prone, and very expensive. In recent years, however, many attempts have been made to develop more sophisticated formal testing methods. This coherent book provides an in-depth assessment of this emerging field, focusing on formal testing of reactive systems. This book is based on a seminar held in Dagstuhl Castle, Germany, in January 2004. It presents 19 carefully reviewed and revised lectures given at the seminar in a well-balanced way ensuring competent complementary coverage of all relevant aspects. An appendix provides a glossary for model-based testing and basics on finite state machines and on labelled transition systems. The lectures are presented in topical sections on testing of finite state machines, testing of labelled transition systems, model-based test case generation, tools and case studies, standardized test notation and execution architectures, and beyond testing.
Choose an application
Software muss funktionieren, um von Kunden akzeptiert zu werden. Doch wie stellt man sicher, dass die Steuerung eines Raumschiffs, eines Herzschrittmachers oder einer Aktienverwaltung korrekt funktioniert? Neben den klassischen Testansätzen spielen für den Korrektheitsnachweis zunehmend formale Modelle eine zentrale Rolle. Ein Modell erlaubt es, ein beliebiges sequenzielles oder verteiltes System zu analysieren und zu simulieren. Dadurch, dass Korrektheitsanforderungen präzise definiert werden, kann man sogar verifizieren, dass die Anforderungen erfüllt sind. Dieses Buch stellt unterschiedliche formale Modelle mit ihren Einsatzmöglichkeiten und Werkzeugen vor. Dabei steht bewusst die Anwendung der Modelle und nicht die Theorie dahinter im Vordergrund. Der Inhalt: Motivation von formalen Modellen – Model Checking mit Promela und Spin – Timed Automata – Petrinetze – Semantik und Verifikation sequenzieller und paralleler Programme Die Zielgruppe: - Informatik-Studierende ab 4. Semester - Studierende in Informatik-orientierten Master-Studiengängen - Entwickler kritischer Software-Systeme - An Qualitätssicherung Interessierte Der Autor: Prof. Dr. Stephan Kleuker hat im Themengebiet "formale Methoden" promoviert und lehrt seit mehreren Jahren Software-Engineering an den Fachhochschulen in Osnabrück und Wiesbaden. Er hat mehrjährige Praxiserfahrung als Systemanalytiker sowie als Berater bei der Erstellung komplexer Software-Systeme.
Choose an application
Die eher abstrakten Inhalte der Theoretischen Informatik werden aus praktischen Anwendungsbeispielen heraus motiviert, anschaulich vermittelt und in Übungen vertieft. Durch das gesamte Buch hindurch zieht sich das Vorhaben, einen Compiler für eine Sprache mit grafischen Effekten herzustellen. An den entsprechenden Stellen werden die dafür notwendigen Beiträge erarbeitet und Aspekte automatisierter Compilergenerierung thematisiert. Zur Modellierung formaler Sprachen, regulärer Ausdrücke, abstrakter Automaten und zur automatisierten Compilergenerierung aus einer grafisch-visuellen Beschreibung stellt AtoCC miteinander vernetzter Komponenten zur Verfügung. Die Lern- und Arbeitsumgebung AtoCC wurde speziell für das Studium der theoretischen Informatik entwickelt und bereits an mehreren Hochschulen und Schulen erfolgreich eingesetzt. AtoCC vertieft Theoriewissen durch praktische Übungen und attraktive Anwendungsprojekte aus dem Grafik- und Audiobereich. Übersetzung und Verarbeitung mehr oder weniger komplexer Sprachen finden wir heute beispielsweise auch in modernen Web-Applikationen.
Choose an application
Testing is the primary hardware and software verification technique used by industry today. Usually, it is ad hoc, error prone, and very expensive. In recent years, however, many attempts have been made to develop more sophisticated formal testing methods. This coherent book provides an in-depth assessment of this emerging field, focusing on formal testing of reactive systems. This book is based on a seminar held in Dagstuhl Castle, Germany, in January 2004. It presents 19 carefully reviewed and revised lectures given at the seminar in a well-balanced way ensuring competent complementary coverage of all relevant aspects. An appendix provides a glossary for model-based testing and basics on finite state machines and on labelled transition systems. The lectures are presented in topical sections on testing of finite state machines, testing of labelled transition systems, model-based test case generation, tools and case studies, standardized test notation and execution architectures, and beyond testing.
Choose an application
Programming --- 681.3*F3 --- Logics and meanings of programs (Theory of computation) --- Computer programming --- Congresses. --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- Logic design. --- Logics and Meanings of Programs. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory
Choose an application
Programming --- 681.3*A0 --- 681.3*D1 --- 681.3*F3 --- General --- Programming techniques--See also {681.3*E} --- Logics and meanings of programs (Theory of computation) --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- 681.3*D1 Programming techniques--See also {681.3*E} --- 681.3*A0 General --- Logic design. --- Computer science. --- Logics and Meanings of Programs. --- Programming Techniques. --- Informatics --- Science --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory
Listing 1 - 10 of 2320 | << page >> |
Sort by
|