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

Treffer 201 - 220 von 1.806

201

Undecidability of Multiplicative Subexponential Logic
Chaudhuri, Kaustuv ; Proof search and reasoning with logic specifications (PARSIFAL) ; Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX) ; et al.
Proceedings of the Third International Workshop on Linearity. :1-8

Vienna, Austria ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.1: Mathematical Logi... F.4.1.1: Computational l... [INFO.INFO-LO]Computer S... …
Konferenz
Zu den Favoriten
202

Computability of the entropy of one-tape Turing Machines
Jeandel, Emmanuel ; Theoretical adverse computations, and safety (CARTE) ; Centre Inria de l'Université de Lorraine ; et al.
STACS - Symposium on Theoretical Aspects of Computer Science. :421-432

Lyon, France entropy Turing machines ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... F.1.1: Models of Computa... …
Konferenz
Zu den Favoriten
203

Replicated Data Types: Specification, Verification, Optimality
Burckhardt, Sebastian ; Gotsman, Alexey ; Yang, Hongseok ; et al.
POPL 2014: 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. :271-284

San Diego, CA, United St... replicated data data types consistency eventual consistency CRDTs …
Konferenz
Zu den Favoriten
204

Modeling parsimonious putative regulatory networks: complexity and heuristic approach
Acuña, Vicente ; Aravena, Andrés ; Maass, Alejandro ; et al.
15th conference in Verification. :322-336

San Diego, United States ACM: J.: Computer Applic... J.3: LIFE AND MEDICAL SC... J.3.0: Biology and genet... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Konferenz
Zu den Favoriten
205

Indexes of individual repeatability and product discrimination in TDS and TCATA and their statistical inference
Frascolla, Cindy ; Visalli, Michel ; Cardot, Hervé ; et al.
Food Quality and Preference. 110:104929-104929

Permutation test Jaccard index Product discrimination Panelist repeatability Temporal Check-All-That-... Temporal Dominance of Se... …
Zeitschrift
Zu den Favoriten
206

Evaluation of the CEC (Correct Eventual Consistency) Tool
Évaluation de l'outil CEC (Correct Eventual Consistency) pour la vérification des applications à cohérence à terme
Nair, Sreeja, S ; Large-Scale Distributed Systems and Applications (Regal) ; Laboratoire d'Informatique de Paris 6 (LIP6) ; et al.
[Research Report] RR-9111. :1-27

weak consistency consistency CISE logic ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.4: Distributed Syste... …
Report
Zu den Favoriten
207

A Type-based Analysis of Causality Loops in Hybrid Systems Modelers
Benveniste, Albert ; Bourke, Timothy ; Caillaud, Benoît ; et al.
Nonlinear Analysis: Hybrid Systems. 26:168-189

Hybrid systems Synchronous programming... Type systems Numerical solver Mathematical modelling l... HybridLang …
Zeitschrift
Zu den Favoriten
208

Polarizing Double Negation Translations
Boudard, Mélanie ; Hermant, Olivier ; Parallélisme, Réseaux, Systèmes, Modélisation (PRISM) ; et al.
LPAR. :182-197

Stellenbosch, South Afri... classical logic intuitionnistic logic double-negation translat... focusing ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
209

Semantic A-translation and Super-consistency entail Classical Cut Elimination
Allali, Lisa ; Hermant, Olivier ; Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX) ; et al.
LPAR 19 - 19th Conference on Logic for Programming. :407-422

Stellenbosch, South Afri... Deduction modulo cut elimination A-translation pseudo-Heyting algebra super-consistency …
Konferenz
Zu den Favoriten
210

On Bar Recursion and Choice in a Classical Setting
Blot, Valentin ; Riba, Colin ; Laboratoire de l'Informatique du Parallélisme (LIP) ; et al.
Programming Languages and Systems - 11th Asian Symposium. :349-364

Melbourne, Australia Games Semantics Bar-Recursion Lambda-Mu-Calculus Classical Realizability ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
211

