Filters








76 Hits in 1.3 sec

Statistical Model Checking for Hyperproperties [article]

Yu Wang, Siddhartha Nalluri, Borzoo Bonakdarpour, Miroslav Pajic
2020 arXiv   pre-print
In this paper, we investigate the problem of statistical model checking (SMC) for hyperproperties.  ...  Unlike exhaustive model checking, SMC works based on drawing samples from the system at hand and evaluate the specification with statistical confidence.  ...  STATISTICAL MODEL CHECKING In this section, we design statistical model checking (SMC) algorithms for HyperPCTL * formulas on labeled discrete-time Markov chains.  ... 
arXiv:1902.04111v5 fatcat:fgunbs5r4ndjphxmhjguuo6ram

HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties [article]

Erika Abraham, Borzoo Bonakdarpour
2018 arXiv   pre-print
Such quantification allows expressing probabilistic hyperproperties. A model checking algorithm for the proposed logic is also given for discrete-time Markov chains.  ...  In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent executions of a system.  ...  Acknowledgments We thank Boris Köpf for his valuable insights on expressing QIF policies.  ... 
arXiv:1804.01853v1 fatcat:qpj2jormfvfpnhucsfmvop2saq

Software engineering and formal methods: SEFM 2019 special section

Peter Csaba Ölveczky, Gwen Salaün
2021 Journal of Software and Systems Modeling  
to publish this special section in Software and Systems Modeling and for his very valuable and friendly assistance in bringing it to publication.  ...  and improvements required by a thorough reviewing process; to the reviewers for kindly contributing their time and effort to ensure the highest quality of each paper; and to Martin Schindler for agreeing  ...  In addition to reusing an existing model checking tool to generate test cases for hyperproperties, the authors also propose an alternative approach to obtain such test cases for nondeterministic models  ... 
doi:10.1007/s10270-021-00874-1 fatcat:yejo3nugwvhedpkadwtt5zfaky

Statistical Verification of Hyperproperties for Cyber-Physical System [article]

Yu Wang, Mojtaba Zarei, Borzoo Bonakdarpour, Miroslav Pajic
2019 arXiv   pre-print
Considering complexity of real-world systems that can be captured as PUSs, we adopt a statistical model checking (SMC) approach for their verification.  ...  In this work, we focus on verifying probabilistic hyperproperties for CPS.  ...  Accordingly, statistical model checking (SMC) is more capable of handling "black-box", high-dimension or large-scale system models.  ... 
arXiv:1906.07253v2 fatcat:t7wmnesfdnfabmqjx47mf53ytm

Probabilistic Hyperproperties of Markov Decision Processes [article]

Rayna Dimitrova and Bernd Finkbeiner and Hazem Torfah
2020 arXiv   pre-print
While the model checking problem for PHL is in general undecidable, we provide methods both for proving and for refuting formulas from a fragment of the logic.  ...  PHL can express a wide range of hyperproperties for probabilistic systems, including both classical applications, such as probabilistic noninterference, and novel applications in areas such as robotics  ...  There are a number of algorithms and tools for hardware model checking [16, 11] , satisfiability checking [15] , and reactive synthesis [14] for hyperproperties.  ... 
arXiv:2005.03362v3 fatcat:2v7if2v23zgjvmj5ccjmdt7k64

Verification of Quantitative Hyperproperties Using Trace Enumeration Relations [chapter]

Shubham Sahai, Pramod Subramanyan, Rohit Sinha
2020 Lecture Notes in Computer Science  
We also introduce a set of inference rules for machine-checked reasoning about the number of satisfying solutions to first-order formulas (aka model counting).  ...  In this paper, we introduce a technique for verifying quantitative hyperproperties based on the notion of trace enumeration relations.  ...  We sincerely thank the anonymous reviewers for their insightful comments, which helped improve this paper.  ... 
doi:10.1007/978-3-030-53288-8_11 fatcat:dmyoyl37p5dkbcb5ago3tx5dzi

Hyperproperties

Michael R. Clarkson, Fred B. Schneider, Andrei Sabelfeld
2010 Journal of Computer Security  
A system is modeled by a non-empty set of infinite traces, called its executions.  ...  A verification technique for safety hyperproperties is given and is shown to generalize prior techniques for verifying secure information flow.  ...  Acknowledgments We thank Graeme Bailey, Stephen Chong, Dexter Kozen, Ueli Maurer, Andrew Myers, and Tom Roeder for discussions about this work.  ... 
doi:10.3233/jcs-2009-0393 fatcat:ocp6crmylbarhaok6oiz6jiwfy

Hyperproperties

