Filters








467,039 Hits in 9.5 sec

An Efficient Runtime Validation Framework based on the Theory of Refinement [article]

Mitesh Jain, Panagiotis Manolios
2017 arXiv   pre-print
Our approach compiles a formal refinement conjecture into a runtime check that is performed during simulation.  ...  We introduce a new methodology based on refinement for testing the functional correctness of hardware and low-level software.  ...  In contrast, in our approach we specify and check the WEB refinement conjecture ( Figure 1 ) using a test program as input and Algorithm 1.  ... 
arXiv:1703.05317v1 fatcat:7uvnxtrvn5cx7h7i7z7sp6lg7i

Incremental Refinement Checking for Test Case Generation [chapter]

Bernhard K. Aichernig, Elisabeth Jöbstl, Matthias Kegele
2013 Lecture Notes in Computer Science  
To generate test cases that detect whether a modelled fault has been implemented, we perform a refinement check between the original and the mutated models. Action systems serve as formal models.  ...  The original model representing the system under test is mutated.  ...  Research herein was funded by the Austrian Research Promotion Agency (FFG), program line "Trust in IT Systems", project number 829583, TRUst via Failed FALsification of Complex Dependable Systems Using  ... 
doi:10.1007/978-3-642-38916-0_1 fatcat:g55cieic5jahhgjki5ebcoxftm

Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking

Bernhard K. Aichernig, Elisabeth Jöbstl
2012 Electronic Proceedings in Theoretical Computer Science  
We encode the transition relation as well as the conformance relation as a constraint satisfaction problem and use a constraint solver in our reachability and refinement checking algorithms.  ...  Model-based mutation testing uses altered test models to derive test cases that are able to reveal whether a modelled fault has been implemented.  ...  We use this for our implementation as we perform the non-refinement check action by action. Here, we first concentrate on finding a possibly unreachable unsafe state.  ... 
doi:10.4204/eptcs.80.7 fatcat:36yzeldqoneh3kj2sz45iae6bi

Formal validation and verification of a medical software critical component

Paolo Arcaini, Silvia Bonfanti, Angelo Gargantini, Atif Mashkoor, Elvinia Riccobene
2015 2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE)  
Offline and online testing techniques permit to check the conformance of the implementation w.r.t. the specification.  ...  The process permits to obtain, through a sequence of refinements, more detailed models that can be formally validated and verified.  ...  In state Test (also initial), the system checks for the user answer.  ... 
doi:10.1109/memcod.2015.7340473 dblp:conf/memocode/ArcainiBGMR15 fatcat:5ji5n62ixrguhlsjv7tseowqhy

Validation Obligations: A Novel Approach to Check Compliance between Requirements and their Formal Specification [article]

