Log in

Relevant bibliographies by topics / Veriflex

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Veriflex'

Author: Grafiati

Published: 4 June 2021

Last updated: 19 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Veriflex.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Veriflex"

1

Yaşa, Dilek, and Alper Ağca. "Verisyse versus Veriflex Phakic Intraocular Lenses: Refractive Outcomes and Endothelial Cell Density 5 Years after Surgery." Journal of Ophthalmology 2018 (September 30, 2018): 1–8. http://dx.doi.org/10.1155/2018/4210460.

Full text

Abstract:

Purpose. To compare refractive stability, central endothelial cell density (ECD), and complications between Verisyse (Abbott Medical Optics, Netherlands) and Veriflex (Abbott Medical Optics, Netherlands) phakic intraocular lenses (pIOL) over five years.Methods. We retrospectively reviewed the medical records of patients who underwent Verisyse or Veriflex pIOL implantation for surgical correction of myopia. Patients with a 5-year follow-up period were included in the study. Uncorrected distance visual acuity (UDVA), corrected distance visual acuity (CDVA), spherical equivalent of manifest refraction (SE), and ECD were compared between the groups preoperatively and 1, 3, and 5 years postoperatively.Results. The study included 47 eyes in the Verisyse group and 50 eyes in the Veriflex group. There was no significant difference in mean SE, UDVA, CDVA, and ECD preoperatively or postoperatively. In both groups, there was a statistically significant myopic shift between 1-year and 5-year visits (−0.25 ± 0.30 D and −0.23 ± 0.48 D in the Verisyse and Veriflex groups, respectively). There was no significant difference between the groups in terms of efficacy and safety indexes at 5 years. ECD loss was highest during the first year (3.9% loss in the Verisyse group and 3.9% loss in the Veriflex group,p=0.670). At 5 years, the mean cumulative ECD losses in the Verisyse and Veriflex groups were 7.42% and 7.64%, respectively (p=0.709). Cataracts developed in 2.1% of the eyes in the Verisyse group and in 2.0% of those in the Veriflex group. No sight-threatening complications were observed.Conclusion. Verisyse and Veriflex pIOLs are highly effective for treating high myopia up to 5 years after surgery. Longitudinal studies with longer follow-up periods are necessary to determine the endothelial safety profile.

APA, Harvard, Vancouver, ISO, and other styles

2

McClung, Amber J. W., Gyaneshwar P. Tandon, and Jeffery W. Baur. "Deformation rate-, hold time-, and cycle-dependent shape-memory performance of Veriflex-E resin." Mechanics of Time-Dependent Materials 17, no. 1 (November 19, 2011): 39–52. http://dx.doi.org/10.1007/s11043-011-9157-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pjano, Melisa, Alma Biscevic, Senad Grisevic, Ajla Pidro, Mirko Ratkovic, Maja Bohac, Amila Husovic, and Refet Gojak. "One Year Follow-Up After Veriflex Phakic Intraocular Lenses Implantation for Correction of Myopia." Acta Informatica Medica 24, no. 3 (2016): 178. http://dx.doi.org/10.5455/aim.2016.24.178-181.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Awadein, Ahmed, and Ahmed E. Habib. "ICL Versus Veriflex Phakic IOL for Treatment of Moderately High Myopia: Randomized Paired-Eye Comparison." Journal of Refractive Surgery 29, no. 7 (July 1, 2013): 445–52. http://dx.doi.org/10.3928/1081597x-20130617-02.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Butaud, P., V. Placet, J. Klesa, M. Ouisse, E. Foltête, and X. Gabrion. "Investigations on the frequency and temperature effects on mechanical properties of a shape memory polymer (Veriflex)." Mechanics of Materials 87 (August 2015): 50–60. http://dx.doi.org/10.1016/j.mechmat.2015.04.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chowdhury, A. M. Sarwaruddin, Christina Schmidt, Klaus Neuking, and Gunther Eggeler. "Comparative studies on the accumulation of strain and recovery ratio of Veriflex®, a shape-memory polymer." High Performance Polymers 25, no. 8 (May 30, 2013): 886–93. http://dx.doi.org/10.1177/0954008313487929.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

