Výsledky vyhľadávania - "Theory of computation → Program verification"

Zdroj: Al-Sibahi, A S, Jensen, T P, Dimovski, A S & Wasowski, A 2021, ' Verification of Program Transformations with Inductive Refinement Types ', ACM Transactions on Software Engineering and Methodology, vol. 30, no. 1, 5 . https://doi.org/10.1145/3409805
Al-Sibahi, A S, Jensen, T P, Dimovski, A & Wasowski, A 2021, 'Verification of Program Transformations with Inductive Refinement Types', ACM Transactions on Software Engineering and Methodology, vol. 30, no. 1, 5, pp. 1-33. https://doi.org/10.1145/3409805

Predmety: Program schemes, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], transformation languages, Program analysis, • Software and its engineering → Translator writing systems and compiler generators, 02 engineering and technology, Semantics, CCS Concepts: • Theory of computation → Program verification, static analysis, Operational semantics, 0202 electrical engineering, electronic engineering, information engineering, abstract interpretation, Functional constructs, Control primitives, Abstraction, Transformation languages

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.inria.fr/hal-03518825/file/Rabit_TOSEM.pdf
https://inria.hal.science/hal-03518825v1/document
https://inria.hal.science/hal-03518825v1
https://doi.org/10.1145/3409805
https://dl.acm.org/doi/10.1145/3409805
https://doi.org/10.1145/3409805
https://dblp.uni-trier.de/db/journals/tosem/tosem30.html#Al-SibahiJDW21
https://curis.ku.dk/ws/files/312758645/Verification_of_Program_Transformations_with_Inductive_Refinement_Types_2_34.pdf
https://pure.itu.dk/portal/da/publications/1e054600-a425-4d8d-a97c-93dcd93c32d0

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

4

Formal verification of a program obfuscation based on mixed Boolean-arithmetic expressions

Autori: Blazy, Sandrine Hutin, Rémi

Prispievatelia: Blazy, Sandrine Hutin, Rémi

Zdroj: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs. :196-208

Predmety: CompCert verified compiler, Operational semantics, 0202 electrical engineering, electronic engineering, information engineering, CCS Concepts • Theory of computation → Program verification, program obfuscation, 02 engineering and technology, • Software and its en-gineering → Software verification, Keywords bitwise arithmetic, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.inria.fr/hal-01955773/file/cpp2019.pdf
https://inria.hal.science/hal-01955773v1/document
https://inria.hal.science/hal-01955773v1
https://doi.org/10.1145/3293880.3294103
https://hal.inria.fr/hal-01955773/document
https://dl.acm.org/doi/10.1145/3293880.3294103
https://dl.acm.org/citation.cfm?doid=3293880.3294103
https://dblp.uni-trier.de/db/conf/cpp/cpp2019.html#BlazyH19
https://hal.inria.fr/hal-01955773

View record at OpenAIRE

Nájsť tento článok vo Web of Science

5

Information Flow Analysis for Detecting Non-Determinism in Blockchain (Artifact)

Autori: Olivieri, Luca Negrini, Luca Arceri, Vincenzo a ďalší

Prispievatelia: Olivieri, Luca Negrini, Luca Arceri, Vincenzo a ďalší

Predmety: Program Verification, Blockchain, Software and its engineering → Software notations and tools, Static Analysis, DApps, Theory of computation → Program verification, Theory of computation → Program analysis, ddc:004, Go language, Security and privacy → Distributed systems security, Non-determinism, Smart contracts

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/DARTS.9.2.23

View record at OpenAIRE

Nájsť tento článok vo Web of Science

6

Modular Verification of State-Based CRDTs in Separation Logic (Artifact)

Autori: Nieto, Abel Daby-Seesaram, Arnaud Gondelman, Léon a ďalší

Prispievatelia: Nieto, Abel Daby-Seesaram, Arnaud Gondelman, Léon a ďalší

Predmety: distributed systems, separation logic, Theory of computation → Program verification, Theory of computation → Separation logic, replicated data type, CRDT, ddc:004, Theory of computation → Distributed algorithms, formal verification

Popis súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/DARTS.9.2.15

View record at OpenAIRE

Nájsť tento článok vo Web of Science

7

Towards Concurrent Quantitative Separation Logic

Autori: Fesefeldt, Ira Justus Katoen, Joost-Pieter Noll, Thomas

Zdroj: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, LIPIcs - Leibniz International Proceedings in Informatics 243, 25:1-25:24 (2022). doi:10.4230/LIPICS.CONCUR.2022.25 ; 33rd International Conference on Concurrency Theory (CONCUR 2022) / Herausgeber: Bartek Klin, Sławomir Lasota, Anca Muscholl ; 33rd International Conference on Concurrency Theory (CONCUR 2022) / Herausgeber: Bartek Klin, Sławomir Lasota, Anca Muscholl 33. International Conference on Concurrency Theory, CONCUR 2022, Warsaw, Poland, 2022-09-13 - 2022-09-16

Predmety: Concurrency, Heap-Manipulating, Mathematics of computing → Probabilistic reasoning algorithms, Pointers, Randomization, Separation Logic, Theory of computation → Concurrent algorithms, Theory of computation → Program verification

Geografické téma: DE

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-246-4

Dostupnosť: https://publications.rwth-aachen.de/record/853299
https://publications.rwth-aachen.de/search?p=id:%22RWTH-2022-08746%22

View record from BASE

Nájsť tento článok vo Web of Science

8

Strategies for MDP bisimilarity equivalence and inequivalence

Autori: Kiefer, Stefan Tang, Qiyi Stefan Kiefer and Qiyi Tang a ďalší

Prispievatelia: Kiefer, Stefan Tang, Qiyi Stefan Kiefer and Qiyi Tang a ďalší

Predmety: Theory of computation → Models of computation, Markov chains, Theory of computation → Program verification, Mathematics of computing → Probability and statistics, ddc:004, Markov decision processes

Popis súboru: application/pdf

Prístupová URL adresa: https://ora.ox.ac.uk/objects/uuid:8a74b77d-7288-4e94-b9f6-751c4dab75df
https://doi.org/10.4230/lipics.concur.2022.32
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.32

View record at OpenAIRE

Nájsť tento článok vo Web of Science

9

Certified Compilation of Financial Contracts

Autori: Annenkov, Danil Elsman, Martin

Prispievatelia: Annenkov, Danil Elsman, Martin

Zdroj: Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming-PPDP '18
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming

Predmety: FOS: Computer and information sciences, domain-specific lan-guages, Computer Science - Programming Languages, certified programming, • Software and its engineering → Correctness, contract languages, Domain specific languages, financial contracts, 02 engineering and technology, [INFO] Computer Science [cs], Keywords financial contracts, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], Source code generation, domain-specific languages, software correctness, 0202 electrical engineering, electronic engineering, information engineering, Logic and verification, Coq, CCS Concepts • Theory of computation → Program verification, Programming Languages (cs.PL)

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.inria.fr/hal-01883559/file/PPDP18-cert-comp-fin.pdf
http://arxiv.org/abs/2108.03076
https://inria.hal.science/hal-01883559v1/document
https://inria.hal.science/hal-01883559v1
https://doi.org/10.1145/3236950.3236955
http://arxiv.org/pdf/2108.03076.pdf
https://arxiv.org/abs/2108.03076
https://hal.inria.fr/hal-01883559
https://dblp.uni-trier.de/db/journals/corr/corr2108.html#abs-2108-03076
https://arxiv.org/pdf/2108.03076
https://arxiv.org/abs/2108.03076
https://hal.inria.fr/hal-01883559/document
http://128.84.4.18/abs/2108.03076?context=cs

View record at OpenAIRE

Nájsť tento článok vo Web of Science

10

Parallel Complexity of Term Rewriting Systems

Autori: Baudon, Thaïs Fuhs, Carsten Gonnord, Laure a ďalší

Prispievatelia: Baudon, Thaïs Fuhs, Carsten Gonnord, Laure a ďalší

Zdroj: WST 2021 - 17th International Workshop on Termination ; https://hal.science/hal-03418400 ; WST 2021 - 17th International Workshop on Termination, Jul 2021, Virtual, France. pp.1-6

Predmety: Rewriting, Parallelism, Formal software verification phrases Complexity analysis, Software and its engineering → Automated static analysis, Rewrite systems, 2012 ACM Subject Classification Theory of computation → Program verification, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Geografické téma: Virtual, France

Dostupnosť: https://hal.science/hal-03418400
https://hal.science/hal-03418400v1/document
https://hal.science/hal-03418400v1/file/wst2021.pdf

View record from BASE

Nájsť tento článok vo Web of Science

11

A reasonably exceptional type theory

Autori: Pédrot, Pierre-Marie Tabareau, Nicolas Fehrmann, Hans a ďalší

Prispievatelia: Pédrot, Pierre-Marie Tabareau, Nicolas Fehrmann, Hans a ďalší

Zdroj: Proceedings of the ACM on Programming Languages

Predmety: CCS Concepts: • Theory of computation → Type theory, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Parametricity, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Efects, CCS Concepts: • Theory of computation → Functional constructs, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 02 engineering and technology, 16. Peace & justice, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], CCS Concepts: • Theory of computation → Program verification, 0202 electrical engineering, electronic engineering, information engineering, Exceptions, Functional constructs

Popis súboru: application/pdf

Prístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3341712
https://inria.hal.science/hal-02189128v1/document
https://doi.org/10.1145/3341712
https://inria.hal.science/hal-02189128v1
https://dl.acm.org/doi/pdf/10.1145/3341712
https://dblp.uni-trier.de/db/journals/pacmpl/pacmpl3.html#PedrotTFT19
https://dlnext.acm.org/doi/abs/10.1145/3341712
https://hal.inria.fr/hal-02189128
https://dl.acm.org/doi/10.1145/3341712
https://hal.inria.fr/hal-02189128/document

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

12

Environmental bisimulations for probabilistic higher-order languages

Autori: SANGIORGI, DAVIDE VIGNUDELLI, VALERIA Valeria, Vignudelli

Prispievatelia: SANGIORGI, DAVIDE VIGNUDELLI, VALERIA Valeria, Vignudelli

Zdroj: ACM SIGPLAN Notices. 51:595-607

Predmety: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Imperative Languages, Contextual equivalence, Environmental bisimulation, Imperative languages, Probabilistic lambda calculus, Environmental Bisimulation, [INFO] Computer Science [cs], 16. Peace & justice, Probabilistic Lambda Calculus, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], Theory of computation → Program verification, Operational semantics, Contextual Equivalence, Probabilistic computation, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Popis súboru: application/pdf

Prístupová URL adresa: https://cris.unibo.it/bitstream/11585/586780/4/SIGPLAN-SIGACT2016.pdf
https://cris.unibo.it/bitstream/11585/730806/1/toplas19_postprint.pdf
https://inria.hal.science/hal-01337665v1
https://inria.hal.science/hal-01337665v1/document
https://doi.org/10.1145/2837614.2837651
https://dblp.uni-trier.de/db/journals/toplas/toplas41.html#SangiorgiV19
https://doi.org/10.1145/3350618
https://dl.acm.org/doi/10.1145/3350618
https://hal.archives-ouvertes.fr/hal-01337665
https://dl.acm.org/doi/10.1145/2837614.2837651
https://hal.inria.fr/hal-01337665
https://hal.inria.fr/hal-01337665/document
https://dblp.uni-trier.de/db/conf/popl/popl2016.html#SangiorgiV16
https://hdl.handle.net/11585/586780
https://doi.org/10.1145/2837614.2837651
http://portal.acm.org/browse_dl.cfm?linked=1&part=newsletter&idx=J706&coll=portal&dl=ACM&CFID=57809500&CFTOKEN=27978298
https://hdl.handle.net/11585/730806
https://doi.org/10.1145/3350618
https://dl.acm.org/doi/10.1145/3350618

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

13

A Symbolic Framework to Analyse Physical Proximity in Security Protocols

Autori: Debant, Alexandre Delaune, Stéphanie Wiedling, Cyrille a ďalší

Prispievatelia: Debant, Alexandre Delaune, Stéphanie Wiedling, Cyrille a ďalší

Zdroj: Foundations of Software Technology and Theoretical Computer Science (FSTTCS) ; https://hal.science/hal-02390222 ; Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2018, Ahmedabad, India. ⟨10.4230/LIPIcs.FSTTCS.2018.29⟩

Predmety: 2012 ACM Subject Classification Theory of computation Program verification phrases cryptographic protocols verification formal methods process algebra Dolev-Yao model, 2012 ACM Subject Classification Theory of computation Program verification phrases cryptographic protocols, verification, formal methods, process algebra, Dolev-Yao model, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]

Geografické téma: Ahmedabad, India

Time: Ahmedabad, India

Relation: info:eu-repo/grantAgreement//714955/EU/Reasoning about Physical properties Of security Protocols with an Application To contactless Systems/ERC-POPSTAR

Dostupnosť: https://hal.science/hal-02390222
https://hal.science/hal-02390222/document
https://hal.science/hal-02390222/file/research-report.pdf
https://doi.org/10.4230/LIPIcs.FSTTCS.2018.29

View record from BASE

Nájsť tento článok vo Web of Science

14