Accedi

Bibliografie tematiche / Refinement and proof

Indice

Articoli di riviste
Tesi
Libri
Capitoli di libri
Atti di convegni
Rapporti di organizzazioni

Letteratura scientifica selezionata sul tema "Refinement and proof"

Autore: Grafiati

Pubblicato: 31 agosto 2024

Ultima modifica: 31 luglio 2025

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Refinement and proof".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Refinement and proof"

1

Schellhorn, Gerhard. "Verification of ASM Refinements Using Generalized Forward Simulation." JUCS - Journal of Universal Computer Science 7, no. (11) (2001): 952–79. https://doi.org/10.3217/jucs-007-11-0952.

Testo completo

Abstract (sommario):

This paper describes a generic proof method for the correctness of refinements of Abstract State Machines based on commuting diagrams. The method generalizes forward simulations from the refinement of I/O automata by allowing arbitrary m:n diagrams, and by combining it with the refinement of data structures.

Gli stili APA, Harvard, Vancouver, ISO e altri

2

Mulder, Ike, and Robbert Krebbers. "Proof Automation for Linearizability in Separation Logic." Proceedings of the ACM on Programming Languages 7, OOPSLA1 (2023): 462–91. http://dx.doi.org/10.1145/3586043.

Testo completo

Abstract (sommario):

Recent advances in concurrent separation logic enabled the formal verification of increasingly sophisticated fine-grained ( i.e. , lock-free) concurrent programs. For such programs, the golden standard of correctness is linearizability , which expresses that concurrent executions always behave as some valid sequence of sequential executions. Compositional approaches to linearizability (such as contextual refinement and logical atomicity) make it possible to prove linearizability of whole programs or compound data structures ( e.g. , a ticket lock) using proofs of linearizability of their indiv

Gli stili APA, Harvard, Vancouver, ISO e altri

3

Brucker, Achim, Frank Rittinger, and Burkhart Wolff. "HOL-Z 2.0: A Proof Environment for Z-Specifications." JUCS - Journal of Universal Computer Science 9, no. (2) (2003): 152–72. https://doi.org/10.3217/jucs-009-02-0152.

Testo completo

Abstract (sommario):

We present a new proof environment for the specification language Z. The basis is a semantic representation of Z in a structure-preserving, shallow embedding in Isabelle/HOL. On top of the embedding, new proof support for the Z schema calculus and for proof structuring are developed. Thus, we integrate Z into a well-known and trusted theorem prover with advanced deduction technology such as higher-order rewriting, tableaux-based provers and arithmetic decision procedures. A further achievement of this work is the integration of our embedding into a new tool-chain providing a Z-oriented type ch

Gli stili APA, Harvard, Vancouver, ISO e altri

4

Song, Youngju, and Dongjae Lee. "Refinement Composition Logic." Proceedings of the ACM on Programming Languages 8, ICFP (2024): 573–601. http://dx.doi.org/10.1145/3674645.

Testo completo

Abstract (sommario):

One successful approach to verifying programs is refinement, where one establishes that the implementation (e.g., in C) behaves as specified in its mathematical specification. In this approach, the end result (a whole implementation refines a whole specification) is often established via composing multiple “small” refinements. In this paper, we focus on the task of composing refinements. Our key observation is a novel correspondence between the task of composing refinements and the task of proving entailments in modern separation logic. This correspondence is useful. First, it unlocks tools an

Gli stili APA, Harvard, Vancouver, ISO e altri

5

Schellhorn, Gerhard, and Wolfgang Ahrendt. "Reasoning about Abstract State Machines: The WAM Case Study." JUCS - Journal of Universal Computer Science 3, no. (4) (1997): 377–413. https://doi.org/10.3217/jucs-003-04-0377.

Testo completo

Abstract (sommario):

