Treffer 121 - 140 von 1.805

121

On the Complexity of Computing Treebreadth
Ducoffe, Guillaume ; Legay, Sylvain ; Nisse, Nicolas ; et al.
27th International Workshop on Combinatorial Algorithms. :3-15

Helsinki, Finland 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
122

First-order definability of rational transductions: An algebraic approach
Filiot, Emmanuel ; Gauwin, Olivier ; Lhote, Nathan ; et al.
31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'16). :387-396

New York, United States rational word transducti... definability problems first-order logic algebraic characterizati... ACM: F.: Theory of Compu...
Konferenz
Zu den Favoriten
123

The Complexity of Coverability in ν-Petri Nets
Lazić, Ranko ; Schmitz, Sylvain ; Centre for Discrete Mathematics and its Applications [Warwick] (DIMAP) ; et al.
LICS 2016 - 31th Annual ACM/IEEE Symposium on Logic in Computer Science. :467-476

New York, United States Well-structured transiti... Formal verification Well-quasi-order Order ideal Fast-growing complexity
Konferenz
Zu den Favoriten
124

The Typical Constructible Object
Hoyrup, Mathieu ; Theoretical adverse computations, and safety (CARTE) ; Centre Inria de l'Université de Lorraine ; et al.
Computability In Europe. :115-123

Paris, France Generic Baire category Computability ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST...
Konferenz
Zu den Favoriten
125

Computability in Symbolic Dynamics
Jeandel, Emmanuel ; Theoretical adverse computations, and safety (CARTE) ; Centre Inria de l'Université de Lorraine ; et al.
CiE. :124-131

Paris, France ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... F.1.1: Models of Computa... F.1.1.2: Computability t... [INFO.INFO-DM]Computer S...
Konferenz
Zu den Favoriten
126

Functions-as-constructors Higher-order Unification
Libal, Tomer ; Miller, Dale ; Proof search and reasoning with logic specifications (PARSIFAL) ; et al.
1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016). :1-17

Porto, Portugal Coq Proof Assistant lambda-prolog pattern unification higher-order unification Mathematical Logic: Mech...
Konferenz
Zu den Favoriten
127

Automatic Detection of GUI Design Smells: The Case of Blob Listener
Lelli, Valéria ; Blouin, Arnaud ; Baudry, Benoit ; et al.
Proceedings of the 8th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS'16). :263-274

Brussels, Belgium User interface design smell software validation code quality ACM: F.: Theory of Compu...
Konferenz
Zu den Favoriten
128

An evaluation of complete approaches for the sum colouring problem
Évaluation d'approches complètes pour le problème de somme coloration
An evaluation of complete approaches for the sum colouring problem: Extended version
Évaluation d'approches complètes pour le problème de somme coloration: Version étendue

Minot, Maël ; Ndiaye, Samba Ndojh ; Solnon, Christine ; et al.
Douzièmes Journées Francophones de Programmation par Contraintes (JFPC 2016). :1-10

Montpellier, France complete approaches variable choice heuristi... CSP graphs sum colouring
Konferenz
Zu den Favoriten
129

Varieties of Cost Functions
Daviaud, Laure ; Kuperberg, Denis ; Pin, Jean-Eric ; et al.
33rd Symposium on Theoretical Aspects of Computer Science. :1-30

Orléans, France syntactic algebra varieties regular language Cost functions ACM: F.: Theory of Compu...
Konferenz
Zu den Favoriten
130

'Cause I'm Strong Enough: Reasoning about Consistency Choices in Distributed Systems
Gotsman, Alexey ; Yang, Hongseok ; Ferreira, Carla ; et al.
Symposium on Principles of Programming Languages. :371-384

Saint Petersburg, FL, Un... integrity invariants causal consistency Replication ACM: D.: Software D.2: SOFTWARE ENGINEERIN...
Konferenz
Zu den Favoriten
131

Horizontally Elastic Edge-Finder Algorithm for Cumulative Resource Constraint Revisited
Algorithme d'Edge-Finding Horizontalement Elastique pour la Contrainte de Ressource Cumulative Revisité

Fetgo Betmbe, Sévérine ; Djamegni, Clémentin, Tayou ; Laboratoire d'Informatique Fondamentale et Appliquée (LIFA) ; et al.
CARI 2020, Oct 2020, THIES, Senegal

