Výsledky vyhledávání - "2012 ACM Subject Classification Theory of computation → Program verification"

The 2-Dimensional Constraint Loop Problem is Decidable

Autoři: Guilmant, Quentin Lefaucheux, Engel Ouaknine, Joël a další

Přispěvatelé: Guilmant, Quentin Lefaucheux, Engel Ouaknine, Joël a další

Zdroj: 51st International Colloquium on Automata, Languages, and Programming
Leibniz International Proceedings in Informatics

Témata: Asymptotic Expansions, FOS: Computer and information sciences, Convex Sets, Computer Science - Logic in Computer Science, Logic, 2012 ACM Subject Classification Theory of computation → Program verification Keywords and phrases Linear Constraints Loops, [INFO] Computer Science [cs], 16. Peace & justice, Minkowski-Weyl, Semantics, 3. Good health, Logic in Computer Science (cs.LO), Theory of computation → Program verification, and Theory of Programming ], 2012 ACM Subject Classification Theory of computation → Program verification Keywords and phrases Linear Constraints Loops Minkowski-Weyl Convex Sets Asymptotic Expansions Digital Object Identifier 10.4230/LIPIcs.ICALP.2024.140 Category Track B: Automata Logic Semantics and Theory of Programming ], Linear Constraints Loops, ddc:004, Asymptotic Expansions Digital Object Identifier 10.4230/LIPIcs.ICALP.2024.140 Category Track B: Automata

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2405.12992
https://inria.hal.science/hal-04644417v1
https://inria.hal.science/hal-04644417v1/document
https://doi.org/10.4230/lipics.icalp.2024.140
https://ora.ox.ac.uk/objects/uuid:b023968e-302c-4c2e-b11a-5d011ea028f8
https://doi.org/10.4230/lipics.icalp.2024.140
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.140
http://hdl.handle.net/21.11116/0000-000F-97B9-6
http://hdl.handle.net/21.11116/0000-000F-97BB-4

Parallel Complexity of Term Rewriting Systems

Autoři: Baudon, Thaïs Fuhs, Carsten Gonnord, Laure a další

Přispěvatelé: Baudon, Thaïs Fuhs, Carsten Gonnord, Laure a další

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

Témata: 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

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

A Symbolic Framework to Analyse Physical Proximity in Security Protocols

Autoři: Debant, Alexandre Delaune, Stéphanie Wiedling, Cyrille a další

Přispěvatelé: Debant, Alexandre Delaune, Stéphanie Wiedling, Cyrille a další

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⟩

Témata: 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

Dostupnost: 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