McClung, Amber J. W., Gyaneshwar P. Tandon, and Jeffery W. Baur. "Strain rate- and temperature-dependent tensile properties of an epoxy-based, thermosetting, shape memory polymer (Veriflex-E)." Mechanics of Time-Dependent Materials 16, no. 2 (August 6, 2011): 205–21. http://dx.doi.org/10.1007/s11043-011-9148-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bohac, Maja, Marija Anticic, Natasa Draca, Bojan Kozomara, Iva Dekaris, Nikica Gabric, and Sudi Patel. "Comparison of Verisyse and Veriflex Phakic Intraocular Lenses for Treatment of Moderate to High Myopia 36 Months after Surgery." Seminars in Ophthalmology 32, no. 6 (August 3, 2016): 725–33. http://dx.doi.org/10.3109/08820538.2016.1170163.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chowdhury, A. M. Sarwaruddin, Christina Schmidt, Klaus Neuking, and Gunther Eggeler. "Comparative Studies on Thermomechanical Behavior of Veriflex®, a Shape Memory Polymer, for a Low Strain (ϵm= 70%): Laser Experiments." Journal of Macromolecular Science, Part A 48, no. 9 (September 2011): 707–12. http://dx.doi.org/10.1080/10601325.2011.596049.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Kondratyev, D. A., and A. V. Promsky. "Towards the ’Verified Verifier’. Theory and Practice." Modeling and Analysis of Information Systems 21, no. 6 (January 1, 2014): 71–82. http://dx.doi.org/10.18255/1818-1015-2014-6-71-82.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Veriflex"

1

Wildmoser, Martin. "Verified proof carrying code." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=980401208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Klein, Gerwin. "Verified Java bytecode verification." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=967128749.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bujila, Razvan, and Johan Kuru. "OMSI Test Suite verifier development." Thesis, Linköpings universitet, Institutionen för teknik och naturvetenskap, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-96266.

Full text

Abstract:

The purpose of the Open Mobile Service Interface (OMSI) is to simplify the device management process for mobile devices from different manufacturers with a single PC application, instead of using one unique application for every manufacturer. The different OMSI use cases include device management for application vendors, points-of-sale, repair centers or for self-service. This will lead to higher service level for end users, faster repair times, better control over service transactions, an open market for compatible applications and an easy plug-and-play installation. Manufacturers are currently in the process of developing their own specific modules and there is an increasing need for test and verification software to certify OMSI conformance. In order for phone manufacturers to be able to efficiently verify that their OMSI modules and catalogs support and comply with the OMSI standard, there is a need for automated module tests and manual catalog tests. Development of such tests is the main purpose of this Master thesis work. The implementation of the different verification processes have been divided into different sub-projects to create a more structured view of the OMSI Test Suite project and easier management. The first part of the thesis work deals with the module verification process, second part with the client verification process while the third and final part deals with the catalog verification process. The thesis work has been performed in a project form, where the development of the project plan was a part of the thesis work. The final version of the Module Interface Verifier was implemented in C#, in a Visual Studio .NET 2003 environment. The software functioned as expected, both towards a sample module and Sony Ericsson’s and Nokia’s respective modules. The Client Interface Verifier was developed in a C++ environment and functioned according to the given specifications. The Catalog Interface Verifier was developed in C# environment, built on an already existing part of the OMSI Implementation Framework.

APA, Harvard, Vancouver, ISO, and other styles

4

Spiwack, Arnaud. "Verified computing in homological algebra." Palaiseau, Ecole polytechnique, 2011. http://pastel.archives-ouvertes.fr/docs/00/60/58/36/PDF/thesis.spiwack.pdf.

Full text

Abstract:

