1,329 research outputs found
How to Handle Assumptions in Synthesis
The increased interest in reactive synthesis over the last decade has led to
many improved solutions but also to many new questions. In this paper, we
discuss the question of how to deal with assumptions on environment behavior.
We present four goals that we think should be met and review several different
possibilities that have been proposed. We argue that each of them falls short
in at least one aspect.Comment: In Proceedings SYNT 2014, arXiv:1407.493
Distributed Parametric and Statistical Model Checking
Statistical Model Checking (SMC) is a trade-off between testing and formal
verification. The core idea of the approach is to conduct some simulations of
the system and verify if they satisfy some given property. In this paper we
show that SMC is easily parallelizable on a master/slaves architecture by
introducing a series of algorithms that scale almost linearly with respect to
the number of slave computers. Our approach has been implemented in the UPPAAL
SMC toolset and applied on non-trivial case studies.Comment: In Proceedings PDMC 2011, arXiv:1111.006
Computer Aided Verification
This open access two-volume set LNCS 13371 and 13372 constitutes the refereed proceedings of the 34rd International Conference on Computer Aided Verification, CAV 2022, which was held in Haifa, Israel, in August 2022. The 40 full papers presented together with 9 tool papers and 2 case studies were carefully reviewed and selected from 209 submissions. The papers were organized in the following topical sections: Part I: Invited papers; formal methods for probabilistic programs; formal methods for neural networks; software Verification and model checking; hyperproperties and security; formal methods for hardware, cyber-physical, and hybrid systems. Part II: Probabilistic techniques; automata and logic; deductive verification and decision procedures; machine learning; synthesis and concurrency. This is an open access book
Robust Alternating-Time Temporal Logic
In multi-agent system design, a crucial aspect is to ensure robustness,
meaning that for a coalition of agents A, small violations of adversarial
assumptions only lead to small violations of A's goals. In this paper we
introduce a logical framework for robust strategic reasoning about multi-agent
systems. Specifically, inspired by recent works on robust temporal logics, we
introduce and study rATL and rATL*, logics that extend the well-known
Alternating-time Temporal Logic ATL and ATL* by means of an opportune
multi-valued semantics for the strategy quantifiers and temporal operators. We
study the model-checking and satisfiability problems for rATL and rATL* and
show that dealing with robustness comes at no additional computational cost.
Indeed, we show that these problems are PTime-complete and ExpTime-complete for
rATL, respectively, while both are 2ExpTime-complete for rATL*
Fundamental Approaches to Software Engineering
This open access book constitutes the proceedings of the 24th International Conference on Fundamental Approaches to Software Engineering, FASE 2021, which took place during March 27–April 1, 2021, and was held as part of the Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg but changed to an online format due to the COVID-19 pandemic. The 16 full papers presented in this volume were carefully reviewed and selected from 52 submissions. The book also contains 4 Test-Comp contributions
- …