Filters








982 Hits in 2.5 sec

Refactoring design models for inductive verification

Yung-Pin Cheng
2002 Software engineering notes  
We have described how models of such systems can be transformed -refactored -into equivalent models in which inductive verification can be applied.  ...  Refactored models are composed in a modular and hierarchical manner to avoid state explosion during an inductive verification.  ... 
doi:10.1145/566171.566198 fatcat:kets4tvfdvd4bn24at7odfqij4

Refactoring design models for inductive verification

Yung-Pin Cheng
2002 Software engineering notes  
We have described how models of such systems can be transformed -refactored -into equivalent models in which inductive verification can be applied.  ...  Refactored models are composed in a modular and hierarchical manner to avoid state explosion during an inductive verification.  ... 
doi:10.1145/566197.566198 fatcat:dued3gcrzfdr5jk47kcaporpnq

Refactoring design models for inductive verification

Yung-Pin Cheng
2002 Software engineering notes  
We have described how models of such systems can be transformed -refactored -into equivalent models in which inductive verification can be applied.  ...  Refactored models are composed in a modular and hierarchical manner to avoid state explosion during an inductive verification.  ... 
doi:10.1145/566172.566198 dblp:conf/issta/Cheng02 fatcat:c3dbiazlprdqtbjqppwh3pxhka

Run-Time Security Traceability for Evolving Systems

A. Bauer, J. Jurjens, Y. Yu
2010 Computer journal  
This paper presents a comprehensive approach for model-based security assurance.  ...  As such, it provides a traceability link from the design model to its implementation by which the actual system can then be verified against the model while it executes.  ...  in the design model.  ... 
doi:10.1093/comjnl/bxq042 fatcat:5atpkvz7d5gufpvphwjno65lsa

Trustworthy Refactoring via Decomposition and Schemes: A Complex Case Study

Dániel Horpácsi, Judit Kőszegi, Zoltán Horváth
2017 Electronic Proceedings in Theoretical Computer Science  
verification can provide true confidence in applying tool-automated refactoring to industrial-scale code.  ...  schemes, then we demonstrate the semi-automatic formal verification of the components based on a theoretical understanding of the semantics of the programming language.  ...  Simon Thompson for his help and support in guiding the first steps in this research. We thank the reviewers for their constructive and helpful comments.  ... 
doi:10.4204/eptcs.253.8 fatcat:avvygyrjxnezflpgvnsdery2u4

Exploiting refactoring in formal verification

Xiang Yin, John Knight, Westley Weimer
2009 2009 IEEE/IFIP International Conference on Dependable Systems & Networks  
Existing Approaches to Verification Existing approaches to verification fall basically into three categories: correctness proofs, refinement, and model checking and static analysis.  ...  Part of what makes Echo practical is a technique called verification refactoring. The program to be verified is mechanically refactored specifically to facilitate verification.  ...  We have demonstrated the efficacy and utility of refactoring by verifying a moderate-sized program written by others and not designed for verification.  ... 
doi:10.1109/dsn.2009.5270355 dblp:conf/dsn/YinKW09 fatcat:b76qgyfyfbcfbgnos4wer2w2ly

Verifying Cryptographic Software Correctness with Respect to Reference Implementations [chapter]

José Bacelar Almeida, Manuel Barbosa, Jorge Sousa Pinto, Bárbara Vieira
2009 Lecture Notes in Computer Science  
The techniques allow for the integration of interactive proof techniques (required given the difficulty and generality of the results sought) in a verification infrastructure that is capable of discharging  ...  many verification conditions automatically.  ...  arising from the refactorings described above for RC4.  ... 
doi:10.1007/978-3-642-04570-7_5 fatcat:ojucshoogvfkhm6pzq7h67gqta

Towards scalable compositional analysis by refactoring design models

Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia-Yi Pan
2003 Software engineering notes  
This further implies that, when analysis is applied to models derived from designs or implementations of actual software systems, a model of the system "as built" is unlikely to be suitable for automated  ...  usually fail for other models.  ...  One of the reasons that it can be analyzed to hundreds of elevators is that its refactored structure is "near to" a structure that is suitable for inductive verification (see [2] ).  ... 
doi:10.1145/949952.940105 fatcat:2qr4n3png5febikcponb6w2hfe

