Filters








231 Hits in 5.3 sec

Unified Property Specification for Hardware/Software Co-Verification

Fei Xie, Huaiyu Liu
2007 Computer Software and Applications Conference (COMPSAC) Proceedings of the IEEE International  
The semantics of hardware and software events and their temporal correlations are formalized based on translation of both hardware and software semantics to a common formal semantic basis. xPSL has been  ...  A stumbling block to effective co-verification using model checking is the lack of support to unified property specification for hardware, software, and entire embedded systems.  ...  The temporal operators of xPSL are essentially the temporal operators of LTL and CTL. All assertions that use LTL operators are translatable since ω-automata subsume LTL in expressiveness.  ... 
doi:10.1109/compsac.2007.231 dblp:conf/compsac/XieL07 fatcat:yytxcy22vrbzpaepr3b7vrufae

A Verified and Compositional Translation of LTL to Deterministic Rabin Automata

Julian Brunner, Benedikt Seidl, Salomon Sickert, Michael Wagner
2019 International Conference on Interactive Theorem Proving  
We present a formalisation of the unified translation approach from linear temporal logic (LTL) to ω-automata from [19] .  ...  This approach decomposes LTL formulas into "simple" languages and allows a clear separation of concerns: first, we formalise the purely logical result yielding this decomposition; second, we develop a  ...  A Verified LTL Translator We extract the executable translation of LTL formulas into ω-automata by instantiating the locale with a suitable equivalence relation.  ... 
doi:10.4230/lipics.itp.2019.11 dblp:conf/itp/0001SS19 fatcat:zhsmqsspyfcd3f4uggptl3t7le

Compositional Reasoning for Hardware/Software Co-verification [chapter]

Fei Xie, Guowu Yang, Xiaoyu Song
2006 Lecture Notes in Computer Science  
Our approach addresses these challenges by (1) filling the hardware/software semantic gaps via translation of hardware and software into a common formal language, (2) defining a unified property specification  ...  Using compositional reasoning, model checking of a property on a system is accomplished by decomposing the system into components, model checking the component properties locally on the components, and  ...  Rule 1 For ω-automata P 1 and P 2 modeling two components of a system, and Q modeling a property of the system, to show that P 1 ⊗ P 2 |= Q, find ω-automata Q 1 and Q 2 modeling the component properties  ... 
doi:10.1007/11901914_14 fatcat:ottileiua5dhvmotsqv34zqzle

Two Variable vs. Linear Temporal Logic in Model Checking and Games [chapter]

Michael Benedikt, Rastislav Lenhardt, James Worrell
2011 Lecture Notes in Computer Science  
Our results give both a unified approach to understanding the behaviour of FO 2 and LTL, along with a nearly comprehensive picture of the complexity of verification for these logics and their sublogics  ...  We give three logic-to-automata translations which can be used to give upper bounds for FO 2 and UTL and various sub-logics.  ...  Benedikt is supported in part by EPSRC grants EP/G004021/1 and EP/H017690/1. Worrell is supported in part by EPSRC grant EP/G069727/1.  ... 
doi:10.1007/978-3-642-23217-6_33 fatcat:2txnwypnbncszmzt77rmocwfnm

Two Variable vs. Linear Temporal Logic in Model Checking and Games

Michael Benedikt, Rastislav Lenhardt, James Worrell, Rajeev Alur
2013 Logical Methods in Computer Science  
Our results give both a unified approach to understanding the behaviour of FO2 and LTL, along with a nearly comprehensive picture of the complexity of verification for these logics and their sublogics.  ...  We give three logic-to-automata translations which can be used to give upper bounds for FO2 and UTL and various sublogics.  ...  Benedikt is supported in part by EPSRC grants EP/G004021/1 and EP/H017690/1. Worrell is supported in part by EPSRC grant EP/G069727/1.  ... 
doi:10.2168/lmcs-9(2:4)2013 fatcat:lauawqc4drcfvd4lr27vmeke2e

Timed Automata Approach for Motion Planning Using Metric Interval Temporal Logic [article]

Yuchen Zhou, Dipankar Maity, John S. Baras
2016 arXiv   pre-print
We use metric interval temporal logic (MITL), a member of the temporal logic family, to represent the task specification and then we provide a constructive way to generate a timed automaton and methods  ...  to look for accepting runs on the automaton to find a feasible motion (or path) sequence for the robot to complete the task.  ...  SafetyMTL [11] and MTL, evaluated over finite and discrete timed word, can be translated into alternative timed automata.  ... 
arXiv:1603.08246v2 fatcat:lba7bggbgbdabolldbuffikhae

Resets vs. Aborts in Linear Temporal Logic [chapter]

Roy Armoni, Doron Bustan, Orna Kupferman, MosheY. Vardi
2003 Lecture Notes in Computer Science  
We prove that Reset-LTL enjoys the "fast-compilation property": there is a linear translation of Reset-LTL formulas into alternating Büchi automata, which implies a linear translation of Reset-LTL formulas  ...  In contrast, the translation of Abort-LTL formulas into alternating Büchi automata is nonelementary (i.e., cannot be bounded by a stack of exponentials of a bounded height); each abort yields an exponential  ...  While Reset-LTL enjoys the "fast-compilation property"-there is a linear translation of Reset-LTL formulas into alternating Büchi automata, the translation of Abort-LTL formulas into alternating Büchi  ... 
doi:10.1007/3-540-36577-x_6 fatcat:5ux7tsg7n5fkbjgfbqikzruglm

Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems [chapter]

