• Suche: "ACM: F.: Theory of Computation"

Treffer 101 - 120 von 1.805

101

Hypercollecting Semantics and its Application to Static Analysis of Information Flow
Assaf, Mounir ; Naumann, David, A ; Signoles, Julien ; et al.
POPL 2017 - ACM Symposium on Principles of Programming Languages. :874-887

Paris, France information flow abstract interpretation static analysis ACM: D.: Software D.2: SOFTWARE ENGINEERIN... …
Konferenz
Zu den Favoriten
102

A proof theory for model checking
Heath, Quentin ; Miller, Dale ; Proof search and reasoning with logic specifications (PARSIFAL) ; et al.
Journal of Automated Reasoning. 63(4):857-885

ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.1: Mathematical Logi... F.4.1.7: Proof theory F.4.1.1: Computational l... [INFO.INFO-LO]Computer S... …
Zeitschrift
Zu den Favoriten
103

Mechanized metatheory revisited
Miller, Dale ; Proof search and reasoning with logic specifications (PARSIFAL) ; Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX) ; et al.
Journal of Automated Reasoning. 63(3):625-665

Mechanized metatheory λ Tree syntax Mobility of binders ACM: F.: Theory of Compu... F.3: LOGICS AND MEANINGS... F.3.1: Specifying and Ve... …
Zeitschrift
Zu den Favoriten
104

Linking indexing data structures to de Bruijn graphs: Construction and update
Cazaux, Bastien ; Lecroq, Thierry ; Rivals, Eric ; et al.
Journal of Computer and System Sciences. 104:165-183

Dynamic update Overlap Bioinformatics Data structure Contracted de Bruijn gra... Algorithms …
Zeitschrift
Zu den Favoriten
105

Complexity Study for the Robust Stable Marriage Problem
Genc, Begum ; Siala, Mohamed ; Simonin, Gilles ; et al.
Theoretical Computer Science. 775:76-92

Robust Stable Marriage Computational Social Cho... Algorithmic Complexity Stable Matching Robust optimisation Artificial inteligence …
Zeitschrift
Zu den Favoriten
106

On the decidability of the existence of polyhedral invariants in transition systems
Monniaux, David ; VERIMAG (VERIMAG - IMAG) ; Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]) ; et al.
Acta Informatica. 56(4):385-389

MSC 68Q17 68Q60 03D80 03... ACM: D.: Software D.2: SOFTWARE ENGINEERIN... D.2.4: Software Program Verification D.2.4.2: Correctness pro... …
Zeitschrift
Zu den Favoriten
107

Combining logical and distributional methods in type-logical grammars
Moot, Richard ; Exploration et exploitation de données textuelles (TEXTE) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.
Journal of Language Modelling. 6(2):287-317

Lambek calculus Theorem proving Processing Type-logical grammar ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... …
Zeitschrift
Zu den Favoriten
108

A Classical Sequent Calculus with Dependent Types
Miquey, Étienne ; Gallinette : vers une nouvelle génération d'assistant à la preuve (LS2N - équipe GALLINETTE) ; Centre Inria de l'Université de Rennes ; et al.
ACM Transactions on Programming Languages and Systems (TOPLAS). 41(2):1-48

Call-by-value Continuation-passing sty... Delimited continuations Calue restriction Sequent calculus Proof theory …
Zeitschrift
Zu den Favoriten
109

Synchronous Gathering without Multiplicity Detection: a Certified Algorithm
Balabonski, Thibaut ; Delga, Amélie ; Rieg, Lionel ; et al.
Theory of Computing Systems. 63(2):200-218

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.4: Distributed Syste... C.2.4.1: Distributed app... ACM: D.: Software D.4: OPERATING SYSTEMS …
Zeitschrift
Zu den Favoriten
110

