Filters








73 Hits in 5.6 sec

Verification of large state/event systems using compositionality and dependency analysis [chapter]

JØrn Lind-Nielsen, Henrik Reif Andersen, Gerd Behrmann, Henrik Hulgaard, Kåre Kristoifersen, Kim G. Larsen
1998 Lecture Notes in Computer Science  
This paper introduces a technique that uses compositionality and dependency analysis to significantly improve the efficiency of symbolic model checking of state/event models.  ...  A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems.  ...  Conclusion We have presented a verification problem for state/event systems which is characterized by a large number of reachability checks.  ... 
doi:10.1007/bfb0054173 fatcat:xsuejamzqzfylezhvwsmrbm45q

Concurrent software verification with states, events, and deadlocks

Sagar Chaki, Edmund Clarke, Joël Ouaknine, Natasha Sharygina, Nishant Sinha
2005 Formal Aspects of Computing  
Our specification language is a state/event extension of linear temporal logic, and allows us to express many properties of software in a concise and intuitive manner.  ...  Contrary to other state/event approaches, our work also integrates two powerful verification techniques, counterexample-guided abstraction refinement and compositional reasoning.  ...  Concurrent software verification with states, events, and deadlocks be worthwhile to incorporate symbolic and partial order techniques to improve its efficiency further.  ... 
doi:10.1007/s00165-005-0071-z fatcat:j4zpq2julrfijhpnv4s4lohm4a

Verification of Hierarchical State/Event Systems Using Reusability and Compositionality [chapter]

Gerd Behrmann, Kim G. Larsen, Henrik R. Andersen, Henrik Hulgaard, Jørn Lind-Nielsen
1999 Lecture Notes in Computer Science  
The straightforward way of analysing a hierarchical system is to first flatten it into an equivalent non-hierarchical system and then apply existing finite state system verification techniques.  ...  We combine the reusability technique with the successful compositional technique of [13] and investigate the combination experimentally on industrial systems and hierarchical systems generated according  ...  Acknowledgment The authors would like to thank Steffen Braa Andersen, Claus Krogholm Pedersen and Peter Smed Vestergaard for their valuable contributions to the work of this paper.  ... 
doi:10.1007/3-540-49059-0_12 fatcat:i4qwmrjhurau7hcakrragz2zqm

Model Reduction of Modules for State-Event Temporal Logics [chapter]

M. Lawford, J. S. Ostroff, W. M. Wonham
1996 IFIP Advances in Information and Communication Technology  
Logics such as Ostroff's RTTL allow for the specification and verification of a system's state-event behavior.  ...  In this paper we use state-event observational equivalence to perform model reduction for a subclass of formulas of state-event linear temporal logics, with particular attention being paid to a discrete  ...  The main result of this section is that strongly state-event equivalent systems satisfy the same temporal formulas and hence we can use a systems strong state-event quotient system to verify system properties  ... 
doi:10.1007/978-0-387-35079-0_16 fatcat:d3r7wgeg5raq5aqnznvowuhlaq

The ComFoRT Reasoning Framework [chapter]

Sagar Chaki, James Ivers, Natasha Sharygina, Kurt Wallnau
2005 Lecture Notes in Computer Science  
Another is the use of a simpler language for expressing verification properties, such as a pattern language [11] .  ...  ., CCL designs) verification results are satisfied by eventual component implementations by proving a conformance relation between the model and its implementation.  ...  This, along with the explicit use of compositionality, delays the onset of state-space explosion for as long as possible. State/Event-based Verification.  ... 
doi:10.1007/11513988_18 fatcat:kwetb2qaevfg5andttihyi44xi

Security of multi-agent systems: A case study on comparison shopping

Dieter Hutter, Heiko Mantel, Ina Schaefer, Axel Schairer
2007 Journal of Applied Logic  
Exploiting the modular structure of a multi-agent system considerably reduces the complexity of the overall security analysis.  ...  This article uses a comparison-shopping scenario to introduce a general methodology for formally verifying the security of multi-agent systems.  ...  A proof by unwinding is done directly on the level of a state-event system (e.g., a customer state-event system or a merchant state-event system) and not on the level of the induced event system, on which  ... 
doi:10.1016/j.jal.2005.12.015 fatcat:izhfyjyny5bw3fvx3s656kc7ga

Possibilistic Information Flow Control for Workflow Management Systems

Thomas Bauereiss, Dieter Hutter
2014 Electronic Proceedings in Theoretical Computer Science  
For this purpose, we define the semantics of a workflow as a state-event system and formalise security properties in a trace-based way, i.e. on an abstract level without depending on details of enforcement  ...  This formal model then allows us to build upon well-known verification techniques for information flow control.  ...  Acknowledgements We thank Richard Gay, Sylvia Grewe, Steffen Lortz, Heiko Mantel and Henning Sudbrock for providing a formalisation of the MAKS framework in Isabelle/HOL that allowed us to verify our main  ... 
doi:10.4204/eptcs.148.4 fatcat:2hefu3pau5e6rjhgm53ggxbj7u

Formal Verification of AADL Specifications in the Topcased Environment [chapter]

Bernard Berthomieu, Jean-Paul Bodeveix, Christelle Chaudet, Silvano Dal Zilio, Mamoun Filali, François Vernadat
2009 Lecture Notes in Computer Science  
We describe a formal verification toolchain for AADL, the SAE Architecture Analysis and Design Language, enriched with its behavioral annex.  ...  We give a high-level view of the tools involved and illustrate the successive transformations that take place during the verification process.  ...  State/Event-LTL formulas are interpreted over the computation paths of the model and may express a wide range of state and/or transition properties.  ... 
doi:10.1007/978-3-642-01924-1_15 fatcat:4a7vcz755zfu3fl5jevix3gfpi

Compatibility of Safety Properties and Possibilistic Information Flow Security in MAKS [chapter]

Thomas Bauereiss, Dieter Hutter
2014 IFIP Advances in Information and Communication Technology  
Motivated by typical security requirements of workflow management systems, we consider the integrated verification of both safety properties (e.g. separation of duty) and information flow security predicates  ...  the safety property and applying existing compositionality results for MAKS security predicates.  ...  We thank Richard Gay, Sylvia Grewe, Steffen Lortz, Heiko Mantel and Henning Sudbrock for providing a formalization of the MAKS framework in Isabelle/HOL that allowed us to verify our main results in Isabelle  ... 
doi:10.1007/978-3-642-55415-5_21 fatcat:ht4fw3gqobfp3lkdftou6wjr6u

An overview of fault tree analysis and its application in model based dependability analysis

Sohag Kabir
2017 Expert systems with applications  
Fault Tree Analysis (FTA) is a well-established and well-understood technique, widely used for dependability evaluation of a wide range of systems.  ...  Thirdly, this paper reviews a number of prominent MBDA techniques where fault trees are used as a means for system dependability analysis and provides an insight into their working mechanism, applicability  ...  analysis of large and complex open systems.  ... 
doi:10.1016/j.eswa.2017.01.058 fatcat:ovurt2fc3fes3ebws2oimkmabu

High-Assurance Separation Kernels: A Survey on Formal Methods [article]

Yongwang Zhao, David Sanan, Fuyuan Zhang, Yang Liu
2017 arXiv   pre-print
They are introduced to decouple the analysis of applications in partitions from the analysis of the kernel itself.  ...  Finally, four challenges and their possible technical directions for future research are identified, e.g. specification bottleneck, multicore and concurrency, and automation of full formal verification  ...  We focus on state-event based properties in this paper.  ... 
arXiv:1701.01535v1 fatcat:wivlgaqkmffc5nb2kalmpy77sy

Composition and refinement of discrete real-time systems

Jonathan S. Ostroff
1999 ACM Transactions on Software Engineering and Methodology  
This paper presents a structured compositional design method for discrete real-time systems that can be used to combat the combinatorial explosion of states in the verification of large systems.  ...  The advantage of compositional verification is clear. Each module is both simpler and smaller than the system itself. Composition requires the use of both model-checking and deductive techniques.  ...  This article presents a structured compositional design method for discrete real-time systems that can be used to combat the combinatorial explosion of states in the verification of large systems.  ... 
doi:10.1145/295558.295560 fatcat:4zudnkqzszfgxivap2hoezpqnu

Lightweight verification of separate compilation

Jeehoon Kang, Yoonseung Kim, Chung-Kil Hur, Derek Dreyer, Viktor Vafeiadis
2016 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016  
Acknowledgements This research has been supported in part by the ICT R&D program of MSIP/IITP (Grant R0132-15-1006), and in part by EC FET project ADVENT (308830).  ...  The first and second authors have been supported by Korea Foundation for Advanced Studies Scholarships. We thank Jim Apple and Xavier Leroy for helpful feedback.  ...  The meaning of programs is described by three definitions: get-genv ∈ Prog → GEnv load ∈ Prog State → ∈ P(GEnv × State × Event × State) The first function, get-genv (prg), returns the global environment  ... 
doi:10.1145/2837614.2837642 dblp:conf/popl/KangKHDV16 fatcat:zudleyob3fadtf2as7c3anglq4

Lightweight verification of separate compilation

Jeehoon Kang, Yoonseung Kim, Chung-Kil Hur, Derek Dreyer, Viktor Vafeiadis
2016 SIGPLAN notices  
Acknowledgements This research has been supported in part by the ICT R&D program of MSIP/IITP (Grant R0132-15-1006), and in part by EC FET project ADVENT (308830).  ...  The first and second authors have been supported by Korea Foundation for Advanced Studies Scholarships. We thank Jim Apple and Xavier Leroy for helpful feedback.  ...  The meaning of programs is described by three definitions: get-genv ∈ Prog → GEnv load ∈ Prog State → ∈ P(GEnv × State × Event × State) The first function, get-genv (prg), returns the global environment  ... 
doi:10.1145/2914770.2837642 fatcat:thchabs7mnc4vpxuydl2a7b2ji

Languages and Tools for Hybrid Systems Design

Luca P. Carloni, Roberto Passerone, Alessandro Pinto, Alberto L. Angiovanni-Vincentelli
2006 Foundations and Trends® in Electronic Design Automation  
The design is therefore subject to extensive mathematical analysis and simulation.  ...  As a step in this direction, we make the case for a semantic-aware interchange format, which would enable the use of joint techniques, make a formal comparison between different approaches possible, and  ...  Hybrid and Embedded Software Systems), which receives funding from the National Science Foundation (NSF award number CCF-0424422).  ... 
doi:10.1561/1000000001 fatcat:e27dfodqcranhememam757wdj4
« Previous Showing results 1 — 15 out of 73 results