Atif Mashkoor, Michael Leuschel, Alexander Egyed
2021 arXiv   pre-print
In this paper, we present a novel approach to check compliance between requirements and their formal refinement-based specification during the earlier stages of development.  ...  Our proposed approach -- "validation obligations" -- is based on the simple idea that both verification and validation are an integral part of all refinement steps of a system.  ...  ACKNOWLEDGMENT The research reported in this paper has been partly funded by the Austrian Science Fund (FWF) (grant # I 4744-N), and the LIT Secure and Correct System Lab sponsored by the province of Upper  ... 
arXiv:2102.06037v1 fatcat:a7ptok3wcngn3osntpiteqfvcu

Assertion-Based Functional Consistency Checking between TLM and RTL Models

Mingsong Chen, Prabhat Mishra
2013 2013 26th International Conference on VLSI Design and 2013 12th International Conference on Embedded Systems  
This paper proposes an efficient mechanism for functional consistency checking using assertion observability.  ...  The experimental results using several industrial designs demonstrate that our method can automatically check the functional consistency between different abstraction levels.  ...  R for test refinement as follows.  ... 
doi:10.1109/vlsid.2013.208 dblp:conf/vlsid/ChenM13 fatcat:whpltsrfvvgnvhyojsh37df3au

A Verification-Centric Software Development Process for Java

Daniel M. Zimmerman, Joseph R. Kiniry
2009 2009 Ninth International Conference on Quality Software  
The development of static analysis tools over the past several years has made it possible to fully embrace DBC in Java systems by writing, type checking, and consistency checking rich behavioral specifications  ...  Object Notation (BON), the Java Modeling Language, and several associated tools including the BON compiler BONC, the ESC/Java2 static checker, a runtime assertion checker, and a specification-based unit test  ...  Considerable research has been devoted to efficient ways to run and analyze the results of unit tests, as well as to the generation of good sets of unit tests for particular systems [21] .  ... 
doi:10.1109/qsic.2009.18 dblp:conf/qsic/ZimmermanK09 fatcat:ubjodauahbgxrn62bpuh6zmpta

On the limits of refinement-testing for model-checking CSP

Toby Murray
2011 Formal Aspects of Computing  
Refinement-checking, as embodied in tools like FDR, PAT and ProB, is a popular approach for model-checking refinement-closed predicates of CSP processes.  ...  We then show that there exist important liveness predicates whose refinement-closures cannot be expressed as refinement checks in any finite linear observations model M, divergence-strict model M ⇓ or  ...  Bill Roscoe also provided useful information on how to use CSP contexts to test for stable acceptances.  ... 
doi:10.1007/s00165-011-0183-6 fatcat:vv4yg6vfkndutbabg3ttvum2ty

Concrete Model Checking with Abstract Matching and Refinement [chapter]

Corina S. Păsăreanu, Radek Pelánek, Willem Visser
2005 Lecture Notes in Computer Science  
The results of these checks are used to decide termination or to refine the abstraction by generating new abstraction predicates.  ...  We illustrate the application of the approach for checking concurrent programs. We also show how a lightweight variant can be used for efficient software testing.  ...  The refinement is done by checking exactness of abstractions with the use of a theorem prover.  ... 
doi:10.1007/11513988_7 fatcat:g64dxakas5evjnush64p2j6bju

VyrdMC: Driving Runtime Refinement Checking with Model Checkers

Tayfun Elmas, Serdar Tasiran
2006 Electronical Notes in Theoretical Computer Science  
The visibility and detailed checking offered by using refinement as the correctness criterion differentiate our approach from simply being a restricted application of model checking.  ...  VyrdMC combines testing, model checking, and Vyrd, the runtime refinement checker we developed earlier.  ...  For the instances used in each test case, Vyrd uses the (C i , S i ) pairs as the starting point.  ... 
doi:10.1016/j.entcs.2006.02.003 fatcat:253eqjjza5cf3p3iac54sabnki

VYRD

Tayfun Elmas, Serdar Tasiran, Shaz Qadeer
2005 Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation - PLDI '05  
I/O and view refinement checking were implemented as a verification tool named VYRD (VerifYing concurrent programs by Runtime Refinement-violation Detection).  ...  We present a runtime technique for checking that a concurrent data structure implementation, such as a file system or the storage manager of a database, conforms to an executable specification with an  ...  The runtime checks for I/O-refinement would pass trivially for all such tests. For useful testing or I/O refinement checking, frequent calls to observer methods must be performed.  ... 
doi:10.1145/1065010.1065015 dblp:conf/pldi/ElmasTQ05 fatcat:pzni3gca5fhdpcfyz3yzqcug2y

VYRD

Tayfun Elmas, Serdar Tasiran, Shaz Qadeer
2005 SIGPLAN notices  
I/O and view refinement checking were implemented as a verification tool named VYRD (VerifYing concurrent programs by Runtime Refinement-violation Detection).  ...  We present a runtime technique for checking that a concurrent data structure implementation, such as a file system or the storage manager of a database, conforms to an executable specification with an  ...  The runtime checks for I/O-refinement would pass trivially for all such tests. For useful testing or I/O refinement checking, frequent calls to observer methods must be performed.  ... 
doi:10.1145/1064978.1065015 fatcat:toh6g3tqjnh4vp3x4gclhrvej4

Integrating formal methods into medical software development: The ASM approach

Paolo Arcaini, Silvia Bonfanti, Angelo Gargantini, Atif Mashkoor, Elvinia Riccobene
2018 Science of Computer Programming  
Medical devices are safety-critical systems since their malfunctions can seriously compromise human safety.  ...  The rigorous process is based on the Abstract State Machine (ASM) formal method, its refinement principle, and model analysis approaches the method supports.  ...  A classical approach based on model checking is used for generating tests: the ASM model is translated in the language of a model checker, and each test goal is expressed as a temporal property (called  ... 
doi:10.1016/j.scico.2017.07.003 fatcat:jt5gcz5jvbcvndnerz76dbtcpq

Mutation-Based Test-Case Generation with Ecdar

Kim G. Larsen, Florian Lorber, Brian Nielsen, Ulrik M. Nyman
2017 2017 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)  
If a mutant does not refine the specification, Ecdar creates a strategy for reaching the non-conformance, which can be used as an adaptive test case.  ...  The tool is used to perform an unbounded conformance check between the correct specification and the mutants, based on a notion of timed refinement.  ...  " as well as the H2020-ECSEL-JU ENABLE-S3 European Initiative to Enable Validation for Highly Automated Safe and Secure Systems under grant agreement N o 692455.  ... 
doi:10.1109/icstw.2017.60 dblp:conf/icst/LarsenLNN17 fatcat:fgl5y2w4zbfk7hyixcziypfsbu

Runtime Refinement Checking of Concurrent Data Structures

Serdar Tasiran, Shaz Qadeer
2005 Electronical Notes in Theoretical Computer Science  
In the second phase, a verification thread runs concurrently with the implementation and uses the logged information to check that the execution conforms to the high-level specification.  ...  We present a runtime technique for checking that a concurrent implementation of a data structure conforms to a high-level executable specification with atomic operations.  ...  We also thank Minwen Ji and Andrej Bogdanov for collaboration on the verification of the Scan file system.  ... 
doi:10.1016/j.entcs.2004.01.028 fatcat:wwimli4yqvdsredchiabgzi45u
« Previous Showing results 1 — 15 out of 467,039 results