Coherent Presentations of Monoidal Categories
Curien, Pierre-Louis ; Mimram, Samuel ; Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)) ; et al.
Logical Methods in Computer Science. 13(3):1-38

ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.2: Grammars and Othe... [INFO.INFO-LO]Computer S... Logic in Computer Scienc... [MATH.MATH-CT]Mathematic... …
Zeitschrift
Zu den Favoriten
212

Safe CCSL Specifications and Marked Graphs
Mallet, Frédéric ; Millo, Jean-Vivien ; de Simone, Robert ; et al.
MEMOCODE - 11th IEEE/ACM International Conference on Formal Methods and Models for Codesign. :157-166

Portland, United States ACM: D.: Software D.2: SOFTWARE ENGINEERIN... D.2.2: Design Tools and... ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... …
Konferenz
Zu den Favoriten
213

The complexity of data aggregation in static and dynamic wireless sensor networks
Bramas, Quentin ; Tixeuil, Sébastien ; Networks and Performance Analysis (NPA) ; et al.
Information and Computation. 255(3):369-383

Dynamic graphs Complexity Data aggregation ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... ACM: D.: Software …
Zeitschrift
Zu den Favoriten
214

25 Years of Formal Proof Cultures: Some Problems, Some Philosophy, Bright Future
Honsell, Furio ; Dipartimento di Matematica e Informatica - Universita Udine (DIMI) ; Università degli Studi di Udine - University of Udine [Italie]
LFMTP 2013. :37-42

Boston, United States logical frameworks type theory ACM: F.: Theory of Compu... F.3: LOGICS AND MEANINGS... [INFO.INFO-LO]Computer S... …
Konferenz
Zu den Favoriten
215

A characterization of the Taylor expansion of lambda-terms
Boudes, Pierre ; He, Fanny ; Pagani, Michele ; et al.
22nd EACSL Annual Conference Computer Science Logic (CSL 2013). :101-115

Turin, Italy Linear Logic Differential Lambda-Calc... Böhm-trees Lambda-Calculus ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
216

The Power of Priority Channel Systems
Haase, Christoph ; Schmitz, Sylvain ; Schnoebelen, Philippe ; et al.
24th International Conference on Concurrency Theory. :1-39

Buenos Aires, Argentina Well quasi order well-structured transiti... fast-growing complexity F.3.1; F.4.1 ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
217

Subformula Linking as an Interaction Method
Chaudhuri, Kaustuv ; Proof search and reasoning with logic specifications (PARSIFAL) ; Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX) ; et al.
4th Conference on Interactive Theorem Proving. :386-401

Rennes, France interactive theorem prov... deep inference calculus of structures proof by pointing ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
218

Algebraic Framework for Synchronous Language Semantics
Gaffé, Daniel ; Ressouche, Annie ; Laboratoire d'Electronique, Antennes et Télécommunications (LEAT) ; et al.
Theoritical Aspects of Software Engineering. :51-58

Birmingham, United Kingd... bilattice multi-valued algebras formal semantics synchonous languanges ACM: F.: Theory of Compu... …
Konferenz
Zu den Favoriten
219

On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems
Faugère, Jean-Charles ; Safey El Din, Mohab ; Verron, Thibaut ; et al.
The 38th International Symposium on Symbolic and Algebraic Computation. :189-196

Boston, Maine, United St... Polynomial system solvin... Quasi-homogeneous polyno... Gröbner bases ACM: I.: Computing Metho... I.1: SYMBOLIC AND ALGEBR... …
Konferenz
Zu den Favoriten
220

Realizability for Peano Arithmetic with Winning Conditions in HON Games
Blot, Valentin ; Laboratoire de l'Informatique du Parallélisme (LIP) ; École normale supérieure de Lyon (ENS de Lyon) ; et al.
Typed Lambda Calculi and Applications. :77-92

Eindhoven, Netherlands Hyland Ong game semantic... Peano arithmetic Classical realizability ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... …
Konferenz
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter