28,287 Hits in 4.4 sec

Using Guided Simulation to Assess Driver Assistance Systems ★ [chapter]

Martin Fränzle, Tayfun Gezgin, Hardi Hungar, Stefan Puch, Gerald Sauter
2011 FORMS/FORMAT 2010  
For that purpose, we use a quantitative logic which enables us to specify criticality and other properties of simulation runs.  ...  An online evaluation of the logic permits us to define a procedure which guides the simulation towards critical situations and allows to estimate the risk connected with the introduction of the assistance  ...  Acknowledgements: We acknowledge the many fruitful discussions and in particular the work of the other participants in the IMoST project and further cooperating projects which provided the models whose  ... 
doi:10.1007/978-3-642-14261-1_20 dblp:conf/forms/FranzleGHPS10 fatcat:smekjoxourcmjgua5szwbsyjbq

A Verification Approach for Programmable Logic Controllers

Xiang-yu LUO, Yong LI, Wan-xiao DU, Fan YANG, Zhi-gang YANG
2017 DEStech Transactions on Engineering and Technology Research  
We explore the modeling method for timing, environment and controller logics in a system, in which predicate abstraction and counterexample-guided refinement strategies are employed.  ...  We use a representative example to illustrate the proposed approach and verify it by the model checker CBMC. The experimental results show the validity of the approach.  ...  Predicate abstraction and counterexample-guided refinement strategies are employed for the modeling of timing, environment and controller logics in a system.  ... 
doi:10.12783/dtetr/icca2016/6016 fatcat:ccm5xfsg75chno4xxn27uteahq

State/Event Software Verification for Branching-Time Specifications [chapter]

Sagar Chaki, Edmund Clarke, Orna Grumberg, Joël Ouaknine, Natasha Sharygina, Tayssir Touili, Helmut Veith
2005 Lecture Notes in Computer Science  
., preserved by the simulation relation, and thus amenable to counterexample-guided abstraction refinement.  ...  We address this problem by defining a new branching-time temporal logic SE-AΩ which integrates both state-based and action-based properties.  ...  We thank the anonymous referees for their careful reading and many insightful suggestions.  ... 
doi:10.1007/11589976_5 fatcat:t7f7geaf6rhwzgqa7loz2vjwh4

Automatic Abstraction Using Generalized Model Checking [chapter]

Patrice Godefroid, Radha Jagadeesan
2002 Lecture Notes in Computer Science  
three following improvements: (1) any temporal logic formula can be checked (not just universal properties as with traditional conservative abstractions), (2) correctness proofs and counter-examples are  ...  In the context of automatic abstraction, generalized model checking means checking whether there exists a concretization of an abstraction that satisfies a temporal logic formula.  ...  hence that 3-valued model-checking for any temporal logic L has the same time and space complexity as 2-valued model checking for the logic L.  ... 
doi:10.1007/3-540-45657-0_11 fatcat:pq2p3k4hgjcvbef35ziwvs3kta

A Pattern based Modelling for Self-organizing Multi-agent Systems with Event-B

Zeineb Graja, Frédéric Migeon, Christine Maurel, Marie-Pierre Gleizes, Linas Laibinis, Amira Regayeg, Ahmed Hadj Kacem
2014 Proceedings of the 6th International Conference on Agents and Artificial Intelligence  
Linear Temporal Logic We give a brief description of the Linear Temporal Logic (LTL) as described by Manna and Pnueli (Manna and Pnueli, 1984) .  ...  In the remainder of this section, we illustrate the use of the AGP 0 pattern. For the three other properties (Reach 1 , SO 2 and SO 1 ), we give a formulation of each of them in the temporal logic.  ...  The use of Event-B in (Pereverzeva et al., 2012) is extremely important because of the use of the refinement principle that permits a progressive, guided and correct construction of the desired system  ... 
doi:10.5220/0004906902290236 dblp:conf/icaart/GrajaMMGLRK14 fatcat:5h6q6aniurhbjkiz6mjwntmb24

Formal analysis of piecewise affine systems through formula-guided refinement

Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Cerna, Jiri Barnat
2010 49th IEEE Conference on Decision and Control (CDC)  
We derive conditions guaranteeing the equivalence of an infinite system and its finite abstraction with respect to a specific temporal logic formula and propose methods aimed at the construction of such  ...  We show that the proposed procedure can be implemented using polyhedral operations and analysis of finite graphs. While provably correct, the overall method is conservative and expensive.  ...  Relying on a temporal logic formula to guide the refinement of an abstraction has been previously used in methods based on counterexample guided refinement [8] for verification purposes.  ... 
doi:10.1109/cdc.2010.5717909 dblp:conf/cdc/YordanovTBCB10 fatcat:jh2stc3jvfdypevby5p6flvmrm

Towards Compositional Verification for Modular Robotic Systems

Rafael C. Cardoso, Louise A. Dennis, Marie Farrell, Michael Fisher, Matt Luckcuck
2020 Electronic Proceedings in Theoretical Computer Science  
These contracts can then be used to guide the verification of the individual components, be it by testing or the use of a formal method.  ...  This paper discusses how to use compositional verification to integrate the various verification techniques that are applied to modular robotic software, using a First-Order Logic (FOL) contract that captures  ...  of C with the assumption A C (i C ); and '♦' is Linear-time Temporal Logic (LTL)'s [25] "eventually" operator.  ... 
doi:10.4204/eptcs.329.2 fatcat:4zvqzkb6xjhorlrfavrm4hgiae