An Analytic Calculus for the Intuitionistic Logic of Proofs
Hill, Brian ; Poggiolesi, Francesca ; Groupement de Recherche et d'Etudes en Gestion à HEC (GREGH) ; et al.
Notre Dame Journal of Formal Logic. 60:353-393

normalisation logic of proofs cut-elimination proof sequents 2010 MSC: 03F05 ,03B60 ACM: I.: Computing Metho... …
Zeitschrift
Zu den Favoriten
111

Unification of Drags and Confluence of Drag Rewriting
Jouannaud, Jean-Pierre ; Orejas, Fernando ; Laboratoire Méthodes Formelles (LMF) ; et al.

Drags graphs unification confluence ACM: D.: Software ACM: F.: Theory of Compu... …
E-Ressource
Zu den Favoriten
112

Fonctions de couplage et chaînage des courbes de Gray surfaciques en forme de lacets
Rotgé, Jean-François ; Université de Montréal (UdeM)

ACM: F.: Theory of Compu... [INFO]Computer Science [... [MATH]Mathematics [math]
E-Ressource
Zu den Favoriten
113

The dark side of financial dynamics: a Schumpeterian destructive creation process
Lyubov Klapkiv ; Faruk Ulgen ; Ciesla, Catherine ; et al.
Bank i Kredyt. 55:661-682

financial crises JEL: G - Financial Econo... JEL: O - Economic Develo... ekonomia ewolucyjna Methodology and Heterodox Approaches... …
Fachzeitschrift
Zu den Favoriten
114

On the width of complicated JSJ decompositions
Sur la largeur des décompositions JSJ compliquées
Huszár, Kristóf ; Spreer, Jonathan ; Laboratoire de l'Informatique du Parallélisme (LIP) ; et al.
39th International Symposium on Computational Geometry (SoCG 2023). :42-42

Dallas, United States generalized Heegaard spl... fixed-parameter tractabi... computational 3-manifold... triangulations treewidth …
Konferenz
Zu den Favoriten
115

Safe Sets in Graphs: Graph Classes and Structural Parameters
Cohen, Nathann ; Águeda, Raquel ; Fujita, Shinya ; et al.
COCOA 2016 - 10th International Conference Combinatorial Optimization and Applications. :241-253

Hong Kong, China interval graph treewidth graph algorithm safe set fixed-parameter tractabi... …
Konferenz
Zu den Favoriten
116

Deriving Inverse Operators for Modal Logic
Guzman, Michell ; Perchy, Salim ; Rueda, Camilo ; et al.
Theoretical Aspects of Computing – ICTAC 2016. :214-232

Taipei, Taiwan modal logic bisimulation modal algebra constraint systems order theory …
Konferenz
Zu den Favoriten
117

Solving Language Equations Using Flanked Automata
Avellaneda, Florent ; Dal Zilio, Silvano ; Raclet, Jean-Baptiste ; et al.
ATVA 2016: Automated Technology for Verification and Analysis. :106-121

Chiba, Japan Finite Automata Verification ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.3: Formal Languages …
Konferenz
Zu den Favoriten
118

The Parallel Complexity of Coloring Games
Ducoffe, Guillaume ; Combinatorics, Optimization and Algorithms for Telecommunications (COATI) ; Centre Inria d'Université Côte d'Azur ; et al.
9th International Symposium. :27-39

Liverpool, United Kingdo... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... [INFO.INFO-CC]Computer S... …
Konferenz
Zu den Favoriten
119

A Sequent Calculus for a Modal Logic on Finite Data Trees
Baelde, David ; Lunel, Simon ; Schmitz, Sylvain ; et al.
CSL 2016. :1-16

Marseille, France XPath proof systems modal logic complexity ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
120

Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
Lucarelli, Giorgio ; Kim Thang, Nguyen ; Srivastav, Abhinav ; et al.
European Symposium on Algorithms (ESA 2016). :1-17

Aarhus, Denmark Primal-dual algorithms Online algorithms Non-preemptive schedulin... Resource augmentation ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter