Differential Refinement Logic

We introduce differential refinement logic (dRL), a logic with first-class support for refinement relations on hybrid systems, and a proof calculus for verifying such relations. dRL simultaneously solves several seemingly different challenges common in theorem proving for hybrid systems: 1. When hyb...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science s. 505 - 514
Hlavní autoři: Loos, Sarah M., Platzer, André
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 05.07.2016
Edice:ACM Conferences
Témata:
Theory of computation > Logic
Theory of computation > Semantics and reasoning
Theory of computation > Semantics and reasoning > Program reasoning
ISBN:9781450343916, 1450343910
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We introduce differential refinement logic (dRL), a logic with first-class support for refinement relations on hybrid systems, and a proof calculus for verifying such relations. dRL simultaneously solves several seemingly different challenges common in theorem proving for hybrid systems: 1. When hybrid systems are complicated, it is useful to prove properties about simpler and related subsystems before tackling the system as a whole. 2. Some models of hybrid systems can be implementation-specific. Verification can be aided by abstracting the system down to the core components necessary for safety, but only if the relations between the abstraction and the original system can be guaranteed. 3. One approach to taming the complexities of hybrid systems is to start with a simplified version of the system and iteratively expand it. However, this approach can be costly, since every iteration has to be proved safe from scratch, unless refinement relations can be leveraged in the proof. 4. When proofs become large, it is difficult to maintain a modular or comprehensible proof structure. By using a refinement relation to arrange proofs hierarchically according to the structure of natural subsystems, we can increase the readability and modularity of the resulting proof. dRL extends an existing specification and verification language for hybrid systems (differential dynamic logic, dL) by adding a refinement relation to directly compare hybrid systems. This paper gives a syntax, semantics, and proof calculus for dRL. We demonstrate its usefulness with examples where using refinement results in easier and better-structured proofs.
AbstractList We introduce differential refinement logic (dRL), a logic with first-class support for refinement relations on hybrid systems, and a proof calculus for verifying such relations. dRL simultaneously solves several seemingly different challenges common in theorem proving for hybrid systems: 1. When hybrid systems are complicated, it is useful to prove properties about simpler and related subsystems before tackling the system as a whole. 2. Some models of hybrid systems can be implementation-specific. Verification can be aided by abstracting the system down to the core components necessary for safety, but only if the relations between the abstraction and the original system can be guaranteed. 3. One approach to taming the complexities of hybrid systems is to start with a simplified version of the system and iteratively expand it. However, this approach can be costly, since every iteration has to be proved safe from scratch, unless refinement relations can be leveraged in the proof. 4. When proofs become large, it is difficult to maintain a modular or comprehensible proof structure. By using a refinement relation to arrange proofs hierarchically according to the structure of natural subsystems, we can increase the readability and modularity of the resulting proof. dRL extends an existing specification and verification language for hybrid systems (differential dynamic logic, dL) by adding a refinement relation to directly compare hybrid systems. This paper gives a syntax, semantics, and proof calculus for dRL. We demonstrate its usefulness with examples where using refinement results in easier and better-structured proofs.
Author Loos, Sarah M.
Platzer, André
Author_xml – sequence: 1
  givenname: Sarah M.
  surname: Loos
  fullname: Loos, Sarah M.
  email: sloos@cs.cmu.edu
  organization: Computer Science Department, Carnegie Mellon University
– sequence: 2
  givenname: André
  surname: Platzer
  fullname: Platzer, André
  email: aplatzer@cs.cmu.edu
  organization: Computer Science Department, Carnegie Mellon University