THIES, Senegal Horizontally elastic sch... 'Profile' data structure Edge finder Cumulative scheduling Constraint programming
Konferenz
Zu den Favoriten
132

Pattern eliminating transformations
Cirstea, Horatiu ; Lermusiaux, Pierre ; Moreau, Pierre-Etienne ; et al.
LOPSTR 2020 - 30th International Symposium on Logic-Based Program Synthesis and Transformation, Sep 2020, Bologna, Italy

Bologna, Italy Pattern semantics Pattern-matching Rewriting ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC...
Konferenz
Zu den Favoriten
133

Learning Specifications for Labelled Patterns
Basset, Nicolas ; Dang, Thao ; Mambakam, Akshay ; et al.
Proceedinfs of the 18th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2020), Sep 2020, Vienna, Austria

Vienna, Austria Signal Temporal Logic Pareto Multi-criteria Op... Monotonic Specification... Signal Pattern Matching ACM: F.: Theory of Compu...
Konferenz
Zu den Favoriten
134

Linear high-order deterministic tree transducers with regular look-ahead
Gallot, Paul, D ; Lemay, Aurélien ; Salvati, Sylvain ; et al.
MFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science, Andreas Feldmann; Michal Koucky; Anna Kotesovcova, Aug 2020, Prague, Czech Republic. ⟨10.4230/LIPIcs.MFCS.2020.34⟩

Prague, Czech Republic Transducers λ-calculus Tree lanuages and phrases Transducers Trees 31
Konferenz
Zu den Favoriten
135

Towards a formal account for software transactional memory
Medić, Doriana ; Antares Mezzina, Claudio ; Phillips, Iain ; et al.
RC 2020 - 12th International Conference on Reversible Computation, Jul 2020, Oslo, Norway

Oslo, Norway ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.3: Formal Languages [INFO]Computer Science [... [INFO.INFO-FL]Computer S...
Konferenz
Zu den Favoriten
136

Observation and Distinction. Representing Information in Infinite Games
Berwanger, Dietmar ; Doyen, Laurent ; Centre National de la Recherche Scientifique (CNRS) ; et al.
37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Mar 2020, Grenoble, France. ⟨10.4230/LIPIcs.STACS.2020.48⟩

Grenoble, France ACM: F.: Theory of Compu... ACM: G.: Mathematics of... ACM: I.: Computing Metho... I.2: ARTIFICIAL INTELLIG... [INFO.INFO-GT]Computer S...
Konferenz
Zu den Favoriten
137

Analyse didactique d’un jeu de recherche : vers une situation fondamentale pour la complexité d’algorithmes et de problèmes
Meyer, Antoine ; Modeste, Simon ; Laboratoire d'Informatique Gaspard-Monge (LIGM) ; et al.

Lille, France complexité algorithme problème didactique ACM: F.: Theory of Compu...
Konferenz
Zu den Favoriten
138

Par Means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs
Aschieri, Federico ; Genco, Francesco, A ; Vienna University of Technology = Technische Universität Wien (TU Wien) ; et al.
POPL 2020, Jan 2020, New Orleans, Louisiana, United States

New Orleans, Louisiana,... ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.1: Mathematical Logi... F.4.1.7: Proof theory F.4.1.2: Lambda calculus...
Konferenz
Zu den Favoriten
139

Asynchronous wreath product and cascade decompositions for concurrent behaviours
Adsul, Bharat ; Gastin, Paul ; Sarkar, Saptarshi ; et al.
Logical Methods in Computer Science, 2022, ⟨10.46298/LMCS-18(2:22)2022⟩

Mazurkiewicz traces asynchronous automata wreath product cascade product Krohn Rhodes decompositi... local temporal logic ove...
Zeitschrift
Zu den Favoriten
140

Towards Corecursion Without Corecursion in Coq
Rusu, Vlad ; Nowak, David ; Analyse symbolique et conception orientée composants pour des systèmes embarqués temps-réel modulaires (SYCOMORES) ; et al.

ACM: F.: Theory of Compu... F.3: LOGICS AND MEANINGS... F.3.3: Studies of Progra... F.3.3.1: Functional cons... [INFO.INFO-SE]Computer S... Software Engineering [cs...
E-Ressource
Zu den Favoriten

Filter