Michael R. Clarkson, Fred B. Schneider
2008 2008 21st IEEE Computer Security Foundations Symposium  
A system is modeled by a non-empty set of infinite traces, called its executions.  ...  A verification technique for safety hyperproperties is given and is shown to generalize prior techniques for verifying secure information flow.  ...  Acknowledgments We thank Graeme Bailey, Stephen Chong, Dexter Kozen, Ueli Maurer, Andrew Myers, and Tom Roeder for discussions about this work.  ... 
doi:10.1109/csf.2008.7 dblp:conf/csfw/ClarksonS08 fatcat:5m3p4r2gtneh5ch6w67fw6lalu

Team Semantics for the Specification and Verification of Hyperproperties

Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann, Michael Wagner
2018 International Symposium on Mathematical Foundations of Computer Science  
We study basic properties of this new logic and classify the computational complexity of its satisfiability, path, and model checking problem.  ...  Finally, we compare its expressivity to the one of HyperLTL, another recently introduced logic for hyperproperties.  ...  We studied the complexity of path-checking, model checking, and satisfiability problems of team LTL and its extensions with dependence atoms and the contradictory negation.  ... 
doi:10.4230/lipics.mfcs.2018.10 dblp:conf/mfcs/KrebsMV018 fatcat:k5wa5nb6dzhihj6tfd6ctswmoa

Team Semantics for the Specification and Verification of Hyperproperties [article]

Andreas Krebs and Arne Meier and Jonni Virtema and Martin Zimmermann
2018 arXiv   pre-print
We study basic properties of this new logic and classify the computational complexity of its satisfiability, path, and model checking problem.  ...  Finally, we compare its expressivity to the one of HyperLTL, another recently introduced logic for hyperproperties.  ...  We studied the complexity of path-checking, model checking, and satis ability problems of team LTL and its extensions with dependence atoms and the contradictory negation.  ... 
arXiv:1709.08510v4 fatcat:k37abx6utvhn3cubnvgwqqo74y

Verification of Quantitative Hyperproperties Using Trace Enumeration Relations [article]

Shubham Sahai, Rohit Sinha, Pramod Subramanyan
2020 arXiv   pre-print
We also introduce a set of inference rules for machine-checked reasoning about the number of satisfying solutions to first-order formulas (aka model counting).  ...  In this paper, we introduce a technique for verification of quantitative hyperproperties based on the notion of trace enumeration relations.  ...  Acknowledgements We sincerely thank the anonymous reviewers for their insightful comments which helped improve this paper.  ... 
arXiv:2005.04606v2 fatcat:r7bnztj4njesbeafvspevw7vcm

Tools for the construction and analysis of systems

Dirk Beyer, Marieke Huisman
2020 International Journal on Software Tools for Technology Transfer (STTT)  
In order to develop reliable software and systems, we depend on practical techniques for the construction and analysis of such software and systems.  ...  This special issue of Software Tools for Technology Transfer presents various tool-supported techniques that can help with the construction and analysis of such reliable software and systems.  ...  We are grateful to all the authors for their contributions and to the program committee of TACAS 2018 for their help in selecting the papers for the conference program, including the papers for this issue  ... 
doi:10.1007/s10009-020-00581-0 fatcat:mjqzk5xsuff73ijf4ftmj35aou

Linear-time Temporal Logic with Team Semantics: Expressivity and Complexity [article]

Jonni Virtema, Jana Hofmann, Bernd Finkbeiner, Juha Kontinen, Fan Yang
2021 arXiv   pre-print
By doing so, we obtain a number of model checking results for TeamLTL and identify its undecidability frontier.  ...  We relate the expressivity of TeamLTL to logics for hyperproperties obtained by extending LTL with trace and propositional quantifiers (HyperLTL and HyperQPTL).  ...  EXPSPACE model checking for the fragment.  ... 
arXiv:2010.03311v3 fatcat:b7tfjxoipjavpizjrekbk5ruee

Probabilistic Hyperproperties with Nondeterminism [article]

Erika Abraham, Ezio Bartocci, Borzoo Bonakdarpour, Oyendrila Dobe
2020 arXiv   pre-print
We study the problem of formalizing and checking probabilistic hyperproperties for models that allow nondeterminism in actions.  ...  Subsequently, we propose an SMT-based encoding for model checking this language and evaluate its performance.  ...  Other works on probabilistic hyperproperties for DTMCs include parameter synthesis [8] and statistical model checking [5, 9] .  ... 
arXiv:2005.06115v2 fatcat:qchf3l6iqvbyjppvzloryicnbi

Refinement type contracts for verification of scientific investigative software [article]

Maxwell Shinn
2019 arXiv   pre-print
It allows checking hyperproperties within contracts and offers automated test case generation to supplement online checking.  ...  User code which defines data analysis pipelines and computational models is essential for research in the natural and social sciences, but little is known about how to ensure its correctness.  ...  Some common examples of investigative software include: scripts to load experimental data and perform statistical tests using statistical libraries; simulations of a computational model; a pipeline which  ... 
arXiv:1909.00427v1 fatcat:i7lsxpr6mrgwnamhnhjchfctlm
« Previous Showing results 1 — 15 out of 76 results