Výsledky vyhledávání - "Theory of computation, Logic and verification"

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees: Strategy Iteration with Universal Trees

Autoři: Koh, Zhuan Khye Loho, Georg Zhuan Khye Koh and Georg Loho a další

Přispěvatelé: Koh, Zhuan Khye Loho, Georg Zhuan Khye Koh and Georg Loho a další

Zdroj: Logical Methods in Computer Science. 21

Témata: universal trees, FOS: Computer and information sciences, Data Structures and Algorithms, Discrete Mathematics (cs.DM), value iteration, Discrete Mathematics, Logic in Computer Science, Theory of computation → Design and analysis of algorithms, Mathematics of computing → Discrete mathematics, 0102 computer and information sciences, Theory of computation → Logic and verification, 01 natural sciences, Logic in Computer Science (cs.LO), parity games, strategy iteration, progress measure, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2108.13338
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.63
http://eprints.lse.ac.uk/116860/

A Kleene algebra with tests for union bound reasoning about probabilistic programs

Autoři: Gomes, Leandro Baillot, Patrick Gaboardi, Marco a další

Přispěvatelé: Gomes, Leandro Baillot, Patrick Gaboardi, Marco a další

Témata: union bound, Kleene algebras with tests Hoare logic equational reasoning probabilistic programs union bound formal verification, Theory of computation → Hoare logic, Hoare logic, equational reasoning, [INFO] Computer Science [cs], Theory of computation → Logic and verification, Theory of computation → Algebraic semantics, Kleene algebras with tests, probabilistic programs, ddc:004, formal verification, Theory of computation → Pre- and post-conditions

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.35

A theory of (linear-time) timed monitors

Autoři: Amara, Mouloud Bernardi, Giovanni Foughali, Mohammed Aristide a další

Přispěvatelé: Amara, Mouloud Bernardi, Giovanni Foughali, Mohammed Aristide a další

Zdroj: 39th European Conference on Object-Oriented Programming (ECOOP 2025)
https://hal.science/hal-05043055
39th European Conference on Object-Oriented Programming (ECOOP 2025), Jun 2025, Bergen (NO), Norway. ⟨10.4230/LIPIcs.ECOOP.2025.1⟩

Témata: Timed logics, Runtime Verification, Monitorability, Theory of computation → Logic and verification, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Geografické téma: Bergen (NO), Norway

Dostupnost: https://hal.science/hal-05043055
https://hal.science/hal-05043055v1/document
https://hal.science/hal-05043055v1/file/main.pdf
https://doi.org/10.4230/LIPIcs.ECOOP.2025.1

Formalising CXL cache coherence

Autoři: Tan, Chengsong Donaldson, Alastair Wickerson, John

Zdroj: 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems ; 450 ; 437

Témata: CCS Concepts: • Computer systems organization → Architectures, Architectures, • Theory of computation → Logic and verification, Logic and verification, CXL, Cache Coherence, Proof Assistant, Heterogeneous Computing, Formal Proof ASPLOS '25, Rotterdam, Netherlands

Geografické téma: Rotterdam Netherlands

Popis souboru: application/pdf

Relation: ASPLOS '25: Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems; https://hdl.handle.net/10044/1/117459; https://www.dx.doi.org/10.1145/3676641.3715999

Dostupnost: https://hdl.handle.net/10044/1/117459
https://doi.org/10.1145/3676641.3715999

Cost Automata, Safe Schemes, and Downward Closures

Autoři: Barozzini, David Clemente, Lorenzo Colcombet, Thomas a další

Přispěvatelé: Barozzini, David Clemente, Lorenzo Colcombet, Thomas a další

Zdroj: Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020

Témata: FOS: Computer and information sciences, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Theory of computation → Logic and verification, 01 natural sciences, Automata, Regular cost functions, higher-order recursion schemes, Infinite trees, Cost logics, downward closure, safe recursion schemes, cost automata, 0202 electrical engineering, electronic engineering, information engineering, cost logics, ddc:004, Safe scheme, Theory of computation → Rewrite systems, downward closures

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2004.12187
https://fi.episciences.org/8485
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.109
https://hal.science/hal-03105650v1
https://doi.org/10.4230/lipics.icalp.2020.109
https://hal.science/hal-03105650v1/document

Interpolation Results for Arrays with Length and MaxDiff

Autoři: Silvio Ghilardi Alessandro Gianola Deepak Kapur a další

Zdroj: ACM Transactions on Computational Logic. 24:1-33

Témata: 0202 electrical engineering, electronic engineering, information engineering, Theory of computation → Logic and verification, Automated reasoning, Verification by model checking, SMT, interpolation, arrays, amalgamation, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://hdl.handle.net/2434/996188
https://doi.org/10.1145/3587161