L'objet de cette thèse est d'étudier les capacités du système Coq à mélanger démonstrations et programmes en pratique en essayant d'y implémenter une part du programme Kenzo, un outil de calcul formel en algèbre homologique. À cet effet, nous travaillons sous trois contrainte: nous voulons essayer de lire le programme comme une démonstration avec un contenu calculatoire, ces démonstrations doivent calculer efficacement et nous cherchons à éviter de dupliquer des morceaux de démonstration. Nous montrons dans un premier temps comment le soucis d'efficacité conduit à reconsidérer certains aspects des mathématiques traditionnelle. Nous proposons une abstraction catégorielle adaptée, qui répond à la fois à un soucis de clareté et au besoin de partager les démonstration quand c'est possible. Cette abstraction, bien que différente des propositions traditionnelles, permet de formuler les notions d'algèbre homologique dans un style proche de celui de Kenzo. Nous proposons par ailleurs des modifications au programme de Coq pour rendre les démonstrations plus confortables, et pour permettre d'écrire des programmes plus efficaces. La première modification permet d'utiliser des tactiques plus fines, souvent nécessaire quand l'utilisation des types dépendents se fait commune. La seconde permet d'utiliser les capacité du processeur pour faire des calculs plus efficaces sur des entiers. Pour finir nous proposons quelques pistes pour améliorer le partage et la clareté du code. Malheureusement, nous nous heurtons aux limites du système. Nous montrons ainsi que Coq ne tiens pas forcément ses promesses et qu'il y aura besoin de travaux théoriques pour comprendre comment lever ces limites
The object of this thesis is the study of the ability of the Coq system to mix proofs and programs in practice. Our approach consists in implementing part of the program Kenzo, a computer algebra tool for homological algebra under some constraint. We want to be able to read the program as a proof with a computational content, these proofs much compute efficiently, and we try to avoid duplication of proofs or part thereof. We show, first, how the requirement of efficiency leads to revise some aspects of traditional mathematics. We propose a suitable categorical abstraction, both for clarity and to avoid duplications. This abstraction, though different from what is customary in mathematics, allow to formulate the constructs of homological algebra in a style much like that of Kenzo. We propose, then, modifications to the Coq programm. A first one to make proofs more convenient, by allowing the use of more fine grain tactics which are often necessary when dependent types are common. The second modification to leverage the arithmetical abilities of the processor to compute more efficiently on integers. Finally, we propose some leads to improve both sharing and clarity of the proofs. Unfortunately, they push the system beyond its limits. Hence, we show that Coq is not always up to its promises and that theoretical works will be necessary to understand how these limits can be relaxed

APA, Harvard, Vancouver, ISO, and other styles

5

Boehm, Peter. "Incremental modelling for verified communication architectures." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:ec6c9e06-7395-4af4-b961-b2ed837fda89.

Full text

Abstract:

Modern computer systems are advancing from multi-core to many-core designs and System-on-chips (SoC) are becoming increasingly complex while integrating a great variety of components, thus constituting complex distributed systems. Such architectures rely on extremely complex communication protocols to exchange data with required performance. Arguing formally about the correctness of communication is an acknowledged verification challenge. This thesis presents a generic framework that formalises the idea of incremental modelling and step-wise verification to tackle this challenge: to control the overall complexity, features are added incrementally to a simple initial model and the complexity of each feature is encapsulated into an independent modelling step. Two main strategies reduce the verification effort. First, models are constructed with verification support in mind and the verification process is spread over the modelling process. Second, generic correctness results for framework components allow the verification to be reduced to discharging local assumptions when a component is instantiated. Models in the framework are based on abstract state machines formalised in higher order logic using the Isabelle theorem prover. Two case studies show the utility and breadth of the approach: the ARM AMBA Advanced High-performance Bus protocol, an arbiter-based master-slave bus protocol, represents the family of SoC protocols; the PCI Express protocol, an off-chip point-to-point protocol, illustrates the application of the framework to sophisticated, performance-related features of current and future on-chip protocols. The presented methodology provides an alternative to the traditional monolithic and post-hoc verification approach.

APA, Harvard, Vancouver, ISO, and other styles

6

Katz, Theodore(Theodore Robert). "Verified compilation of abstract network policies." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/123032.

Full text

Abstract:

This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 67-68).
Configuring large networks can be very complex. A network administrator typically has a set of high-level policies in mind when creating a network configuration, but implementing the configuration onto existing hardware often requires specifying many low-level details. As a result, configuring a network is currently a very error-prone process, and misconfigurations resulting in network outages and security vulnerabilities occur frequently in practice. We present a formally verified compiler from high-level network policies to low-level executable routing rules, to simplify the process of correctly conguring networks and enforcing network policies.
by Theodore Katz.
M. Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science

APA, Harvard, Vancouver, ISO, and other styles

