Suchergebnisse - acm: f.: theory of computation/f.3: logics AND meanings of (progress OR process)~
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Logic, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], mathematics - dynamical systems, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, 0102 computer and information sciences, Dynamical Systems (math.DS), 01 natural sciences, computer science - logic in computer science, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, FOS: Mathematics, mathematics - logic, Mathematics - Dynamical Systems, 0101 mathematics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, mathematics - probability, BC1-199, Probability (math.PR), [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], QA75.5-76.95, Mathematics - Logic, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, Logic in Computer Science (cs.LO), [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Electronic computers. Computer science, Logic (math.LO), Mathematics - Probability
Dateibeschreibung: application/pdf
-
2
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://hal.science/hal-02458330 ; 2023.
Schlagwörter: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2001.11906; info:eu-repo/grantAgreement//659920/EU/A Realizability Approach to Complexity Theory/ReACT; hal-02458330; https://hal.science/hal-02458330; https://hal.science/hal-02458330v5/document; https://hal.science/hal-02458330v5/file/Markov-Zeta2.pdf; ARXIV: 2001.11906
-
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://hal.science/hal-02458330 ; 2022.
Schlagwörter: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2001.11906; info:eu-repo/grantAgreement//659920/EU/A Realizability Approach to Complexity Theory/ReACT; hal-02458330; https://hal.science/hal-02458330; https://hal.science/hal-02458330v4/document; https://hal.science/hal-02458330v4/file/Markov-Zeta2.pdf; ARXIV: 2001.11906
-
4
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://hal.archives-ouvertes.fr/hal-02458330 ; 2021.
Schlagwörter: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2001.11906; hal-02458330; https://hal.archives-ouvertes.fr/hal-02458330; https://hal.archives-ouvertes.fr/hal-02458330v3/document; https://hal.archives-ouvertes.fr/hal-02458330v3/file/MarkovZeta.pdf; ARXIV: 2001.11906
-
5
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Leibniz International Proceedings in Informatics (LIPIcs) ; CONCUR 2017 - 28th International Conference on Concurrency Theory ; https://inria.hal.science/hal-01639845 ; CONCUR 2017 - 28th International Conference on Concurrency Theory, Roland Meyer; Uwe Nestmann, Sep 2017, Berlin, Germany. pp.1-17, ⟨10.4230/LIPIcs.CONCUR.2017.30⟩
Schlagwörter: Reversible Computation, Keywords and phrases Communication-centric Systems, F33 Type Structure, Multiparty Session Types, 1998 ACM Subject Classification F12 Parallelism and Concurrency, Process Calculi, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.4: Type structure, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://hal.archives-ouvertes.fr/hal-02458330 ; 2020.
Schlagwörter: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2001.11906; hal-02458330; https://hal.archives-ouvertes.fr/hal-02458330; https://hal.archives-ouvertes.fr/hal-02458330v2/document; https://hal.archives-ouvertes.fr/hal-02458330v2/file/Markov-Zeta-short.pdf; ARXIV: 2001.11906
-
7
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
https://inria.hal.science/hal-01806129
13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, Jul 2018, Oxford, United KingdomSchlagwörter: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.1: Functional constructs, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Geographisches Schlagwort: Oxford, United Kingdom
-
8
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ISSN: 0304-3975.
Schlagwörter: Termination, Bisimilarity, Higher-order, Process calculi, Unique solution of equations, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: info:eu-repo/grantAgreement//678157/EU/Coinduction for Verification and Certification/CoVeCe
-
9
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://hal.science/hal-01778656 ; 2019.
Schlagwörter: Hereditary history-preserving bisimulation, Reversible CCS, Formal semantics, Process algebras and calculi, 2012 ACM Subject Classification Theory of computation → Program semantics, Computing method-ologies → Concurrent programming languages Keywords and phrases Formal semantics, Configuration structures, Distributed and reversible computation, Auto-concurrency, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.3: Language Constructs and Features/D.3.3.2: Concurrent programming structures, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1804.10355; ARXIV: 1804.10355
-
10
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ENASE 2021 - 16th International Conference on Evaluation of Novel Approaches to Software Engineering ; https://hal.science/hal-03170814 ; ENASE 2021 - 16th International Conference on Evaluation of Novel Approaches to Software Engineering, Apr 2021, online, Czech Republic. pp.138-149, ⟨10.5220/0010462901380149⟩ ; https://enase.scitevents.org/?y=2021
Schlagwörter: BPMN, Timed Models, Workflows, Collaborations, Formal Verification, Alloy, ACM: H.: Information Systems, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
Geographisches Schlagwort: online, Czech Republic
-
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://hal.science/hal-01144215 ; 2015.
Schlagwörter: Process calculi, Type systems, Linear logic, Semantics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1505.07794; ARXIV: 1505.07794
-
12
Autoren: et al.
Weitere Verfasser: et al.
Quelle: CONCUR 2019 ; https://hal.science/hal-02267453 ; CONCUR 2019, Aug 2019, AMSTERDAM, Netherlands
Schlagwörter: reachability, FIFO, termination, Infinite state systems, complexity, flat systems, counters, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, [SCCO.COMP]Cognitive science/Computer science, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Geographisches Schlagwort: AMSTERDAM, Netherlands
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1908.07282; ARXIV: 1908.07282
-
13
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 16th International Symposium on Automated Technology for Verification and Analysis (ATVA 2018)
https://hal.science/hal-01849206
16th International Symposium on Automated Technology for Verification and Analysis (ATVA 2018), Oct 2018, Los Angeles, California, United States. pp.370-386, ⟨10.1007/978-3-030-01090-4_22⟩Schlagwörter: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Geographisches Schlagwort: Los Angeles, California, United States
-
14
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://inria.hal.science/hal-02985273 ; [Research Report] RR-9372, Inria Rennes Bretagne Atlantique; Aalborg University; Université de Toulouse 3 Paul Sabatier. 2020, pp.40.
Schlagwörter: Nondeterministic systems, Probabilistic systems, Probabilistic interfaces, Interface theories, Théories d’interfaces, Interfaces probabilistes, Systèmes probabilistes, Systèmes non-déterministes, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2011.09435; ARXIV: 2011.09435
-
15
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 4th ACM-SIGPLAN Conference on Certified Programs and Proofs (CPP)
https://inria.hal.science/hal-01091524
4th ACM-SIGPLAN Conference on Certified Programs and Proofs (CPP), ACM-SIGPLAN, Jan 2015, Mumbai, India. ⟨10.1145/2676724.2693170⟩
http://cpp2015.inria.frSchlagwörter: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.5: Specification techniques, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: info:eu-repo/grantAgreement//291592/EU/ProofCert: Broad Spectrum Proof Certificates/PROOFCERT
-
16
Autoren: et al.
Weitere Verfasser: et al.
Quelle: 27th International Conference on Concurrency Theory (CONCUR 2016)
https://hal.archives-ouvertes.fr/hal-01976437
27th International Conference on Concurrency Theory (CONCUR 2016), Aug 2016, Quebec City, Canada. 15 p., ⟨10.4230/LIPIcs.CONCUR.2016.23⟩Schlagwörter: Probability, Category theory, Giry monad, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, [INFO]Computer Science [cs]
Geographisches Schlagwort: Quebec City
Time: Quebec City, Canada
Relation: hal-01976437; https://hal.archives-ouvertes.fr/hal-01976437; https://hal.archives-ouvertes.fr/hal-01976437/document; https://hal.archives-ouvertes.fr/hal-01976437/file/Robust_LIPIcs-CONCUR-2016-23.pdf
-
17
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://inria.hal.science/hal-02572971 ; [Research Report] LORIA UMR 7503 CNRS, INRIA, Université de LORRAINE. 2020, pp.36.
Schlagwörter: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
-
18
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Science of Computer Programming. 121:100-127
Schlagwörter: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Explicit vs. implicit semantics, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Algorithme et structure de données, [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], Ontologies and ontology engineering, System design models, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], 0202 electrical engineering, electronic engineering, information engineering, Génie logiciel, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Logique en informatique, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Intelligence artificielle, Models verification and validation, Théorie et langage formel, Domain knowledge
Dateibeschreibung: application/pdf
Zugangs-URL: https://hal-univ-tlse2.archives-ouvertes.fr/hal-01245832
https://www.sciencedirect.com/science/article/pii/S0167642315004153
https://www.sciencedirect.com/science/article/abs/pii/S0167642315004153
https://dl.acm .org/doi/10.1016/j.scico.2015.12.004
https://hal.inria.fr/hal-01245832
https://oatao.univ-toulouse.fr/24847/
https://oatao.univ-toulouse.fr/24847/ -
19
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://inria.hal.science/inria-00330565 ; [Research Report] RR-6664, INRIA. 2008, pp.102.
Schlagwörter: Process calculus, higher-order, behavioral theory, barbed congruence, normal bisimulation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]
-
20
Autoren: et al.
Weitere Verfasser: et al.
Quelle: FSCD 2017: 2nd International Conference on Formal Structures for Computation and Deduction ; https://inria.hal.science/hal-01599176 ; FSCD 2017: 2nd International Conference on Formal Structures for Computation and Deduction, Sep 2017, Oxford, United Kingdom. pp.1 - 11, ⟨10.4230/LIPIcs.FSCD.2017.11⟩
Schlagwörter: Multisets, proof assistants, ordinals, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Geographisches Schlagwort: Oxford, United Kingdom
Full Text Finder 
Nájsť tento článok vo Web of Science