A Formalization of Complete Discrete Valuation Rings and Local Fields

Autoři: de Frutos-Fernández, María Inés Nuccio Mortarino Majno di Capriglio, Filippo Alberto Edoardo Universidad Autónoma de Madrid (UAM) a další

Přispěvatelé: de Frutos-Fernández, María Inés Nuccio Mortarino Majno di Capriglio, Filippo Alberto Edoardo Universidad Autónoma de Madrid (UAM) a další

Zdroj: 13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’24)
https://ujm.hal.science/ujm-04222610
13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’24), Jan 2024, London, United Kingdom. pp.190-204, ⟨10.1145/3636501.3636942⟩
https://popl24.sigplan.org/home/CPP-2024

Témata: Logic and verification, Proof theory formal mathematics, Lean, mathlib, algebraic number theory, local fields, discrete valuation rings, Theory of computation, CCS Concepts: Theory of computation → Logic and verification, Proof theory formal mathematics Lean mathlib algebraic number theory local fields discrete valuation rings, CCS Concepts, Theory of computation → Logic and verification, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]

Geografické téma: London, United Kingdom

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2310.01998; ARXIV: 2310.01998

Dostupnost: https://ujm.hal.science/ujm-04222610
https://ujm.hal.science/ujm-04222610v3/document
https://ujm.hal.science/ujm-04222610v3/file/deFrutosFerandez%26Nuccio-A%20Formalization%20of%20Complete%20DVR%20and%20Local%20Fields.pdf
https://doi.org/10.1145/3636501.3636942

Revisiting SATZilla Features in 2024

Autoři: Shavit, Hadar Hoos, Holger Hendrik Hadar Shavit and Holger H. Hoos

Přispěvatelé: Shavit, Hadar Hoos, Holger Hendrik Hadar Shavit and Holger H. Hoos

Zdroj: Saarbrücken/Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, LIPIcs-Leibniz international proceedings in informatics 305, 27:[1]-27:26, 1871966 bytes (2024). doi:10.4230/LIPICS.SAT.2024.27
27th International Conference on Theory and Applications of Satisfiability Testing : SAT 2024, August 21–24, 2024, Pune, India / edited by Supratik Chakraborty, Jie-Hong Roland Jiang
27th International Conference on Theory and Applications of Satisfiability Testing : SAT 2024, August 21–24, 2024, Pune, India / edited by Supratik Chakraborty, Jie-Hong Roland Jiang27. International Conference on Theory and Applications of Satisfiability Testing, SAT 2024, Pune, India, 2024-08-21-2024-08-24

Témata: feature extraction, ddc:004, Satisfiability, running time prediction, Theory of computation → Logic and verification, satisfiability prediction

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2024.27
https://publications.rwth-aachen.de/record/992947

A Spectrum of Approximate Probabilistic Bisimulations

Autoři: Spork, Timm Baier, Christel Katoen, Joost-Pieter a další

Přispěvatelé: Spork, Timm Baier, Christel Katoen, Joost-Pieter a další

Zdroj: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 311, 37:1-37:19 (2024). doi:10.4230/LIPICS.CONCUR.2024.37
35th International Conference on Concurrency Theory : CONCUR 2024, September 9-13, 2024, Calgary, Canada / edited by Rupak Majumdar, Alexandra Silva
35th International Conference on Concurrency Theory : CONCUR 2024, September 9-13, 2024, Calgary, Canada / edited by Rupak Majumdar, Alexandra Silva35. International Conference on Concurrency Theory, CONCUR 2024, Calgary, Canada, 2024-09-09-2024-09-13

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Model checking, Approximate bisimulation, Markov chains, Theory of computation → Random walks and Markov chains, ddc:004, Abstraction, Theory of computation → Logic and verification, Logic in Computer Science (cs.LO)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2407.07584
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.37
https://publications.rwth-aachen.de/record/1005879

Safe, fast, concurrent proof checking for the lambda-pi calculus modulo rewriting

Autoři: Michael Färber Färber, Michael

Přispěvatelé: Michael Färber Färber, Michael

Zdroj: Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs. :225-238

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], reduction, Automated reasoning, 0102 computer and information sciences, Higher order logic concurrency, 01 natural sciences, Dedukti, rewriting, Logic in Computer Science (cs.LO), sharing, type checking, Rust, concurrency, Interactive proof systems, 0101 mathematics, verification, performance, Equational logic and rewriting, CCS Concepts: • Theory of computation → Logic and verification

Popis souboru: application/pdf

Přístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3497775.3503683
http://arxiv.org/abs/2102.08766
https://inria.hal.science/hal-03143359v3
https://doi.org/10.1145/3497775.3503683
https://inria.hal.science/hal-03143359v3/document

A Verified Decision Procedure for Univariate Real Arithmetic with the BKR Algorithm

Autoři: Cordwell, Katherine Tan, Yong Kiam Platzer, André

Zdroj: ISSN: 1868-8969.

Témata: quantifier elimination, matrix, theorem proving, real arithmetic, Theory of computation → Logic and verification, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

Popis souboru: application/pdf

Relation: Leibniz International Proceedings in Informatics (LIPIcs); info:eu-repo/semantics/altIdentifier/issn/1868-8969; https://publikationen.bibliothek.kit.edu/1000174216; https://publikationen.bibliothek.kit.edu/1000174216/154688957; https://doi.org/10.5445/IR/1000174216

Dostupnost: https://publikationen.bibliothek.kit.edu/1000174216
https://publikationen.bibliothek.kit.edu/1000174216/154688957
https://doi.org/10.5445/IR/1000174216

A Comprehensive Approach to On-board Autonomy Verification and Validation

Autoři: Marco Bozzano Alessandro Cimatti Marco Roveri a další

Přispěvatelé: Marco Bozzano Alessandro Cimatti Marco Roveri a další

Zdroj: ACM Transactions on Intelligent Systems and Technology. 12:1-29

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Computing methodologies, Planning under uncertainty, Theory of computation, Logic and verification, Verification by model checking, Robotic autonomy, Fault detection identification and recovery, model based autonomy, planning as model checking, plan generation, plan execution, plan validation

Popis souboru: application/pdf

Přístupová URL adresa: http://www-vvps09.imag.fr/files/CFP-VVPS09.pdf
https://dl.acm.org/doi/10.1145/3472715
https://dblp.uni-trier.de/db/journals/tist/tist12.html#BozzanoCR21
https://hdl.handle.net/11572/314811
https://doi.org/10.1145/3472715
https://dl.acm.org/doi/10.1145/3472715

Symbolic bisimulation for open and parameterized systems

Autoři: Hou, Zechen Madelaine, Eric

Přispěvatelé: Hou, Zechen Madelaine, Eric

Zdroj: Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation. :14-26

Témata: [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], 0102 computer and information sciences, 02 engineering and technology, Hardware → Equivalence checking Keywords Strong Bisimulation, 16. Peace & justice, Theory of computation → Logic and verification, 01 natural sciences, Process calculi, Open Systems, Strong Bisimulation, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], Computing methodologies → Theorem proving algorithms, Model verification and validation, SMT Solver

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.inria.fr/hal-02406098/file/poplws20pepmmain-p7-p-79d1b9f-43140-final.pdf
https://inria.hal.science/hal-02406098v1
https://doi.org/10.1145/3372884.3373161
https://inria.hal.science/hal-02406098v1/document
https://dblp.uni-trier.de/db/conf/pepm/pepm2020.html#HouM20
https://hal.inria.fr/hal-02406098/document
https://dl.acm.org/doi/10.1145/3372884.3373161
https://hal.inria.fr/hal-02406098

The complexity of Presburger arithmetic with power or powers

Autoři: Benedikt, Michael Chistikov, Dmitry Mansutti, Alessio a další

Přispěvatelé: Benedikt, Michael Chistikov, Dmitry Mansutti, Alessio a další

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, 4. Education, decision procedures, exponentiation, arithmetic theories, ddc:004, Theory of computation → Logic and verification, 7. Clean energy, Logic in Computer Science (cs.LO)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2305.03037
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.112

Automated Theorem Proving for Metamath

Autoři: Carneiro, Mario Brown, Chad E. Urban, Josef a další

Přispěvatelé: Carneiro, Mario Brown, Chad E. Urban, Josef a další

Témata: Interactive theorem proving, Automated theorem proving, proof discovery, Theory of computation → Automated reasoning, Theory of computation → Higher order logic, Formal proof assistants, ddc:004, Metamath, Theory of computation → Logic and verification

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2023.9

Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL*(ℤ) to Decision Procedures

Autoři: Demri, Stéphane Quaas, Karin Centre National de la Recherche Scientifique (CNRS) a další

Přispěvatelé: Demri, Stéphane Quaas, Karin Centre National de la Recherche Scientifique (CNRS) a další

Zdroj: LIPIcs, Volume 279 ; 34th International Conference on Concurrency Theory (CONCUR 2023) ; https://hal.science/hal-04201369 ; 34th International Conference on Concurrency Theory (CONCUR 2023), Sep 2023, Antwerp, Belgium. ⟨10.4230/LIPIcs.CONCUR.2023.29⟩ ; https://www.uantwerpen.be/en/conferences/confest-2023/concur/

Témata: Constraints, Constraint Automata, Temporal Logics, Infinite Data Trees, Theory of computation → Logic and verification, [INFO]Computer Science [cs]

Geografické téma: Antwerp, Belgium

Dostupnost: https://hal.science/hal-04201369
https://hal.science/hal-04201369v1/document
https://hal.science/hal-04201369v1/file/final-concur23.pdf
https://doi.org/10.4230/LIPIcs.CONCUR.2023.29

Ordinal measures of the set of finite multisets

Autoři: Vialard, Isa Laboratoire Méthodes Formelles (LMF) Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay) a další

Přispěvatelé: Vialard, Isa Laboratoire Méthodes Formelles (LMF) Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay) a další

Zdroj: MFCS 2023 ; https://hal.science/hal-04287405 ; MFCS 2023, Aug 2023, Bordeaux, France. ⟨10.4230/LIPIcs⟩

Témata: 2012 ACM Subject Classification Theory of computation → Complexity theory and logic, Theory of computation → Logic and verification, Theory of computation → Proof theory, Theory of computation → Program reasoning, finite multisets, termination, program verification, Well-partial order, [INFO]Computer Science [cs]

Geografické téma: Bordeaux, France

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2302.09881; ARXIV: 2302.09881

Dostupnost: https://hal.science/hal-04287405
https://hal.science/hal-04287405v1/document
https://hal.science/hal-04287405v1/file/multiset.pdf
https://doi.org/10.4230/LIPIcs

Practically Feasible Proof Logging for Pseudo-Boolean Optimization

Autoři: Koops, Wietze Le Berre, Daniel Myreen, Magnus a další

Přispěvatelé: Koops, Wietze Le Berre, Daniel Myreen, Magnus a další

Zdroj: Leibniz International Proceedings in Informatics ; 31st International Conference on Principles and Practice of Constraint Programming (CP 2025) ; https://univ-artois.hal.science/hal-05219026 ; 31st International Conference on Principles and Practice of Constraint Programming (CP 2025), Aug 2025, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.CP.2025.21⟩

Témata: Theory of computation → Logic and verification, proof logging, certifying algorithms, combinatorial optimization, certification, pseudo-Boolean solving, 0-1 integer linear programming, Mathematics of computing → Combinatorial optimization, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Geografické téma: Glasgow, United Kingdom

Dostupnost: https://univ-artois.hal.science/hal-05219026
https://doi.org/10.4230/LIPIcs.CP.2025.21

Analyzing Self-Stabilization of Synchronous Unison via Propositional Satisfiability

Autoři: Khoualdia, Asma Cherif, Sami Devismes, Stéphane a další

Přispěvatelé: Khoualdia, Asma Cherif, Sami Devismes, Stéphane a další

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs) ; 31st International Conference on Principles and Practice of Constraint Programming (CP 2025) ; https://hal.science/hal-05203873 ; 31st International Conference on Principles and Practice of Constraint Programming (CP 2025), Aug 2025, Glasgow, United Kingdom. pp.19:1--19:21, ⟨10.4230/LIPIcs.CP.2025.19⟩

Témata: Theory of computation → Logic and verification, Theory of computation → Constraint and logic programming, Theory of computation → Distributed algorithms, Satisfiability, Synchronous Unison, Self-stabilization, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Geografické téma: Glasgow, United Kingdom

Dostupnost: https://hal.science/hal-05203873
https://doi.org/10.4230/LIPIcs.CP.2025.19

Holistic Verification of Blockchain Consensus

Autoři: Bertrand, Nathalie Gramoli, Vincent Konnov, Igor a další

Přispěvatelé: Bertrand, Nathalie Gramoli, Vincent Konnov, Igor a další

Témata: FOS: Computer and information sciences, Model checking, logic, Computer Science - Cryptography and Security, automata, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 16. Peace & justice, Theory of computation → Logic and verification, 01 natural sciences, Theory of computation → Logic and verification phrases Model checking, Computer Science - Distributed, Parallel, and Cluster Computing, Computing methodologies → Distributed algorithms, byzantine failure, 0202 electrical engineering, electronic engineering, information engineering, 2012 ACM Subject Classification Computing methodologies → Distributed algorithms, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, Cryptography and Security (cs.CR)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2206.04489
https://inria.hal.science/hal-03819724v1/document
https://inria.hal.science/hal-03819724v1
https://doi.org/10.4230/lipics.disc.2022.10
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.10