Filters








1,093 Hits in 5.6 sec

Deriving Real-Time Programs from Duration Calculus Specifications [chapter]

François Siewe, Dang Van Hung
2001 Lecture Notes in Computer Science  
Then the control program is derived from its specification using an extension of Hoare triples to real-time.  ...  In this paper we present a syntactical approach for deriving real-time programs from a formal specification of the requirements of real-time systems.  ...  This couple of triples is used to reason about the properties of real-time programs. Following are some examples of our extended Hoare triples.  ... 
doi:10.1007/3-540-44798-9_7 fatcat:e6ws5tx55jb4robjx4wryqwywq

Implementation of the Composition-nominative Approach to Program Formalization in Mizar

Ievgen Ivanov, Artur Kornilowicz, Mykola Nikitchenko
2018 Computer Science Journal of Moldova  
The further aim of this work is development of a formal verification tool for software which processes and communicates with complex forms of data.  ...  In this paper we describe an ongoing work on implementation of the composition-nominative approach to program formalization in Mizar proof assistant based on the first-order logic and axiomatic set theory  ...  • formulate program properties in the form of Hoare triples with pre-and postconditions represented by partial predicates on nominative data; • prove program properties using the rules of the extended  ... 
doaj:a77c69ab9a394fb7854382c6ba6b81d5 fatcat:2z3et75rkneydeps4jal2jjs4i

AUSPICE: Automatic Safety Property Verification for Unmodified Executables [chapter]

Jiaqi Tan, Hui Jun Tay, Rajeev Gandhi, Priya Narasimhan
2016 Lecture Notes in Computer Science  
Verification of machine-code programs using program logic has focused on functional correctness, and proofs have required manuallyprovided program specifications.  ...  We present our novel logic framework, AUSPICE, for automatic safety property verification for unmodified executables, which extends an existing trustworthy Hoare logic for local reasoning, and provides  ...  Figure 6 shows the time taken to verify the safety of each of our test programs. We carried out the verification on an 2.6 GHz Core i7 system.  ... 
doi:10.1007/978-3-319-29613-5_12 fatcat:a5qyfpmt3jfn3khjhshqv5l3ge

Verifying data- and control-oriented properties combining static and runtime verification: theory and tools

Wolfgang Ahrendt, Jesús Mauricio Chimento, Gordon J. Pace, Gerardo Schneider
2017 Formal methods in system design  
The analysis is necessarily an over-approximation as the real executions of the program are not available at analysis time.  ...  We show how ppDATE specifications can be analysed using a combination of the deductive theorem prover KeY and the runtime verification tool LARVA.  ...  There exist approaches to deductive verification which are history-aware, including a KeY version for the compositional verification of distributed systems [7] .  ... 
doi:10.1007/s10703-017-0274-y fatcat:nqaqabcijjgqfkeso5hshg2q7e

Hoare Logic in the Abstract [chapter]

Ursula Martin, Erik A. Mathiesen, Paulo Oliva
2006 Lecture Notes in Computer Science  
Finally, we give an example of how our theory can be used in the development of new Hoare logics: we present a new sound and complete set of Hoare-logic-like rules for the verification of linear dynamical  ...  We then give an abstract definition of Hoare triples, parametrised by a verification functor, and prove a single soundness and completeness theorem for such triples.  ...  The authors gratefully acknowledge support of the UK EPSRC grant GR/S31242/01.  ... 
doi:10.1007/11874683_33 fatcat:4kqfrctl6fbwziyormanumnusa

Cartesian hoare logic for verifying k-safety properties

Marcelo Sousa, Isil Dillig
2016 SIGPLAN notices  
We have implemented our verification algorithm in a fully automated tool called DESCARTES, which can be used to analyze any k-safety property of Java programs.  ...  Our program logic is designed with automation and scalability in mind, allowing us to formulate a verification algorithm that automates reasoning in CHL.  ...  Cartesian Hoare Triples We now introduce Cartesian Hoare triples and provide use cases from real-world programming idioms to motivate the relevance and general applicability of k-safety properties. σ  ... 
doi:10.1145/2980983.2908092 fatcat:n7ytzy2vmbfjtfqb6ol63bbow4

Cartesian hoare logic for verifying k-safety properties

Marcelo Sousa, Isil Dillig
2016 Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2016  
We have implemented our verification algorithm in a fully automated tool called DESCARTES, which can be used to analyze any k-safety property of Java programs.  ...  Our program logic is designed with automation and scalability in mind, allowing us to formulate a verification algorithm that automates reasoning in CHL.  ...  Cartesian Hoare Triples We now introduce Cartesian Hoare triples and provide use cases from real-world programming idioms to motivate the relevance and general applicability of k-safety properties. σ  ... 
doi:10.1145/2908080.2908092 dblp:conf/pldi/SousaD16 fatcat:rnnpbtj2kfh7xpfgt5zbmqmiye

An introduction to compositional methods for concurrency and their application to real-time [chapter]

