Search Results - "Theory of computation~Logic and verification"
-
1
Authors: et al.
Contributors: et al.
Source: Logical Methods in Computer Science. 21
Subject Terms: 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
File Description: application/pdf
-
2
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: application/pdf
-
3
Authors: et al.
Contributors: et al.
Source: 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⟩Subject Terms: Timed logics, Runtime Verification, Monitorability, Theory of computation → Logic and verification, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Subject Geographic: Bergen (NO), Norway
-
4
Authors:
Source: 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems ; 450 ; 437
Subject Terms: 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
Subject Geographic: Rotterdam Netherlands
File Description: 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
-
5
Authors: et al.
Contributors: et al.
Source: Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020
Subject Terms: 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
File Description: application/pdf
-
6
Authors: et al.
Source: ACM Transactions on Computational Logic. 24:1-33
Subject Terms: 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
File Description: application/pdf
-
7
Authors: et al.
Contributors: et al.
Source: 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-2024Subject Terms: 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]
Subject Geographic: London, United Kingdom
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2310.01998; ARXIV: 2310.01998
-
8
Authors:
Contributors:
Source: 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-24Subject Terms: feature extraction, ddc:004, Satisfiability, running time prediction, Theory of computation → Logic and verification, satisfiability prediction
File Description: application/pdf
-
9
Authors: et al.
Contributors: et al.
Source: 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-13Subject Terms: 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)
File Description: application/pdf
-
10
Authors:
Contributors:
Source: Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs. :225-238
Subject Terms: 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
File Description: application/pdf
-
11
Authors:
Source: ISSN: 1868-8969.
Subject Terms: 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
File Description: 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
-
12
Authors: et al.
Contributors: et al.
Source: ACM Transactions on Intelligent Systems and Technology. 12:1-29
Subject Terms: 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
File Description: application/pdf
-
13
Authors:
Contributors:
Source: Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation. :14-26
Subject Terms: [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
File Description: application/pdf
Access URL: 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 -
14
Authors: et al.
Contributors: et al.
Subject Terms: 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)
File Description: application/pdf
-
15
Authors: et al.
Contributors: et al.
Subject Terms: 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
File Description: application/pdf
-
16
Authors: et al.
Contributors: et al.
Source: 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/
Subject Terms: Constraints, Constraint Automata, Temporal Logics, Infinite Data Trees, Theory of computation → Logic and verification, [INFO]Computer Science [cs]
-
17
Authors: et al.
Contributors: et al.
Source: MFCS 2023 ; https://hal.science/hal-04287405 ; MFCS 2023, Aug 2023, Bordeaux, France. ⟨10.4230/LIPIcs⟩
Subject Terms: 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]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2302.09881; ARXIV: 2302.09881
-
18
Authors: et al.
Contributors: et al.
Source: 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⟩
Subject Terms: 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]
Subject Geographic: Glasgow, United Kingdom
-
19
Authors: et al.
Contributors: et al.
Source: 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⟩
Subject Terms: 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]
Subject Geographic: Glasgow, United Kingdom
-
20
Authors: et al.
Contributors: et al.
Subject Terms: 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)
File Description: application/pdf
Full Text Finder 
Nájsť tento článok vo Web of Science