-
1Academic Journal
Συγγραφείς: Koh, Zhuan Khye, Loho, Georg
Συνεισφορές: Zhuan Khye Koh and Georg Loho, Szeider, Stefan, Ganian, Robert, Silva, Alexandra
Πηγή: Logical Methods in Computer Science. 21
Θεματικοί όροι: 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
Περιγραφή αρχείου: application/pdf
-
2Conference
Συγγραφείς: Halle, Sylvain
Πηγή: 2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) FORMALISE Formal Methods in Software Engineering (FormaliSE), 2022 IEEE/ACM 10th International Conference on. :23-33 May, 2022
Relation: 2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE)
-
3Conference
Συγγραφείς: Gomes, Leandro, Baillot, Patrick, Gaboardi, Marco
Συνεισφορές: Gomes, Leandro, Leandro Gomes and Patrick Baillot and Marco Gaboardi
Θεματικοί όροι: 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
Περιγραφή αρχείου: application/pdf
Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2025.35
-
4Conference
Συνεισφορές: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Université Paris Cité (UPCité), University of Malta Malta
Πηγή: 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⟩Θεματικοί όροι: Timed logics, Runtime Verification, Monitorability, Theory of computation → Logic and verification, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Θέμα γεωγραφικό: Bergen (NO), Norway
-
5Conference
Συγγραφείς: Tan, Chengsong, Donaldson, Alastair, Wickerson, John
Πηγή: 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems ; 450 ; 437
Θεματικοί όροι: 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
Θέμα γεωγραφικό: Rotterdam Netherlands
Περιγραφή αρχείου: 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
-
6Academic Journal
Συγγραφείς: Barozzini, David, Clemente, Lorenzo, Colcombet, Thomas, Parys, Paweł
Συνεισφορές: David Barozzini and Lorenzo Clemente and Thomas Colcombet and Paweł Parys, Colcombet, Thomas, Artur Czumaj, Anuj Dawar, Emanuela Merelli
Πηγή: Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020
Θεματικοί όροι: 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
Περιγραφή αρχείου: application/pdf
-
7Conference
Συγγραφείς: Kwiatkowska, Marta
Πηγή: 2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE) ASE Automated Software Engineering (ASE), 2020 35th IEEE/ACM International Conference on. :1-3 Sep, 2020
Relation: 2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE)
-
8Academic Journal
Συγγραφείς: Silvio Ghilardi, Alessandro Gianola, Deepak Kapur, Chiara Naso
Πηγή: ACM Transactions on Computational Logic. 24:1-33
Θεματικοί όροι: 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
Περιγραφή αρχείου: application/pdf
Σύνδεσμος πρόσβασης: https://hdl.handle.net/2434/996188
https://doi.org/10.1145/3587161 -
9Conference
Συγγραφείς: de Frutos-Fernández, María Inés, Nuccio Mortarino Majno di Capriglio, Filippo Alberto Edoardo
Συνεισφορές: Universidad Autónoma de Madrid (UAM), Combinatoire, théorie des nombres (CTN), Institut Camille Jordan (ICJ), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), CA1/RSUE/2021-00623 of the Spanish Ministry ofUniversities, the Recovery, Transformation and Resilience Plan, and Universidad Autónoma de Madrid., Appel à Projets Recherche UJM 2023 of Université Jean Monnet Saint-Étienne, ANR-10-LABX-0070,MILYON,Community of mathematics and fundamental computer science in Lyon(2010)
Πηγή: 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Θεματικοί όροι: 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]
Θέμα γεωγραφικό: London, United Kingdom
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2310.01998; ARXIV: 2310.01998
-
10Conference
Συγγραφείς: Shavit, Hadar, Hoos, Holger Hendrik
Συνεισφορές: Hadar Shavit and Holger H. Hoos
Πηγή: 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Θεματικοί όροι: feature extraction, ddc:004, Satisfiability, running time prediction, Theory of computation → Logic and verification, satisfiability prediction
Περιγραφή αρχείου: application/pdf
-
11Conference
Συγγραφείς: Spork, Timm, Baier, Christel, Katoen, Joost-Pieter, Piribauer, Jakob, Quatmann, Tim
Συνεισφορές: Timm Spork and Christel Baier and Joost-Pieter Katoen and Jakob Piribauer and Tim Quatmann
Πηγή: 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Θεματικοί όροι: 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)
Περιγραφή αρχείου: application/pdf
-
12Academic Journal
Συγγραφείς: Michael Färber
Συνεισφορές: Färber, Michael
Πηγή: Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs. :225-238
Θεματικοί όροι: 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
Περιγραφή αρχείου: application/pdf
-
13Academic Journal
Συγγραφείς: Cordwell, Katherine, Tan, Yong Kiam, Platzer, André
Πηγή: ISSN: 1868-8969.
Θεματικοί όροι: 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
Περιγραφή αρχείου: 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
-
14Academic Journal
Συγγραφείς: Marco Bozzano, Alessandro Cimatti, Marco Roveri
Συνεισφορές: Bozzano, Marco, Cimatti, Alessandro, Roveri, Marco
Πηγή: ACM Transactions on Intelligent Systems and Technology. 12:1-29
Θεματικοί όροι: 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
Περιγραφή αρχείου: application/pdf
-
15Academic Journal
Συγγραφείς: Hou, Zechen, Madelaine, Eric
Συνεισφορές: Madelaine, Eric
Πηγή: Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation. :14-26
Θεματικοί όροι: [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
Περιγραφή αρχείου: application/pdf
Σύνδεσμος πρόσβασης: 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 -
16Academic Journal
Συγγραφείς: Benedikt, Michael, Chistikov, Dmitry, Mansutti, Alessio
Συνεισφορές: Michael Benedikt and Dmitry Chistikov and Alessio Mansutti, Etessami, Kousha, Feige, Uriel, Puppis, Gabriele
Θεματικοί όροι: 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)
Περιγραφή αρχείου: application/pdf
-
17Conference
Συγγραφείς: Carneiro, Mario, Brown, Chad E., Urban, Josef
Συνεισφορές: Mario Carneiro and Chad E. Brown and Josef Urban, Naumowicz, Adam, Thiemann, René
Θεματικοί όροι: 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
Περιγραφή αρχείου: application/pdf
Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2023.9
-
18Conference
Συγγραφείς: Demri, Stéphane, Quaas, Karin
Συνεισφορές: Centre National de la Recherche Scientifique (CNRS), 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), Leipzig University / Universität Leipzig
Πηγή: 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/
Θεματικοί όροι: Constraints, Constraint Automata, Temporal Logics, Infinite Data Trees, Theory of computation → Logic and verification, [INFO]Computer Science [cs]
-
19Conference
Συγγραφείς: 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), ANR-17-CE40-0028,BRAVAS,IDEAL-BASED ALGORITHMS FOR VASSES AND WELL-STRUCTURED SYSTEMS(2017)
Πηγή: MFCS 2023 ; https://hal.science/hal-04287405 ; MFCS 2023, Aug 2023, Bordeaux, France. ⟨10.4230/LIPIcs⟩
Θεματικοί όροι: 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
-
20Conference
Συγγραφείς: Koops, Wietze, Le Berre, Daniel, Myreen, Magnus, Nordström, Jakob, Oertel, Andy, Tan, Yong Kiam, Vinyals, Marc
Συνεισφορές: Lund University, University of Copenhagen = Københavns Universitet (UCPH), Centre de Recherche en Informatique de Lens (CRIL), Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS), Chalmers University of Technology Göteborg, Göteborgs Universitet = University of Gothenburg (GU), Institute for Infocomm Research - I²R Singapore, Nanyang Technological University Singapour (NTU), University of Auckland Auckland, ANR-21-CE25-0010,BLaSST,Augmenter les outils de raisonnement sur le langage B par des techniques SAT et SMT(2021)
Πηγή: 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⟩
Θεματικοί όροι: 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]
Θέμα γεωγραφικό: Glasgow, United Kingdom