Anthony Widjaja To, Leonid Libkin
2010 Lecture Notes in Computer Science  
We present numerous applications, where we derive (in a unified manner) many known and previously unknown decidability and complexity results of model checking LTL and its fragments over specific classes  ...  We prove various algorithmic metatheorems for the problems of model checking LTL and its two common fragments LTL(Fs, Gs) and LTL det over the expressive class of word/tree automatic transition systems  ...  Formulae in this fragment can be translated into a special kind of automata called 1-weak NBWAs.  ... 
doi:10.1007/978-3-642-12032-9_16 fatcat:qeltq5zo3ndyjkhceyksple6se

Algorithmic metatheorems for decidable LTL model checking over infinite systems [article]

Anthony Widjaja To, Leonid Libkin
2009 arXiv   pre-print
We present numerous applications, where we derive (in a unified manner) many known and previously unknown decidability and complexity results of model checking LTL and its fragments over specific classes  ...  Finally, we pinpoint the exact locations in the arithmetic and analytic hierarchies of the problem of checking a relevant semantic condition and the LTL model checking problems over all word/tree automatic  ...  Formulae in this fragment can be translated into a special kind of automata called 1-weak NBWAs.  ... 
arXiv:0910.4932v2 fatcat:zpg4jzxyk5cwxabhjd7ubxipnq

From MITL to Timed Automata [chapter]

Oded Maler, Dejan Nickovic, Amir Pnueli
2006 Lecture Notes in Computer Science  
We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models.  ...  This compositional construction is much simpler than previously known and can be easily implemented. Prediction is very difficult, especially about the future. Niels Bohr  ...  Acknowledgment We thank anonymous referees of several conferences for their remarks and suggestions.  ... 
doi:10.1007/11867340_20 fatcat:ao23ugrf6vbubg5v3wgmldqdxq

Model Checking of Component Connectors

Mohammad Izadi, Ali Movaghar, Farhad Arbab
2007 Computer Software and Applications Conference (COMPSAC) Proceedings of the IEEE International  
The negation of the property specified by a ρLTL formula is translated into an equivalent automaton. The join of the two automata representing the system and the ρLTL formula is computed.  ...  However, as the first attempt, and in order to use the previously implemented tools (such as LTL2BA [58] ) which translate LTL into Büchi automata, we transform ρLTL to LTL.  ... 
doi:10.1109/compsac.2007.153 dblp:conf/compsac/IzadiMA07 fatcat:lysriwrovfalxdsge5jm7xxuvi

Linear Temporal Logic Symbolic Model Checking

Kristin Y. Rozier
2011 Computer Science Review  
This survey provides a perspective on the formal verification technique of linear temporal logic (LTL) symbolic model checking, from its history and evolution leading up to the state-of-the-art.  ...  We unify research from 1977 to 2009, providing a complete end-to-end analysis embracing a users' perspective by applying each step to a real-life aerospace example.  ...  Rozier, and Misty D. Davies for insightful comments on earlier drafts of this paper.  ... 
doi:10.1016/j.cosrev.2010.06.002 fatcat:e4zzsmtvmbhhfilofosb4ucqni

Formalizing and Reasoning about Quality [chapter]

Shaull Almagor, Udi Boker, Orna Kupferman
2013 Lecture Notes in Computer Science  
By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, we are able to solve the above problems and show that reasoning about LTL[F] has roughly the same complexity  ...  The satisfaction value of an LTL[F] formula is a number between 0 and 1, describing the quality of the satisfaction.  ...  Translating LTL[F ] to Automata The automata-theoretic approach uses the theory of automata as a unifying paradigm for system specification, verification, and synthesis [24, 26] .  ... 
doi:10.1007/978-3-642-39212-2_3 fatcat:pu6uxmknurgrnpnugbt3acl2l4

Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words [chapter]

Orna Kupferman, Sarai Sheinvald-Faragy
2006 Lecture Notes in Computer Science  
A significant advantage of alternating automata is the straightforward (and linear) translation of LTL formulas to alternating Büchi automata [26, 34] .  ...  The automata-theoretic approach to formal verification was originally developed with nondeterministic automata, and is based on an exponential translation of LTL formulas to nondeterministic Büchi automata  ...  The translation of LTL formulas to alternating automata results in weak automata [26] . Also, ABW can be translated to an AWW with a quadratic blow up [23] .  ... 
doi:10.1007/11817949_33 fatcat:pix2wbw4trap7an4s6zqvjxb2e

Termination Criteria for Bounded Model Checking: Extensions and Comparison

Mohammad Awedh, Fabio Somenzi
2006 Electronical Notes in Theoretical Computer Science  
The translation to automata can be accomplished in more than one way, and in this paper we contrast two of them: one based on the algorithms of [18] , and one based on the notion of tight automaton of  ...  In [1] we presented a criterion based on the translation of the linear-time specification into a Büchi automaton.  ...  Every LTL formula ψ can be translated into a Büchi automaton A ψ such that A ψ accepts exactly the paths that satisfy ψ [9, 18] .  ... 
doi:10.1016/j.entcs.2005.07.019 fatcat:zou27iwprvfptgez2csgwxi7qm
« Previous Showing results 1 — 15 out of 231 results