الصفحة 1
الصفحة 1
Foundations of software science and computation structures ; 24th International conference, FOSSACS 2021, Held as Part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, proceedings
This book constitutes the proceedings of the 24th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2021, which was held during March 27 until April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic.
Foundations of software science and computation structures ; 23rd International conference, FOSSACS 2020, Held as part of the European joint conferences on theory and practice of software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, proceedings
This book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020.
Formal Modeling and Analysis of Timed Systems ; Vol.4202 ; 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings
The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from di?erent d- ciplines that share interests in modelling and analysis of timed systems. In this volume, there are articles on: – Foundations and Semantics: contributions to the theoretical foundations of timed systems and timed formal languages as well as comparison between di?erentmodelsusedbydi?erentcommunities(timedautomata,timedPetri nets, timed MSCs, hybrid automata, timed process algebra, timed temporal logics, timed abstract state machines, as well as probabilistic models). – Methods and Tools: techniques, algorithms, data structures, and software toolsforanalyzingtimedsystemsandresolvingtemporalconstraints(mod- checking, simulation, robustness analysis, scheduling, etc).
Computer science logic ; Vol. 4207 ; 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings
Coverage includes automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and formal logics, modal and temporal logic, model checking, finite model theory, and more.
Computer Aided Verification ; 33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part I
This two-volume set LNCS 12759 and 12760 constitutes the refereed proceedings of the 33rd International Conference on Computer Aided Verification, CAV 2021, held virtually in July 2021. The 63 full papers presented together with 16 tool papers and 5 invited papers were carefully reviewed and selected from 290 submissions. The papers were organized in the following topical sections: Part I: invited papers; AI verification; concurrency and blockchain; hybrid and cyber-physical systems; security; and synthesis. Part II: complexity and termination; decision procedures and solvers; hardware and model checking; logical foundations; and software verification.
Computer Aided Verification ; 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I
This volume presented automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems.
Logics in Artificial Intelligence ; 11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings
Constitutes the refereed proceedings of the 11th European Conference on Logics in Artificial Intelligence, JELIA 2008, held in Dresden, Germany, Liverpool, in September/October 2008.The 32 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 98 submissions. The papers cover a broad range of topics including belief revision, description logics, non-monotonic reasoning, multi-agent systems, probabilistic logic, and temporal logic.
Logic for Programming, Artificial Intelligence, and Reasoning ; 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings
This book constitutes the refereed proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2008, which took place in Doha, Qatar, during November 22-27, 2008.The 45 revised full papers presented together with 3 invited talks were carefully revised and selected from 153 submissions. The papers address all current issues in automated reasoning, computational logic, programming languages and their applications and are organized in topical sections on automata, linear arithmetic, verification knowledge representation, proof theory, quantified constraints, as well as modal and temporal logics.
Automated technology for verification and analysis ; 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings
This book constitutes the refereed proceedings of the 18th International Symposium on Automated Technology for Verification and Analysis, ATVA 2020, held in Hanoi, Vietnam, in October 2020. The 27 regular papers presented together with 5 tool papers and 2 invited papers were carefully reviewed and selected from 75 submissions.
Annotating, Extracting and Reasoning about Time and Events ; International Seminar, Dagstuhl Castle, Germany, April 20-15, 2005, Revised Papers
The book presented centers around an emergingde factost and ardfortime and event annotation: TimeML. TimeML has recently been adopted as a candidate for an ISO standard, and is currently being reviewed in this capacity.It discussions focussed on the following three Time- related issues: using the TimeML language efiectively for consistent annotation, determining how useful such annotation is for further processing,and describing modifications that should be applied to the standard for applications such as question-answering and information retrieval. Discussions at the Dagstuhl Seminar led to new researchideas, and a variety
Advances in verification of time Petri Nets and timed automata : A temporal logic approach
This monograph presents a comprehensive introduction to timed automata (TA) and time Petri nets (TPNs) which belong to the most widely used models of real-time systems. Some of the existing methods of translating time Petri nets to timed automata are presented, with a focus on the translations that correspond to the semantics of time Petri nets, associating clocks with various components of the nets. "Advances in Verification of Time Petri Nets and Timed Automata – A Temporal Logic Approach" introduces timed and untimed temporal specification languages and gives model abstraction methods based on state class approaches for TPNs and on partition refinement for TA. Moreover, the monograph presents a recent progress in the development of two model checking methods, based on either exploiting abstract state spaces or on application of SAT-based symbolic techniques.
Abstraction, refinement and proof for probabilistic systems
Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequential-program logic—but its extension to numeric rather than merely true-or-false judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almost-certain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and two-player games.
A Practical Theory of Reactive Systems : Incremental Modeling of Dynamic Behaviors
Presents a ""practical theory"" of reactive systems, with formal foundations in Temporal Logic of Actions. This book emphasises theoretical understanding of reactive behaviors and using ""horizontal"" modularity to manage their complexity. It illustrates the incremental specification by a number of examples of varying size and complexity
A Practical Introduction to PSL
Practical Introduction to PSL is primarily targeted to hardware designers and verification engineers who plan to use PSL. This book is also of interest to students of temporal logic. The formal semantics of PSL are included as an appendix, and bibliographical notes include pointers to some of the main theoretical works.