J. J. M. Hooman, W. P. de Roever
1992 Formale Beschreibungstechniken für verteilte Systeme  
Next this Hoare-style framework is adapted to specify and verify real-time properties, and a compositional proof method is formulated for real-time distributed computing.  ...  Having achieved a compositional framework based on classical Hoare triples, we discuss extensions to achieve a convenient formalism to specify and verify reactive systems that have an intensive interaction  ...  Real-time properties of sliding window protocols are verified by Shankar & Lam (1987) using special state variables, called timers, to measure the passage of time.  ... 
doi:10.1007/978-3-642-77580-2_5 fatcat:2sqwxdmm4fgg7a2tf723nswy3u

An introduction to compositional methods for concurrency and their application to real-time

J J M Hooman, W P de Roever
1992 Sadhana (Bangalore)  
Next this Hoare-style framework is adapted to specify and verify real-time properties, and a compositional proof method is formulated for real-time distributed computing.  ...  Having achieved a compositional framework based on classical Hoare triples, we discuss extensions to achieve a convenient formalism to specify and verify reactive systems that have an intensive interaction  ...  Real-time properties of sliding window protocols are verified by Shankar & Lam (1987) using special state variables, called timers, to measure the passage of time.  ... 
doi:10.1007/bf02811338 fatcat:xw2ptfdyonfjjd4pucfqzkbjiu

Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics

Ralf Sasse, José Meseguer
2007 Electronical Notes in Theoretical Computer Science  
After being decomposed, Hoare triples are translated into semantically equivalent first-order verification conditions (VCs) which are then sent to Maude's Inductive Theorem Prover (ITP) to be discharged  ...  and modular Hoare logics on which generic program verification tools can be based.  ...  Acknowledgments We cordially thank Manuel Clavel for his generous help with details of the ITP implementation. This help has been crucial for us to extend the ITP into Java+ITP.  ... 
doi:10.1016/j.entcs.2007.06.006 fatcat:54ezgz546zfrnb3mu23bymkcva

A general framework for sound and complete Floyd-Hoare logics

Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paulo Oliva
2009 ACM Transactions on Computational Logic  
used to develop new Hoare logics (run-time analysis of while programs and stream circuits).  ...  This paper presents an abstraction of Hoare logic to traced symmetric monoidal categories, a very general framework for the theory of systems.  ...  Define abstract Hoare triples as Although we use the same notation as the standard Hoare triple, it should be noted that the meaning of our abstract Hoare triple can only be given once the verification  ... 
doi:10.1145/1614431.1614438 fatcat:ofe2yfds6jbuplbh6la625f7fm

A Proof System for MDESL

Jianyu Lu, Wanling Xie, Huibiao Zhu, Yuan Fei
2017 Communiation Papers of the 2017 Federated Conference on Computer Science and Information Systems  
We extend the primitives of assertion to express the global time of current program, and interpret the triples so that it can verify both terminating and nonterminating computations.  ...  Finally, there is an example about using our proof system to verify the correctness of a program written by MDESL.  ...  ACKNOWLEDGMENT This work was partly supported by Shanghai Collaborative Innovation Center of Trustworthy Software for Internet of Things (No. ZF1213).  ... 
doi:10.15439/2017f400 dblp:conf/fedcsis/LuXZF17 fatcat:ajq4umfcafhhjlf5ibq5buisea

Page 6409 of Mathematical Reviews Vol. , Issue 92k [page]

1992 Mathematical Reviews  
6409 positional proof system is formulated in which Hoare triples can be derived. Classical, noncompositional verification methods for parallel programs are described.  ...  The results can be extended to nonterminating computations and real time.  ... 

A Hoare logic for linear systems

Rob Arthan, Ursula Martin, Paulo Oliva
2011 Formal Aspects of Computing  
We give a sound system of Hoare-style rules for the block diagram constructors that singles out a tractable subset of the block diagram language in which all diagrams represent total functions.  ...  We consider reasoning about linear systems expressed as block diagrams that give a graphical representation of a system of differential equations or recurrence equations.  ...  A system of Hoare logic rules like the ones in Figure 3 are called sound if whenever the Hoare triples in the premise of the rule are true (according the to the reading above) so is the Hoare triple  ... 
doi:10.1007/s00165-011-0180-9 fatcat:imvuw3ivpjawzljlqbbmntdk24

Formal Verification of Control Systems Properties with Theorem Proving

Dejanira Araiza-Illan, Kerstin Eder, Arthur Richards
2014 arXiv   pre-print
This paper presents the deductive formal verification of high-level properties of control systems with theorem proving, using the Why3 tool.  ...  A simple first-order discrete system is used to exemplify the specification of the Simulink model, the translation process from Simulink to the Why3 formal logic language, and the verification of Lyapunov  ...  Acknowledgment The work presented in this paper was supported by the EPSRC grant EP/J01205X/1 RIVERAS: Robust Integrated Verification of Autonomous Systems.  ... 
arXiv:1405.7615v1 fatcat:u2gnlib7r5ev5gywitxpegxl3y
« Previous Showing results 1 — 15 out of 1,093 results