Towards scalable compositional analysis by refactoring design models

Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia-Yi Pan
2003 Proceedings of the 9th European software engineering conference held jointly with 10th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE '03  
This further implies that, when analysis is applied to models derived from designs or implementations of actual software systems, a model of the system "as built" is unlikely to be suitable for automated  ...  usually fail for other models.  ...  One of the reasons that it can be analyzed to hundreds of elevators is that its refactored structure is "near to" a structure that is suitable for inductive verification (see [2] ).  ... 
doi:10.1145/940071.940105 dblp:conf/sigsoft/ChengYHP03 fatcat:6665ksorunaqrfxitioh4skhnq

Mechanical verification of refactorings

Nik Sultana, Simon Thompson
2008 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '08  
In this paper we describe the formal verification of refactorings for untyped and typed lambda-calculi. This verification is performed in the proof assistant Isabelle/HOL.  ...  For a refactoring to be correct the refactored program must be identical in behaviour to the original program.  ...  financial support provided to the first author by the Computing Laboratory and by the Malta Government Scholarship Scheme through award MGSS/2006/007; the second author acknowledges the support of the EPSRC for  ... 
doi:10.1145/1328408.1328417 dblp:conf/pepm/SultanaT08 fatcat:5ygcrbwngrethdlgc7iqte6ugm

Program synthesis: challenges and opportunities

Cristina David, Daniel Kroening
2017 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
Such a satisfying model must map each of the second-order variables P to some function of the appropriate type and arity. Program synthesis generates programs that compute these functions.  ...  The research community has spent the last decades improving first the techniques for propositional satisfiability (SAT) and later for satisfiability modulo theories (SMT), and as a result, recent methods  ...  We thank Pascal Kesseli and Matt Lewis for their work on several applications of program synthesis. Their results were one of the inspiration points for this paper.  ... 
doi:10.1098/rsta.2015.0403 pmid:28871052 pmcid:PMC5597726 fatcat:lykahrlqpraxhkxc6tyby2cjni

Deductive verification of cryptographic software

José Bacelar Almeida, Manuel Barbosa, Jorge Sousa Pinto, Bárbara Vieira
2010 Innovations in Systems and Software Engineering  
The techniques developed have independent interest for practical deductive verification in general.  ...  We apply state-of-the art deductive verification tools to check security-relevant properties of cryptographic software, including safety, absence of error propagation, and correctness with respect to reference  ...  This would be the only option for more complex refactorings.  ... 
doi:10.1007/s11334-010-0127-y fatcat:ppds2e2jlndujpujasiksuzcxm

Towards Trustworthy Refactoring in Erlang

Dániel Horpácsi, Judit Kőszegi, Simon Thompson
2016 Electronic Proceedings in Theoretical Computer Science  
for refactoring.  ...  We propose a simple, high-level but rigorous, notation for defining refactoring transformations in Erlang, and show that this notation provides an extensible, verifiable and executable specification language  ...  We are grateful to Andrei Arusoaie and Dorel Lucanu for providing us with the pre-release copy of the SCC extension of K used to perform some of the verifications reported here.  ... 
doi:10.4204/eptcs.216.5 fatcat:fycjcmuyzzhyxgwrz3qyd4ueri

Challenge proposal

Max Schäfer, Torbjörn Ekman, Oege de Moor
2008 Proceedings of the 3rd workshop on Programming languages meets program verification - PLPV '09  
We argue that software refactoring tools are a prime candidate for mechanical verification, offering significant challenges but also the prospect of tangible benefits for real-world software development  ...  They are most useful for gradually improving large existing code bases and it is essential that they work reliably, since even a simple refactoring may affect many different parts of a program, and the  ...  If the correctness properties are simple enough, an intriguing possibility would be to use model checking techniques for automatic verification. Such an approach is taken by Estler et al.  ... 
doi:10.1145/1481848.1481859 dblp:conf/plpv/SchaferEM09 fatcat:e66bjrk4rjhcnhqzb4dmtznmpi

A Novel Methodology Based on Formal Methods for Analysis and Verification of Wikis

Giuseppe De Ruvo, Antonella Santone
2014 2014 IEEE 23rd International WETICE Conference  
Formal verification helps to perform refactoring.  ...  Each wiki category, a set of wiki pages, is modelled using the Calculus of Communicating Systems (CCS) process algebra in order to verify specific properties.  ...  [7] applied model checking techniques to perform automated verification of the UML design of web applications. Haydar et al.  ... 
doi:10.1109/wetice.2014.25 dblp:conf/wetice/RuvoS14a fatcat:35gtfwejurcztn7v6w4vyvus7e
« Previous Showing results 1 — 15 out of 982 results