Interval-based Abstraction Refinement
Author: Pritam Roy
Publisher:
Published: 2009
Total Pages: 302
ISBN-13:
DOWNLOAD EBOOKRead and Download eBook Full
Author: Pritam Roy
Publisher:
Published: 2009
Total Pages: 302
ISBN-13:
DOWNLOAD EBOOKAuthor: Manfred Morari
Publisher: Springer
Published: 2005-02-25
Total Pages: 695
ISBN-13: 3540319549
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 8th International Workshop on Hybrid Systems: Computation and Control, HSCC 2005, held in Zurich, Switzerland in March 2005. The 40 revised full papers presented together with 2 invited papers and the abstract of an invited talk were carefully reviewed and selected from 91 submissions. The papers focus on modeling, analysis, and implementation of dynamic and reactive systems involving both discrete and continuous behaviors. Among the topics addressed are tools for analysis and verification, control and optimization, modeling, engineering applications, and emerging directions in programming language support and implementation.
Author: Javier Esparza
Publisher: Springer Science & Business Media
Published: 2010-03-17
Total Pages: 482
ISBN-13: 3642120016
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2010, held in Paphos, Cyprus, in March 2010, as part of ETAPS 2010, the European Joint Conferences on Theory and Practice of Software. The 35 papers presented were carefully reviewed and selected from 134 submissions. The topics covered are probabilistic systems and optimization, decision procedures, tools, automata theory, liveness, software verification, real time and information flow, and testing.
Author: Jaques Calmet
Publisher: Springer Science & Business Media
Published: 2006-09-13
Total Pages: 280
ISBN-13: 3540397280
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 8th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2006, held in Beijing, China in September 2006. The 18 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 39 submissions. Based on heuristics and mathematical algorithmics, artificial intelligence and symbolic computation are two views and approaches for automating (mathematical) problem solving. The papers address all current aspects in the area of symbolic computing and AI: mathematical foundations, implementations, and applications in industry and academia. The papers are organized in topical sections on artificial intelligence and theorem proving, symbolic computation, constraint satisfaction/solving, and mathematical knowledge management.
Author: Björn Wachter
Publisher: Logos Verlag Berlin GmbH
Published: 2011
Total Pages: 197
ISBN-13: 3832527648
DOWNLOAD EBOOKComputer networks and embedded systems are ubiquitous and critical parts of our daily life. Therefore performance and reliability guarantees for these systems are crucial. To this end, versatile probabilistic modelling and analysis techniques have been developed. However existing probabilistic analysis methods are inherently limited to small systems. This dissertation introduces a new probabilistic analysis method that scales to large and even infinite systems which are far out of reach of previous methods. The key idea is to approximate a given system by a smaller abstraction which is refined automatically until sufficient precision has been achieved. The thesis discusses the various foundational and practical challenges involved in developing this method, as well as its effectiveness in practice.
Author: Madhavan Mukund
Publisher: Springer
Published: 2012-09-28
Total Pages: 449
ISBN-13: 3642333869
DOWNLOAD EBOOKThis book constitutes the thoroughly refereed proceedings of the 10th International Symposium on Automated Technology for Verification and Analysis, ATVA 2012, held at Thiruvananthapuram, Kerala, India, in October 2012. The 25 regular papers, 3 invited papers and 4 tool papers presented were carefully selected from numerous submissions. Conference papers are organized in 9 technical sessions, covering the topics of automata theory, logics and proofs, model checking, software verification, synthesis, verification and parallelism, probabilistic verification, constraint solving and applications, and probabilistic systems.
Author: Gabriel Ciobanu
Publisher: Springer
Published: 2014-09-11
Total Pages: 493
ISBN-13: 3319108824
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 11th International Colloquium on Theoretical Aspects of Computing, ICTAC 2014 held in Bucharest, Romania, in September 2014. The 25 revised full papers presented together with three invited talks were carefully reviewed and selected from 74 submissions. The papers cover various topics such as automata theory and formal languages; principles and semantics of programming languages; theories of concurrency, mobility and reconfiguration; logics and their applications; software architectures and their models, refinement and verification; relationship between software requirements, models and code; static and dynamic program analysis and verification; software specification, refinement, verification and testing; model checking and theorem proving; models of object and component systems; coordination and feature interaction; integration of theories, formal methods and tools for engineering computing systems; service-oriented architectures: models and development methods; models of concurrency, security, and mobility; theories of distributed, grid and cloud computing; real-time, embedded, hybrid and cyber-physical systems; type and category theory in computer science; models for e-learning and education; case studies, theories, tools and experiments of verified systems; domain-specific modeling and technology: examples, frameworks and practical experience; challenges and foundations in environmental modeling and monitoring, healthcare, and disaster management.
Author: Krause, Christian
Publisher: Universitätsverlag Potsdam
Published: 2012
Total Pages: 54
ISBN-13: 3869561718
DOWNLOAD EBOOKOne of the key challenges in service-oriented systems engineering is the prediction and assurance of non-functional properties, such as the reliability and the availability of composite interorganizational services. Such systems are often characterized by a variety of inherent uncertainties, which must be addressed in the modeling and the analysis approach. The different relevant types of uncertainties can be categorized into (1) epistemic uncertainties due to incomplete knowledge and (2) randomization as explicitly used in protocols or as a result of physical processes. In this report, we study a probabilistic timed model which allows us to quantitatively reason about nonfunctional properties for a restricted class of service-oriented real-time systems using formal methods. To properly motivate the choice for the used approach, we devise a requirements catalogue for the modeling and the analysis of probabilistic real-time systems with uncertainties and provide evidence that the uncertainties of type (1) and (2) in the targeted systems have a major impact on the used models and require distinguished analysis approaches. The formal model we use in this report are Interval Probabilistic Timed Automata (IPTA). Based on the outlined requirements, we give evidence that this model provides both enough expressiveness for a realistic and modular specifiation of the targeted class of systems, and suitable formal methods for analyzing properties, such as safety and reliability properties in a quantitative manner. As technical means for the quantitative analysis, we build on probabilistic model checking, specifically on probabilistic time-bounded reachability analysis and computation of expected reachability rewards and costs. To carry out the quantitative analysis using probabilistic model checking, we developed an extension of the Prism tool for modeling and analyzing IPTA. Our extension of Prism introduces a means for modeling probabilistic uncertainty in the form of probability intervals, as required for IPTA. For analyzing IPTA, our Prism extension moreover adds support for probabilistic reachability checking and computation of expected rewards and costs. We discuss the performance of our extended version of Prism and compare the interval-based IPTA approach to models with fixed probabilities.
Author: Ranjit Jhala
Publisher: Springer Science & Business Media
Published: 2011-01-11
Total Pages: 430
ISBN-13: 3642182747
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 12th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2011, held in Austin, TX, USA, in January 2011, co-located with the Symposium on Principles of Programming Languages, POPL 2011. The 24 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 71 initial submissions. The papers showcases state-of-the-art research in areas such as verification, model checking, abstract interpretation and address any programming paradigm, including concurrent, constraint, functional, imperative, logic and object-oriented programming. Further topics covered are static analysis, deductive methods, program certification, debugging techniques, abstract domains, type systems, and optimization.
Author: Martin Gogolla
Publisher: Springer
Published: 2011-06-28
Total Pages: 215
ISBN-13: 3642217680
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 5th International Conference on Tests and Proofs, TAP 2011, held in Zurich, Switzerland in June/July 2011. The 12 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 27 submissions. Among the topics covered are model checking, testing systems, test generation, symbolic testing, SAT solvers, SMT solvers, property-based testing, automated test generation, learning-based testing, UML, OCL, specification-based testing, and network testing.