This paper describes the first half of the formal verification of a Prolog compiler with the KIV ("Karlsruhe Interactive Verifier") system. Our work is based on [BR95], where an operational Prolog semantics is defined using the formalism of Gurevich Abstract State Machines, and then refined in several steps to the Warren Abstract Machine (WAM). We define a general translation of sequential Abstract State Machines to Dynamic Logic, which formalizes correctness of such refinement steps as a deduction problem. A proof technique for verification is presented, which corresponds to the informal use

Gli stili APA, Harvard, Vancouver, ISO e altri

6

Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. "Verifying correctness of persistent concurrent data structures: a sound and complete method." Formal Aspects of Computing 33, no. 4-5 (2021): 547–73. http://dx.doi.org/10.1007/s00165-021-00541-8.

Testo completo

Abstract (sommario):

AbstractNon-volatile memory (NVM), aka persistent memory, is a new memory paradigm that preserves its contents even after power loss. The expected ubiquity of NVM has stimulated interest in the design of persistent concurrent data structures, together with associated notions of correctness. In this paper, we present a formal proof technique for durable linearizability, which is a correctness criterion that extends linearizability to handle crashes and recovery in the context ofNVM.Our proofs are based on refinement of Input/Output automata (IOA) representations of concurrent data structures. T

Gli stili APA, Harvard, Vancouver, ISO e altri

7

Bohrer, Brandon, and André Platzer. "Structured Proofs for Adversarial Cyber-Physical Systems." ACM Transactions on Embedded Computing Systems 20, no. 5s (2021): 1–26. http://dx.doi.org/10.1145/3477024.

Testo completo

Abstract (sommario):

Many cyber-physical systems (CPS) are safety-critical, so it is important to formally verify them, e.g. in formal logics that show a model’s correctness specification always holds. Constructive Differential Game Logic ( CdGL ) is such a logic for (constructive) hybrid games, including hybrid systems. To overcome undecidability, the user first writes a proof, for which we present a proof-checking tool. We introduce Kaisar , the first language and tool for CdGL proofs, which until now could only be written by hand with a low-level proof calculus. Kaisar’s structured proofs simplify challenging C

Gli stili APA, Harvard, Vancouver, ISO e altri

8

Mylonakis, Nikos. "Proof Assistance for Refinement in Type Theory." Electronic Notes in Theoretical Computer Science 37 (2000): 1–21. http://dx.doi.org/10.1016/s1571-0661(05)01134-5.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

9

Peng, Jie, Tangliu Wen, Yiguo Yang, and Guoming Huang. "An Event-B Approach to the Development of Fork/Join Parallel Programs." EAI Endorsed Transactions on AI and Robotics 1 (February 18, 2022): 1–6. http://dx.doi.org/10.4108/airo.v1i.16.

Testo completo

Abstract (sommario):

Fork/Join is a simple but effective technique for exploiting the parallelism. When developing a parallel program using Fork/Join, one of the main things is how a large task is decomposed into subtasks whose results can be combined as a final result. In this paper we show how to develop Fork/Join parallel programs through refinement and decomposition. We take Fork/Join style task decomposition as a refinement which we call Fork/Join refinement. Proof obligations of refinement can ensure the correctness of decomposition. For practical application, we provide a refinement pattern for the Fork/Joi

Gli stili APA, Harvard, Vancouver, ISO e altri

10

Farissi, Abdallah El. "Simple proof and refinement of Hermite-Hadamard inequality." Journal of Mathematical Inequalities, no. 3 (2010): 365–69. http://dx.doi.org/10.7153/jmi-04-33.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Tesi sul tema "Refinement and proof"

1

Pratten, Chris H. "Refinement in a language with procedures and modules." Thesis, University of Southampton, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.243120.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

2

Riviere, Peter. "Génération automatique d’obligations de preuves paramétrée par des théories de domaine dans Event-B : Le cadre de travail EB4EB." Electronic Thesis or Diss., Université de Toulouse (2023-....), 2024. http://www.theses.fr/2024TLSEP052.

Testo completo

Abstract (sommario):

De nos jours, nous sommes entourés de systèmes critiques complexes tels que les microprocesseurs, les trains, les appareils intelligents, les robots, les avions, etc. Ces systèmes sont extrêmement complexes et critiques en termes de sûreté, et doivent donc être vérifiés et validés. L'utilisation de méthodes formelles à états s'est avérée efficace pour concevoir des systèmes complexes. Event-B a joué un rôle clé dans le développement de tels systèmes. Event-B est une méthode formelle de conception de systèmes à états avec une approche correcte par construction, qui met l'accent sur la preuve et

Gli stili APA, Harvard, Vancouver, ISO e altri

3

Ratiu, Diana. "Refinement of Classical Proofs for Program Extraction." Diss., lmu, 2011. http://nbn-resolving.de/urn:nbn:de:bvb:19-135054.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

4

Giorgino, Mathieu. "Inductive representation, proofs and refinement of pointer structures." Toulouse 3, 2013. http://thesesups.ups-tlse.fr/2076/.

Testo completo

Abstract (sommario):

Cette thèse s'intègre dans le domaine général des méthodes formelles qui donnent une sémantique aux programmes pour vérifier formellement des propriétés sur ceux-ci. Sa motivation originale provient d'un besoin de certification des systèmes industriels souvent développés à l'aide de l'Ingénierie Dirigée par les Modèles (IDM) et de langages orientés objets (OO). Pour transformer efficacement des modèles (ou graphes), il est avantageux de les représenter à l'aide de structures de pointeurs, économisant le temps et la mémoire grâce au partage qu'ils permettent. Cependant la vérification de propri

Gli stili APA, Harvard, Vancouver, ISO e altri

5

Graja, Zaineb. "Vérification formelle des systèmes multi-agents auto-adaptatifs." Thesis, Toulouse 3, 2015. http://www.theses.fr/2015TOU30105/document.

Testo completo

Abstract (sommario):

Un des défis majeurs pour le développement des Systèmes Multi-Agents (SMA) auto-organisateurs est de garantir la convergence du système vers la fonction globale attendue par un observateur externe et de garantir que les agents sont capables de s'adapter face aux perturbations. Dans la littérature, plusieurs travaux se sont basés sur la simulation et le model-checking pour analyser les SMA auto-organisateurs. La simulation permet aux concepteurs d'expérimenter plusieurs paramètres et de créer certaines heuristiques pour faciliter la conception du système. Le model-checking fournit un support po

Gli stili APA, Harvard, Vancouver, ISO e altri

6

Kherroubi, Souad. "Un cadre formel pour l'intégration de connaissances du domaine dans la conception des systèmes : application au formalisme Event-B." Thesis, Université de Lorraine, 2018. http://www.theses.fr/2018LORR0230/document.

Testo completo

Abstract (sommario):

Cette thèse vise à définir des techniques pour mieux exploiter les connaissances du domaine dans l’objectif de rendre compte de la réalité de systèmes qualifiés de complexes et critiques. La modélisation est une étape indispensable pour effectuer des vérifications et exprimer des propriétés qu’un système doit satisfaire. La modélisation est une représentation simplificatrice, mais réductionniste de la réalité d’un système. Or, un système complexe ne peut se réduire à un modèle. Un modèle doit s’intégrer dans sa théorie observationnelle pour rendre compte des anomalies qu’il peut y contenir. No

Gli stili APA, Harvard, Vancouver, ISO e altri

7

Ratiu, Diana [Verfasser], and Helmut [Akademischer Betreuer] Schwichtenberg. "Refinement of Classical Proofs for Program Extraction / Diana Ratiu. Betreuer: Helmut Schwichtenberg." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2011. http://d-nb.info/1015734464/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

8

Kherroubi, Souad. "Un cadre formel pour l'intégration de connaissances du domaine dans la conception des systèmes : application au formalisme Event-B." Electronic Thesis or Diss., Université de Lorraine, 2018. http://www.theses.fr/2018LORR0230.

Testo completo

Abstract (sommario):

Cette thèse vise à définir des techniques pour mieux exploiter les connaissances du domaine dans l’objectif de rendre compte de la réalité de systèmes qualifiés de complexes et critiques. La modélisation est une étape indispensable pour effectuer des vérifications et exprimer des propriétés qu’un système doit satisfaire. La modélisation est une représentation simplificatrice, mais réductionniste de la réalité d’un système. Or, un système complexe ne peut se réduire à un modèle. Un modèle doit s’intégrer dans sa théorie observationnelle pour rendre compte des anomalies qu’il peut y contenir. No

Gli stili APA, Harvard, Vancouver, ISO e altri

9

Ledang, Hung. "Traduction systématique de spécifications." Nancy 2, 2002. http://www.theses.fr/2002NAN22004.

Testo completo

Abstract (sommario):

La dérivation des spécifications UML vers B est considérée comme une approche appropriée afin d'utiliser conjointement UML et B dans un développement unifié, pratique, rigoureux de logiciels. D'une part, cette dérivation permet d'utiliser les spécifications UML comme point de départ pour développer les spécifications B. D'autre part, il est possible d'utiliser les outils supports puissants de B comme AtelierB pour analyser les spécifications B dérivées afin d'identifier les défauts au sein de spécifications UML. Cette thèse s'est concentrée sur la dérivation vers B pour les diagrammes d'intera

Gli stili APA, Harvard, Vancouver, ISO e altri

10

Carvalho, Luís. "Three essays on game theory and bargaining." Doctoral thesis, NSBE - UNL, 2014. http://hdl.handle.net/10362/11851.

Testo completo

Abstract (sommario):

A PhD Dissertation, presented as part of the requirements for the Degree of Doctor of Philosophy from the NOVA - School of Business and Economics<br>Equilibrium Outcomes of Repeated Two-Person Zero-Sum Games - We consider discounted repeated two-person zero-sum games. We show that even when players have different discount factors (in which case the repeated game is not a zero-sum game), an outcome is subgame perfect if and only if all of its components are Nash equilibria of the stage game. This implies that in all subgame perfect equilibria, each player's payoff is equal to his minmax p

Gli stili APA, Harvard, Vancouver, ISO e altri

Libri sul tema "Refinement and proof"

1

1966-, Engelhardt Kai, and Buth Karl-Heinz, eds. Data refinement: Model-oriented proof methods and their comparison. Cambridge University Press, 1998.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

2

Roever, W. P. de. Data refinement: Model-oriented proof methods and their comparison. Cambridge University Press, 2009.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

3

Abstraction, Refinement and Proof for Probabilistic Systems. Springer-Verlag, 2005. http://dx.doi.org/10.1007/b138392.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

4

McIver, Annabelle, and Charles Carroll Morgan. Abstraction, Refinement and Proof for Probabilistic Systems. Springer London, Limited, 2005.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

5

McIver, Annabelle, and Charles Carroll Morgan. Abstraction, Refinement and Proof for Probabilistic Systems. Springer, 2010.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

6

Roever, Willem-Paul de, and Kai Engelhardt. Data Refinement: Model-Oriented Proof Methods and Their Comparison. Cambridge University Press, 2010.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

7

Roever, Willem-Paul de, and Kai Engelhardt. Data Refinement: Model-Oriented Proof Methods and Their Comparison. Cambridge University Press, 2011.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

8

Abstraction, Refinement and Proof for Probabilistic Systems (Monographs in Computer Science). Springer, 2004.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

9

Woodcock, Jim, and Jim Davies. Using Z: Specification, Refinement, and Proof (Prentice-Hall International Series in Computer Science). Prentice Hall, 1996.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

10

Using Z: Specification, Refinement, and Proof (Prentice-Hall International Series in Computer Science). Prentice Hall, 1996.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Capitoli di libri sul tema "Refinement and proof"

1

Fidge, Colin. "Proof Obligations for Real-Time Refinement." In 6th Refinement Workshop. Springer London, 1994. http://dx.doi.org/10.1007/978-1-4471-3240-0_15.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

2

Lovas, William, and Frank Pfenning. "Refinement Types as Proof Irrelevance." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02273-9_13.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

3

Prebet, Enguerrand, and André Platzer. "Uniform Substitution for Differential Refinement Logic." In Automated Reasoning. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63501-4_11.

Testo completo

Abstract (sommario):

AbstractThis paper introduces a uniform substitution calculus for differential refinement logic . The logic extends the differential dynamic logic such that one can simultaneously reason about properties of and relations between hybrid systems. Refinements are useful e.g. for simplifying proofs by relating a concrete hybrid system to an abstract one from which the property can be proved more easily. Uniform substitution is the key to parsimonious prover microkernels. It enables the verbatim use of single axiom formulas instead of axiom schemata with soundness-critical side conditions scattered

Gli stili APA, Harvard, Vancouver, ISO e altri

4

Havelund, Klaus, and Natarajan Shankar. "A Refinement Proof for a Garbage Collector." In From Reactive Systems to Cyber-Physical Systems. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-31514-6_6.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

5

Agerholm, Sten, Juan Bicarregui, and Savi Maharaj. "On the Verification of VDM Specification and Refinement with PVS." In Proof in VDM: Case Studies. Springer London, 1998. http://dx.doi.org/10.1007/978-1-4471-1532-8_6.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

6

Dross, Claire, and Yannick Moy. "Abstract Software Specifications and Automatic Proof of Refinement." In Reliability, Safety, and Security of Railway Systems. Modelling, Analysis, Verification, and Certification. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33951-1_16.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

7

Arcaini, Paolo, Angelo Gargantini, and Elvinia Riccobene. "SMT-Based Automatic Proof of ASM Model Refinement." In Software Engineering and Formal Methods. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41591-8_17.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

8

Kohlen, Bram, Maximilian Schäffeler, Mohammad Abdulaziz, Arnd Hartmanns, and Peter Lammich. "A Formally Verified IEEE 754 Floating-Point Implementation of Interval Iteration for MDPs." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-98679-6_6.

Testo completo

Abstract (sommario):

Abstract We present an efficiently executable, formally verified implementation of interval iteration for MDPs. Our correctness proofs span the entire development from the high-level abstract semantics of MDPs to a low-level implementation in LLVM that is based on floating-point arithmetic. We use the Isabelle/HOL proof assistant to verify convergence of our abstract definition of interval iteration and employ step-wise refinement to derive an efficient implementation in LLVM code. To that end, we extend the Isabelle Refinement Framework with support for reasoning about floating-point arithmet

Gli stili APA, Harvard, Vancouver, ISO e altri

9

Nigam, Vivek, Giselle Reis, Samar Rahmouni, and Harald Ruess. "Proof Search and Certificates for Evidential Transactions." In Automated Deduction – CADE 28. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_14.

Testo completo

Abstract (sommario):

AbstractAttestation logics have been used for specifying systems with policies involving different principals. Cyberlogic is an attestation logic used for the specification of Evidential Transactions (ETs). In such transactions, evidence has to be provided supporting its validity with respect to given policies. For example, visa applicants may be required to demonstrate that they have sufficient funds to visit a foreign country. Such evidence can be expressed as a Cyberlogic proof, possibly combined with non-logical data (e.g., a digitally signed document). A key issue is how to construct and

Gli stili APA, Harvard, Vancouver, ISO e altri

10

Ishikawa, Fuyuki, Tsutomu Kobayashi, and Shinichi Honiden. "Explicit Exploration of Refinement Design in Proof-Based Approach: Refinement Engineering in Event-B." In Implicit and Explicit Semantics Integration in Proof-Based Developments of Discrete Systems. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5054-6_14.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Refinement and proof"

1

Morgan, Carroll. "Proof rules for probabilistic loops." In Proceedings of the BCS-FACS 7th Refinement Workshop. BCS Learning & Development, 1996. http://dx.doi.org/10.14236/ewic/rw1996.10.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

2

Bossard, Antoine, and Keiichi Kaneko. "UCEJ Database Refinement and Applicability Proof." In 2019 IEEE International Symposium on Multimedia (ISM). IEEE, 2019. http://dx.doi.org/10.1109/ism46123.2019.00018.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

3

Bezza, Asma, Elkamel Merah, Rabea Ameur-Boulifa, Rohallah Benaboud, and Toufik Messaoud Maarouk. "Formalization and Refinement Proof for Embedded Systems." In 2020 4th International Symposium on Informatics and its Applications (ISIA). IEEE, 2020. http://dx.doi.org/10.1109/isia51297.2020.9416544.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

4

Hart, Thomas E., Kelvin Ku, Arie Gurfinkel, Marsha Chechik, and David Lie. "Augmenting Counterexample-Guided Abstraction Refinement with Proof Templates." In 2008 23rd IEEE/ACM International Conference on Automated Software Engineering. IEEE, 2008. http://dx.doi.org/10.1109/ase.2008.55.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

5

Clark, Tony. "Object-Oriented Refinement and Proof using Behaviour Functions." In Rigorous Object-Oriented Methods 2000. BCS Learning & Development, 2000. http://dx.doi.org/10.14236/ewic/room2000.2.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

6

Stankaitis, Paulius, Guillaume Dupont, Neeraj Kumar Singh, Yamine Ait-Ameur, Alexei Iliasov, and Alexander Romanovsky. "Modelling Hybrid Train Speed Controller using Proof and Refinement." In 2019 24th International Conference on Engineering of Complex Computer Systems (ICECCS). IEEE, 2019. http://dx.doi.org/10.1109/iceccs.2019.00019.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

7

Vindum, Simon Friis, and Lars Birkedal. "Contextual refinement of the Michael-Scott queue (proof pearl)." In CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs. ACM, 2021. http://dx.doi.org/10.1145/3437992.3439930.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

8

Khalafinejad, Saeed, and Seyed-Hassan Mirian-Hosseinabadi. "Derivation of Z functional input/output refinement proof rules." In 2010 International Conference on Electronics and Information Engineering (ICEIE 2010). IEEE, 2010. http://dx.doi.org/10.1109/iceie.2010.5559891.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

9

Pleasant, James C. "Systematic program development and proof: Dromey's method versus top-down refinement." In the 28th annual Southeast regional conference. ACM Press, 1990. http://dx.doi.org/10.1145/98949.99056.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

10

Dupont, G., Y. Ait-Ameur, M. Pantel, and N. K. Singh. "Handling Refinement of Continuous Behaviors: A Proof Based Approach with Event-B." In 2019 International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE, 2019. http://dx.doi.org/10.1109/tase.2019.00-25.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Rapporti di organizzazioni sul tema "Refinement and proof"

1

Lehotay, Steven J., and Aviv Amirav. Ultra-Fast Methods and Instrumentation for the Analysis of Hazardous Chemicals in the Food Supply. United States Department of Agriculture, 2012. http://dx.doi.org/10.32747/2012.7699852.bard.

Testo completo

Abstract (sommario):

Original proposal objectives: Our main original goal was to develop ultra-fast methods and instrumentation for the analysis of hazardous chemicals in the food supply. We proposed to extend the QuEChERS approach to veterinary drugs and other contaminants, and conduct fast and ultra-fast analyses using novel 5MB-MS instrumentation, ideally with real samples. Background to the topic: The international trade of agricultural food products is a $1.2 trill ion annual market and growing. Food safety is essential to human health, and chemical residue limits are legislated nationally and internationally

Gli stili APA, Harvard, Vancouver, ISO e altri

Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!