Towards coverage closure: Using GoldMine assertions for generating design validation stimulus

Lingyi Liu, D Sheridan, W Tuohy, S Vasudevan
2011 2011 Design, Automation & Test in Europe  
We present a methodology to generate input stimulus for design validation using GoldMine, an automatic assertion generation engine that uses data mining and formal verification.  ...  In this work, we feed these counterexample traces to iteratively refine the original simulation trace data. We introduce an incremental decision tree to mine the new traces in each iteration.  ...  In Section III, we describe our counterexample guided iterative refinement approach to mine tests. In Section IV, we argue for coverage closure and forward progress of coverage using our technique.  ... 
doi:10.1109/date.2011.5763038 dblp:conf/date/LiuSTV11 fatcat:xlpofiyhdndvxfiltrxgflzu7e

Page 2955 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
Summary: “The paper presents temporal logic methods for prov- ing simulation and refinement relations between programs.  ...  of simulation and refinement.  ... 

Formalization and Validation of Safety-Critical Requirements

Alessandro Cimatti, Marco Roveri, Angelo Susi, Stefano Tonetta
2010 Electronic Proceedings in Theoretical Computer Science  
The main ingredients are a very expressive formal language and automatic satisfiability procedures. The language combines first-order, temporal, and hybrid logic.  ...  In safety critical applications such as aerospace, avionics and railways, the use of formal methods is of paramount importance both for requirements and for design validation.  ...  In particular, we used Bounded Model Checking (BMC) [BCCZ99] , particularly effective in solving the satisfiable cases and producing short models, and Counterexample-Guided Abstraction Refinement (CEGAR  ... 
doi:10.4204/eptcs.20.7 fatcat:lv5vja744rfmfjqs3c65r7wsma

Formal analysis of design process dynamics

Tibor Bosse, Catholijn M. Jonker, Jan Treur
2010 Artificial intelligence for engineering design, analysis and manufacturing  
At the most detailed level, in an executable sublanguage also simulation models are specified in a declarative, logical manner, which allows to use these specifications in logical analysis as well.  ...  This paper contributes a declarative, logical approach for specification of dynamic properties of design processes, supported by a formal temporal language which has a high expressivity.  ...  in order to guide the refinement process.  ... 
doi:10.1017/s0890060409990114 fatcat:fp6a6or3nzfyjcfxejc4a43zfq

How Thorough Is Thorough Enough? [chapter]

Arie Gurfinkel, Marsha Chechik
2005 Lecture Notes in Computer Science  
Counterexample-guided abstraction refinement frameworks have been proposed to help build good abstractions iteratively.  ...  Check if the counterexample is feasible 7. if YES, return "ϕ fails on Kc" 8. else use the counterexample for refinement.  ...  A classical (two-valued) Kripke structure is a 3-valued Kripke structure that does not use the value maybe, i.e. the range of R and I is {true, false}. Temporal Logic.  ... 
doi:10.1007/11560548_8 fatcat:okox7zof2nfiznrrfmctzszsly

Comparing Abstraction Refinement Algorithms

Dennis Dams
2003 Electronical Notes in Theoretical Computer Science  
of more limited notions of counterexample-guided refinement.  ...  We argue that the generic algorithm does not limit the completeness of instances, and show that the proposed generalization of counterexamples is necessary for completeness -thus addressing a shortcoming  ...  Acknowledgement Kedar Namjoshi and the anonymous referees are thanked for their suggestions.  ... 
doi:10.1016/s1571-0661(05)80003-9 fatcat:54trg5hicjbvbmtyurehm4w7ey

Combining Induction, Deduction, and Structure for Verification and Synthesis

Sanjit A. Seshia
2015 Proceedings of the IEEE  
We present a formalization of such an integration, show how it can tackle hard problems in verification and synthesis, and outline directions for future work.  ...  The second is to solve the resulting synthesis problem by integrating traditional, deductive methods with inductive inference (learning from examples) using hypotheses about system structure.  ...  Acknowledgments This article is a result of ideas synthesized and verified (!) over many years in collaboration with several students and colleagues.  ... 
doi:10.1109/jproc.2015.2471838 fatcat:cfj3tcy3njg3debcuxzqjye2ii

Model Conformance for Cyber-Physical Systems

Hendrik Roehm, Jens Oehlerking, Matthias Woehrle, Matthias Althoff
2019 ACM Transactions on Cyber-Physical Systems  
., close-loop simulation model Purpose: Refinement validation, simulation-based testing Realized system, e.g., embedded code with physical system Purpose: Implementation validation, target platform execution  ...  The contribution of this paper is a survey of the definitions and algorithms of conformance relations for CPS.  ...  [93] discuss projective relational refinement for refactoring and refining hybrid systems given in differential dynamic logic.  ... 
doi:10.1145/3306157 fatcat:eutummyqizdrrhjrrot7a7lhou
« Previous Showing results 1 — 15 out of 28,287 results