7

Adcock, Bruce M. "Working Towards the Verified Software Process." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1293463269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Perna, Juan Ignacio. "A verified compiler for Handel-C." Thesis, University of York, 2010. http://etheses.whiterose.ac.uk/585/.

Full text

Abstract:

The recent popularity of Field Programmable Gate Array (FPGA) technology has made the synthesis of Hardware Description Language (HDL) programs into FPGAs a very attractive topic for research. In particular, the correctness in the synthesis of an FPGA programming file from a source HDL program has gained significant relevance in the context of safety or mission-critical systems. The results presented here are part of a research project aiming at producing a verified compiler for the Handel-C language. Handel-C is a high level HDL based on the syntax of the C language extended with constructs to deal with parallel behaviour and process communications based on CSP. Given the complexity of designing a provably correct compiler for a language like Handel-C, we have adopted the algebraic approach to compilation as it oers an elegant solution to this problem. The idea behind algebraic compilation is to create a sound reasoning framework in which the a formal model of the source Handel-C program can be embedded and refined into a formal abstraction of the target hardware. As the algebraic rules used to compile the program are proven to preserve the semantics, the correctness of the entire compilation process (i.e., semantic equivalence between source and target programs) can be argued by construction, considering each programming construct in isolation, rather than trying to assert the correctness of the compilation in a single step. Regarding hardware synthesis, the algebraic approach has already been applied to subsets of Occam and Verilog. Our work builds on some ideas from these works but focuses on the more complex timing model imposed by Handel-C. Moreover, our work covers features like shared variables, multi-way communications and priorities which, to our knowledge, have never been addressed within the framework of algebraic compilation. Finally, one characteristic of the algebraic approach is that the basic reduction laws in the reasoning framework are postulated as axioms. As an invalid axiom would allow us to prove invalid results (up to the extent of being able to prove a false theorem) we are also concerned about the consistency of the basic postulates in our theory. We addressed this by providing denotational semantics for Handel-C and its reasoning extensions in the context of the Unifying Theories of Programming (UTP). Our UTP denotational semantics not only provided a model for our theory (hence, proving its consistency) but also allowed us to prove all the axioms in the compilation framework.

APA, Harvard, Vancouver, ISO, and other styles

9

Owny, Hassan Badry Mohamed el. "Verified solution of parametric interval linear systems." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=985111623.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Thaler, Justin R. "Practical Verified Computation with Streaming Interactive Proofs." Thesis, Harvard University, 2013. http://dissertations.umi.com/gsas.harvard:11086.

Full text

Abstract:

As the cloud computing paradigm has gained prominence, the need for verifiable computation has grown urgent. Protocols for verifiable computation enable a weak client to outsource difficult computations to a powerful, but untrusted, server. These protocols provide the client with a (probabilistic) guarantee that the server performed the requested computations correctly, without requiring the client to perform the computations herself.
Engineering and Applied Sciences

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Veriflex"

1

Hunt, Warren A. FM8501, a verified microprocessor. Berlin: Springer-Verlag, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hunt, Warren A., ed. FM8501: A Verified Microprocessor. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-57960-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Meyer, Bertrand, and Jim Woodcock, eds. Verified Software: Theories, Tools, Experiments. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-69149-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Shankar, Natarajan, and Jim Woodcock, eds. Verified Software: Theories, Tools, Experiments. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-87873-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Leavens, Gary T., Peter O’Hearn, and Sriram K. Rajamani, eds. Verified Software: Theories, Tools, Experiments. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15057-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cohen, Ernie, and Andrey Rybalchenko, eds. Verified Software: Theories, Tools, Experiments. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54108-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Joshi, Rajeev, Peter Müller, and Andreas Podelski, eds. Verified Software: Theories, Tools, Experiments. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27705-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zumpf, Michel. L' art de verifier les dates. Gent: Imschoot, uitgevers, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kulisch, Ulrich, Rolf Hammer, Matthias Hocks, and Dietmar Ratz. C++ Toolbox for Verified Computing I. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-642-79651-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Giannakopoulou, Dimitra, and Daniel Kroening, eds. Verified Software: Theories, Tools and Experiments. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12154-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Veriflex"

1

Lee, Juneyoung, Chung-Kil Hur, and Nuno P. Lopes. "AliveInLean: A Verified LLVM Peephole Optimization Verifier." In Computer Aided Verification, 445–55. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25543-5_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Weik, Martin H. "verifier." In Computer Science and Communications Dictionary, 1886. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_20722.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Subedi, D. B. "Verified." In Combatants to Civilians, 129–62. London: Palgrave Macmillan UK, 2018. http://dx.doi.org/10.1057/978-1-137-58672-8_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Quiring, Benjamin, and Panagiotis Manolios. "GACAL: Conjecture-Based Verification." In Tools and Algorithms for the Construction and Analysis of Systems, 388–92. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45237-7_26.

Full text

Abstract:

Abstract GACAL verifies C programs by searching over the space of possible invariants, using traces of the input program to identify potential invariants. GACAL uses the ACL2s theorem prover to verify these potential invariants, using an interface provided by ACL2s for connecting with external tools. GACAL iteratively searches for and proves invariants of increasing complexity until the program is verified.

APA, Harvard, Vancouver, ISO, and other styles

5

Joyce, Jeffrey J. "Totally verified systems: Linking verified software to verified hardware." In Hardware Specification, Verification and Synthesis: Mathematical Aspects, 177–201. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/0-387-97226-9_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Beyer, Dirk, and Marie-Christine Jakobs. "FRed: Conditional Model Checking via Reducers and Folders." In Software Engineering and Formal Methods, 113–32. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58768-0_7.

Full text

Abstract:

Abstract There are many hard verification problems that are currently only solvable by applying several verifiers that are based on complementing technologies. Conditional model checking (CMC) is a successful solution for cooperation between verification tools. In CMC, the first verifier outputs a condition describing the state space that it successfully verified. The second verifier uses the condition to focus its verification on the unverified state space. To use arbitrary second verifiers, we recently proposed a reducer-based approach. One can use the reducer-based approach to construct a conditional verifier from a reducer and a (non-conditional) verifier: the reducer translates the condition into a residual program that describes the unverified state space and the verifier can be any off-the-shelf verifier (that does not need to understand conditions). Until now, only one reducer was available. But for a systematic investigation of the reducer concept, we need several reducers. To fill this gap, we developed FRed, a Framework for exploring different REDucers. Given an existing reducer, FRed allows us to derive various new reducers, which differ in their trade-off between size and precision of the residual program. For our experiments, we derived seven different reducers. Our evaluation on the largest and most diverse public collection of verification problems shows that we need all seven reducers to solve hard verification tasks that were not solvable before with the considered verifiers.

APA, Harvard, Vancouver, ISO, and other styles

7

Platzer, André. "Verified Models & Verified Runtime Validation." In Logical Foundations of Cyber-Physical Systems, 557–75. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63588-0_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Havelund, Klaus, and Rahul Kumar. "Verified Change." In Transactions on Foundations for Mastering Change I, 71–89. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46508-1_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Leino, K. Rustan M., and Nadia Polikarpova. "Verified Calculations." In Verified Software: Theories, Tools, Experiments, 170–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54108-7_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Klein, Gerwin. "From a Verified Kernel towards Verified Systems." In Programming Languages and Systems, 21–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17164-2_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Veriflex"

1

McClung, Amber J. W., Joseph A. Shumaker, and Jeffery W. Baur. "Novel Bismaleimide-Based Shape Memory Polymers: Comparison to Commercial Shape Memory Polymers." In ASME 2011 Conference on Smart Materials, Adaptive Structures and Intelligent Systems. ASMEDC, 2011. http://dx.doi.org/10.1115/smasis2011-5044.

Full text

Abstract:

A series of novel shape memory polymers, synthesized from 4-4-bismaleimidodiphenyl-methane, an extended chain aliphatic diamine, and a bis-isocyanate, have been created and characterized with the aim of providing a family of robust high temperature shape memory polymers with tailorable transition temperatures for use in reconfigurable aerospace structures. In the present study, three of the polymers are chosen for more detailed study of their thermomechanical properties. These materials are compared to commercial resins Veriflex® and Veriflex-E® which are styrene- and epoxy-based proprietary formulations, respectively. The thermal and mechanical properties are determined utilizing thermogravimetric analysis and dynamic mechanical analysis. The temperatures at which 2% weight loss is observed in dry air ranges from 272 to 305 °C for the synthesized polymers, and occurs at 242 and 317 °C for the commercial Veriflex® and Veriflex-E® respectively. The glass transition temperatures, as measured by the peak in the tan(δ) curve, for the synthesized polymers range from 110 to 144 °C which is a higher than the Veriflex® and Veriflex-E® achieve at 84.3 and 100 °C respectively. With operation temperatures of subsonic structural aircraft components often reaching 121 °C (250 °F), the transition temperatures of the bismaleimide-based shape memory polymers are clearly desirable to ensure that shape memory polymers used in aircraft structures will not be prematurely triggered by the existing heat loads. In addition, the shape memory performance of the bismaleimide-based shape memory polymers compares well with the Veriflex® and Veriflex-E® resins.

APA, Harvard, Vancouver, ISO, and other styles

2

McClung, A. J. W., G. P. Tandon, and J. W. Baur. "The Strain Rate- and Temperature-Dependent Mechanical Behavior of Veriflex-E in Tension." In ASME 2010 Conference on Smart Materials, Adaptive Structures and Intelligent Systems. ASMEDC, 2010. http://dx.doi.org/10.1115/smasis2010-3674.

Full text

Abstract:

In this study, the inelastic deformation behavior of Veriflex-E, a thermally-triggered shape memory polymer resin, was investigated. The experimental program was designed to explore the influence of strain rate on monotonic loading at various temperatures. In addition, the creep behavior of specimens at various temperatures was evaluated. The time-dependent mechanical behavior of the Veriflex-E resin is strongly influenced by the temperature as well as the deformation rate. Thermally-actuated shape memory polymers can be thought of as having two phases separated by the glass transition temperature (Tg). At temperatures well below the Tg (room temperature), the Veriflex-E exhibits a high elastic modulus and positive, nonlinear strain rate sensitivity in monotonic loading. Likewise, the room temperature creep response is significantly influenced by the prior strain rate. The Poisson’s ratio at room temperature is independent of the strain rate, but dependent upon the strain magnitude. As the temperature is increased, the strain rate sensitivity in monotonic loading decreases. Well above the Tg, the elastic modulus drops by several orders of magnitude, and strong strain rate sensitivity is no longer observed in the path of the stress-strain curve. In this high temperature region, the material achieves strain levels well above 100% and the Poisson’s ratio is constant at 0.5 regardless of strain rate or strain magnitude. The creep strain, on the other hand, is significantly influenced by the prior strain rate at the elevated temperature. A slight hysteresis is observed during unloading, while recovery following unloading shows a permanent strain.

APA, Harvard, Vancouver, ISO, and other styles

3

Klesa, J., V. Placet, E. Foltête, and M. Collet. "Experimental Evaluation of the Rheological Properties of Veriflex®Shape Memory Polymer." In ESOMAT 2009 - 8th European Symposium on Martensitic Transformations. Les Ulis, France: EDP Sciences, 2009. http://dx.doi.org/10.1051/esomat/200904006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Beblo, Richard, and Lisa Mauck Weiland. "Polymer Chain Alignment in Shape Memory Polymer." In ASME 2006 International Mechanical Engineering Congress and Exposition. ASMEDC, 2006. http://dx.doi.org/10.1115/imece2006-13703.

Full text

Abstract:

Since their development, shape memory polymers, urethanes, styrenes, and the like, have been of increasing interest in advanced material and structure design. The following is an experimental investigation into the effect polymer chain alignment has on the mechanical properties of a particular styrene shape memory polymer, Veriflex®. Aligning the polymer chains results in several material anisotropies; giving rise to the possibility of controllable, directional shape memory and modulus behavior and a basis for a multitude of prospective design concepts.

APA, Harvard, Vancouver, ISO, and other styles

5

Gross, Korey, and Lisa Weiland. "Flexural Testing of Shape Memory Polymers for Morphing Aircraft Applications." In ASME 2007 International Mechanical Engineering Congress and Exposition. ASMEDC, 2007. http://dx.doi.org/10.1115/imece2007-43219.

Full text

Abstract:

Shape memory polymers (SMPs) have garnered significant attention in recent years for their potential to return to a “memorized” state when warmed above their glass transition temperature Tg. However, they also have potential in morphing aircraft applications because of their significant modulus change above and below Tg. Much less energy is required to deform this material when in its soft state, but when the material returns to the hard state, it is able to support significant loads. In the proposed effort, SMP is experimentally considered as a candidate material for morphing aircraft applications where the material’s ability to support out of plane loads above and below the Tg is of primary importance. The SMP of study in the work is Veriflex®.

APA, Harvard, Vancouver, ISO, and other styles

6

Khurshid, Ahmed, Wenxuan Zhou, Matthew Caesar, and P. Brighten Godfrey. "VeriFlow." In the first workshop. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2342441.2342452.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lööw, Andreas, Ramana Kumar, Yong Kiam Tan, Magnus O. Myreen, Michael Norrish, Oskar Abrahamsson, and Anthony Fox. "Verified compilation on a verified processor." In PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3314221.3314622.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Xie, Fei, and James C. Browne. "Verified systems by composition from verified components." In the 9th European software engineering conference held jointly with 10th ACM SIGSOFT international symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/940071.940109.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kiniry, Joseph R., and Daniel M. Zimmerman. "Verified gaming." In Proceeding of the 1st international workshop. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1984674.1984681.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Leroy, Xavier. "Verified squared." In the 38th annual ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1926385.1926387.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Veriflex"

1

Manna, Zohar, and Amir Pnueli. Tools and Rules for the Practicing Verifier. Fort Belvoir, VA: Defense Technical Information Center, July 1990. http://dx.doi.org/10.21236/ada227320.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cheung, Alvin. Using Verified Lifting to Optimize Legacy Stencil Codes. Office of Scientific and Technical Information (OSTI), February 2021. http://dx.doi.org/10.2172/1765083.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Rushby, John. Formally Verified Hardware Encapsulation Mechanism for Security, Integrity, and Safety. Fort Belvoir, VA: Defense Technical Information Center, April 2002. http://dx.doi.org/10.21236/ada403303.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Uhrich, Richard, and James Walton. Supervisory Control of Untethered Undersea Systems: A New Paradigm Verified. Fort Belvoir, VA: Defense Technical Information Center, September 1995. http://dx.doi.org/10.21236/ada422529.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Moreno, Silvana, Alvaro Tasistro, Diego Vallespir, and William Nichols. PSPVDC: An Adaptation of the PSP that Incorporates Verified Design by Contract. Fort Belvoir, VA: Defense Technical Information Center, May 2013. http://dx.doi.org/10.21236/ada610477.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Xiang, Guang, Bryan A. Pendleton, and Jason Hong. Modeling Content from Human-Verified Blacklists for Accurate Zero-Hour Phish Detection. Fort Belvoir, VA: Defense Technical Information Center, January 2009. http://dx.doi.org/10.21236/ada530899.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ramsey, Norman. Penelope: An Ada Verification Environment, Developing Formally Verified Ada Programs. Volume 1. Fort Belvoir, VA: Defense Technical Information Center, November 1991. http://dx.doi.org/10.21236/ada249417.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Eldred, Michael Scott, Samuel Ramirez Subia, David Neckels, Matthew Morgan Hopkins, Patrick K. Notz, Brian M. Adams, Brian Carnes, Jonathan W. Wittwer, Barron J. Bichon, and Kevin D. Copps. Solution-verified reliability analysis and design of bistable MEMS using error estimation and adaptivity. Office of Scientific and Technical Information (OSTI), October 2006. http://dx.doi.org/10.2172/896282.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Chevassut, Olivier, Joseph Milner, and David Pointcheval. Security Proof for Password Authentication in TLS-Verifier-based Three-Party Group Diffie-Hellman. Office of Scientific and Technical Information (OSTI), April 2008. http://dx.doi.org/10.2172/948495.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Srinivasan, Grama R., and David P. Gluch. A Study of Practice Issues in Model-Based Verification Using the Symbolic Model Verifier (SMV). Fort Belvoir, VA: Defense Technical Information Center, November 1998. http://dx.doi.org/10.21236/ada358751.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!