BookMark eNqNj01LxDAURQMqqGPXroRZumnNy9fLW8roqFAQRNchTV8kOtPCdP4_VuwPcHW53MOFcylOh3FgIa5BNgDG3inS2qJt5jTW2hNREfp5kNpoAncuqmn6klIqQE8SLsTNQ8mZDzwcS9yt3ziXgfdzW7fjZ0lX4izH3cTVkivxsX183zzX7evTy-a-raNSeKx76U0yFrBjl1KilKTRiJABKJIhR4xsMFt0MfW9Yz-DuctE0WOvrF6J27_fmPahG8fvKYAMv0ZhMQqL0Yw2_0RDdyic9Q8u10zN
ContentType Conference Proceeding
Copyright 2016 ACM
Copyright_xml – notice: 2016 ACM
DOI 10.1145/2933575.2934555
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 514
GroupedDBID 6IE
6IF
6IG
6IL
6IN
AAJGR
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IEGSK
IJVOP
OCL
RIB
RIC
RIE
RIL
RIO
ID FETCH-LOGICAL-a227t-d084c4517be6ccc9cc043771f119a94969e7e47f576acdd6e8be6fbf99a87d253
ISBN 9781450343916
1450343910
ISICitedReferencesCount 22
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000387609200051&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Jan 31 06:49:57 EST 2024
Wed Jan 31 06:44:04 EST 2024
IsPeerReviewed false
IsScholarly true
Language English
License Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org.
LinkModel OpenURL
MeetingName LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science
MergedId FETCHMERGED-LOGICAL-a227t-d084c4517be6ccc9cc043771f119a94969e7e47f576acdd6e8be6fbf99a87d253
PageCount 10
ParticipantIDs acm_books_10_1145_2933575_2934555
acm_books_10_1145_2933575_2934555_brief
PublicationCentury 2000
PublicationDate 20160705
PublicationDateYYYYMMDD 2016-07-05
PublicationDate_xml – month: 07
  year: 2016
  text: 20160705
  day: 05
PublicationDecade 2010
PublicationPlace New York, NY, USA
PublicationPlace_xml – name: New York, NY, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationYear 2016
Publisher ACM
Publisher_xml – name: ACM
SSID ssj0002178901
Score 2.1734192
Snippet We introduce differential refinement logic (dRL), a logic with first-class support for refinement relations on hybrid systems, and a proof calculus for...
SourceID acm
SourceType Publisher
StartPage 505
SubjectTerms Theory of computation -- Logic
Theory of computation -- Semantics and reasoning
Theory of computation -- Semantics and reasoning -- Program reasoning
Title Differential Refinement Logic
WOSCitedRecordID wos000387609200051&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NS8MwFA8qHjz5NXF-UUHwMDqXNWmSo0zFy0RQYbfSJg0MXCdrFfWv9yVNu04F9eAlLSEfJL-X5L3kfSB0oiQWuh9QXyqS-EQlxOdCwcLTLBZMKoHjxAabYDc3fDQSty4se27DCbAs46-v4ulfoYY8ANuYzv4B7rpRyIB_AB1SgB3STxzxt4fPbZ2ZV-__Ac6LjnOkfz4YQtNGxOvcvU2MytbzxDwYmJjLsjQBLMM8VKu-SVMXLppKMbYu-TVwqFaXwFauVXumpeaevWvuDLv15vsYF-8udnam3At9uakZZ8s5UMWwYYC4cB-BQ6u7ShsUNFwQUTGhvcCa9za2SeoqlCcuLc1Iv27mxPi9AH4kAJ6yC19CKV1Gy4z1SkO9-jIN5CoOjI013HPd1f68qu6dXyfIOPvUpGFM5KTBVtxvoNZ8vN4cuE20lGZbaL2CwnNQbKPDJgLeHAHPItBCD1eX94Nr3wW48ON-nxW-6nEiCcUsSUMppZDSeJpiWGMsYkFEKFKWEqZBJoylUmHKoaBOtBAxZ6pPgx20kk2zdBd5MI4kDRTmIJASQhMBFSUTocaaY6xUGx3DGCNDp3lUGqPTyM1D5OahjU5_LBMlQBF67xet7aO1OXkcoJVi9pweolX5Uozz2ZHF7wOH2Twj
linkProvider IEEE
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+31st+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Differential+Refinement+Logic&rft.au=Loos%2C+Sarah+M.&rft.au=Platzer%2C+Andr%C3%A9&rft.series=ACM+Conferences&rft.date=2016-07-05&rft.pub=ACM&rft.isbn=9781450343916&rft.spage=505&rft.epage=514&rft_id=info:doi/10.1145%2F2933575.2934555
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/sc.gif&client=summon&freeimage=true