الصفحة 1
الصفحة 1
Model Driven Engineering Languages and Systems ; 11th International Conference, MoDELS 2008, Toulouse, France, September 28 - October 3, 2008. Proceedings
The book also contains three keynote speeches and contributions to workshops, symposia, tutorials and panels at the conference. The papers are organized in topical sections on Model Transformation: Foundations; Requirements Modeling; Domain-Specific Modeling; Model Transformation: Techniques, Composition and Analysis of Behavioral Models; Model Comprehension; Model Management; Behavioral Conformance and Refinement; Metamodeling and Modularity; Constraints; Model Analysis; Service-Oriented Architectures; Adaptive and Autonomic Systems; Empirical Studies; Evolution and Reverse Engineering; Modeling Language Semantics; Dependability Analysis and Testing; Aspect-Oriented Modeling; Structural Modeling;and Embedded Systems.
Foundations of software science and computation structures ; 25th International conference, FOSSACS 2022, Held as Part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2–7, 2022, proceedings
This book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
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 Refinement for Operating System Kernels
The purpose of this book is to show that the formal specification of kernels can be followed by a completely formal refinement process that leads to the extraction of executable code. The formal refinement process ensures that the code meets the specification in a precise sense.
Formal Modeling and Analysis of Timed Systems ; 6th International Conference, FORMATS 2008, Saint Malo, France, September 15-17, 2008. Proceedings
This book constitutes the refereed proceedings of the 6th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2008, held in Saint Malo, France, September 2008.The 17 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 37 submissions. The papers are organized in topical sections on extensions of timed automata and semantics; timed games and logic; case studies; model-checking of probabilistic systems; verification and test; timed petri nets.
Formal Methods for Open Object-Based Distributed Systems ; 10th IFIP WG 6.1 International Conference, FMOODS 2008, Oslo, Norway, June 4-6, 2008 Proceedings
This book constitutes the refereed proceedings of the 10th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2008, held in Oslo, Norway, in June 2008.The 14 revised full papers presented together with 1 invited lecture were carefully reviewed and selected from 35 submissions. The papers cover topcics such as semantics of object-oriented programming; formal techniques for specification, analysis, and refinement; model checking; theorem proving and deductive verification.
FM 2006: Formal Methods ; 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings
This book presents the refereed proceedings of the 14th International Symposium on Formal Methods, FM 2006, held in Hamilton, Canada, August 2006. The book presents 36 revised full papers together with 2 invited contributions and extended abstracts of 7 invited industrial presentations, organized in topical sections on interactive verification, formal modelling of systems, real time, industrial experience, specification and refinement, programming languages, algebra, formal modelling of systems, and more.
Dataset Studio
Data is the new oil, which means that AI engineers can face difficulties in locating suitable datasets. Dataset Studio is a comprehensive platform designed to support AI engineers in the creation and optimization of datasets. This project offers a diverse range of services that encompass data collection, data augmentation, and data classification. As a result, this software empowers engineers by automatically generating structured data through the utilization of advanced tools and AI techniques. By automating the laborious tasks of manual data collection and extraction, Dataset Studio effectively streamlines the workflow for AI engineers, enabling them to save valuable time and focus on the more intricate aspects of dataset development and refinement.
Constructing Correct Software
Central to Formal Methods is the so-called Correctness Theorem which relates a specification to its correct Implementations. This theorem is the goal of traditional program testing and, more recently, of program verification (in which the theorem must be proved). Proofs are difficult, though even with the use of powerful theorem provers. This volume explains and illustrates an alternative method, which allows the construction of (necessarily correct) algorithms from a specification using algebraic transformations and refinement techniques which prevent the introduction of errors. Based on teaching material used extensively at Loughborough University, John Cooke introduces the basics, using simple examples and lots of detailed working (which can often be re-used). Constructing Correct Software will provide invaluable reading for students and practitioners of Computer Science and Software Engineering to whom correctness of software is of prime importance.
Logic-Based Program Synthesis and Transformation ; 17th International Symposium, LOPSTR 2007, Kongens Lyngby, Denmark, August 23-24, 2007, Revised Selected Papers
Contains a selectionofthe the paperspresentedatthe 17thInter- tional Symposium on Logic-Based Program Synthesis and Transformation, that was held in Kongens Lyngby, Denmark, August 23-24,2007. LOPSTR thus traditionally solicits papers in the areas of: specification, synthesis, verification, transformation, analysis, optimization, composition, security, reuse, applications andtools, component-baseds of tware development, software architectures, age- based software development and program refnement. Formal proceedings are produced only after the symposium, so that authors can incorporate this feed back in the published papers.
Automated technology for verification and analysis ; 3rd International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings
The Automated Technology for Veri?cation and Analysis (ATVA) international symposium series was initiated in 2003, responding to a growing interest in formal veri?cation spurred by the booming IT industry, particularly hardware design and manufacturing in East Asia. Its purpose is to promote research on automated veri?cation and analysis in the region by providing a forum for int- action between the regional and the international research/industrial commu- ties of the ?eld. ATVA 2005, the third of the ATVA series, was held in Taipei, Taiwan, 2005. The main theme of the symposium encompasses - sign, complexities, tools, and applications of automated methods for veri?cation and analysis. This book constitutes the refereed proceedings of the symposium .
Advances and applications of DSmT for information fusion: Collected works ; Vol.3
One of the most comprehensive and flexible fusion theory based on belief functions. It can work in all fusion spaces: power set, hyper-power set, and super-power set, and has various fusion and conditioning rules that can be applied depending on each application. Some new generalized rules are introduced in this volume with codes for implementing some of them. For the qualitative fusion, the DSm Field and Linear Algebra of Refined Labels (FLARL) is proposed which can convert any numerical fusion rule to a qualitative fusion rule. When one needs to work on a refined frame of discernment, the refinement is done using Smarandache s algebraic codification. New interpretations and implementations of the fusion rules based on sampling techniques and referee functions are proposed, including the probabilistic proportional conflict redistribution rule.
Advances and applications of DSmT for information fusion ; Vol. 4
One of the most comprehensive and flexible fusion theory based on belief functions. It can work in all fusion spaces: power set, hyper-power set, and super-power set, and has various fusion and conditioning rules that can be applied depending on each application. Some new generalized rules are introduced in this volume with codes for implementing some of them. For the qualitative fusion, the DSm Field and Linear Algebra of Refined Labels (FLARL) is proposed which can convert any numerical fusion rule to a qualitative fusion rule. When one needs to work on a refined frame of discernment, the refinement is done using Smarandache s algebraic codification. New interpretations and implementations of the fusion rules based on sampling techniques and referee functions are proposed, including the probabilistic proportional conflict redistribution rule.
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.
