Výsledky vyhľadávania - "Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science"

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Proceedings of the 31st Annual ACM-IEEE Symposium on Logic in Computer Science (LICS 2016) : July 5-8, 2016 New York City, USA / LICS General Chair: Martin Grohe; LICS Conference Chair: Eric Koskinen; LICS Program Chair: Natarajan Shankar

Prispievatelia: Grohe, Martin Koskinen, Eric Shankar, Natarajan

Zdroj: New York, NY : ACM 1 Online-Ressource (901 Seiten) (2016). doi:10.1145/2933575 ; 31. Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, 2016-07-05 - 2016-07-08

Geografické téma: DE

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-1-4503-4391-6

Dostupnosť: https://publications.rwth-aachen.de/record/673425
https://publications.rwth-aachen.de/search?p=id:%22RWTH-2016-08679%22

Axiomatization of Compact Initial Value Problems: Open Properties.

Autori: Platzer, André Qian, Long

Zdroj: Journal of the ACM; Dec2025, Vol. 72 Issue 6, p1-51, 51p

Quantitative Coding and Complexity Theory of Continuous Data: Part I: Motivation, Definition, Consequences.

Autori: Lim, Donghyun Ziegler, Martin

Zdroj: Journal of the ACM; Feb2025, Vol. 72 Issue 1, p1-39, 39p

Predmety: COMPUTABLE analysis, GENERALIZED spaces, COMPACT spaces (Topology), REAL numbers, CODING theory, METRIC spaces

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings

Autori: Carayol, Arnaud Löding, Christof Serre, Olivier a ďalší

Prispievatelia: Carayol, Arnaud Löding, Christof Serre, Olivier a ďalší

Zdroj: LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science ; https://hal.science/hal-01804545 ; LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States. pp.227-236, ⟨10.1145/2933575.2934504⟩

Predmety: [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Geografické téma: New York, United States

Dostupnosť: https://hal.science/hal-01804545
https://hal.science/hal-01804545v1/document
https://hal.science/hal-01804545v1/file/Carayol_Loeding_Serre_LiCS_2016.pdf
https://doi.org/10.1145/2933575.2934504

A Step Up in Expressiveness of Decidable Fixpoint Logics

Autori: Benedikt, Michael Bourhis, Pierre Vanden Boom, Michael a ďalší

Prispievatelia: Benedikt, Michael Bourhis, Pierre Vanden Boom, Michael a ďalší

Zdroj: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science ; https://inria.hal.science/hal-01413890 ; Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2016, New York, United States

Predmety: [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Geografické téma: New York, United States

Dostupnosť: https://inria.hal.science/hal-01413890
https://inria.hal.science/hal-01413890v1/document
https://inria.hal.science/hal-01413890v1/file/LICS16-gnfpup-long.pdf

Coinduction All the Way Up

Autori: Pous, Damien

Prispievatelia: Pous, Damien

Zdroj: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science-LICS '16
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Predmety: Enhancements, Complete lattices, Coinduction, 0202 electrical engineering, electronic engineering, information engineering, GSOS, 02 engineering and technology, [INFO] Computer Science [cs], Parametrised coinduction

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01259622v2/file/cawu.pdf
https://hal.archives-ouvertes.fr/hal-01259622
https://ieeexplore.ieee.org/document/8576415
https://hal.archives-ouvertes.fr/hal-01259622/document
https://dblp.uni-trier.de/db/conf/lics/lics2016.html#Pous16
https://hal.science/hal-01259622v2
https://hal.science/hal-01259622v2/document
https://doi.org/10.1145/2933575.2934564

Definability equals recognizability for graphs of bounded treewidth

Autori: Bojańczyk, Mikołaj Pilipczuk, Michał

Zdroj: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science-LICS '16
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), Formal Languages and Automata Theory (cs.FL), 4. Education, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 16. Peace & justice, 01 natural sciences, Logic in Computer Science (cs.LO), Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics

Prístupová URL adresa: http://arxiv.org/pdf/1605.03045
http://arxiv.org/abs/1605.03045
http://dblp.uni-trier.de/db/journals/corr/corr1605.html#BojanczykP16
https://dblp.uni-trier.de/db/journals/corr/corr1605.html#BojanczykP16
https://ieeexplore.ieee.org/document/8576418

The Definitional Side of the Forcing

Autori: Jaber, Guilhem Lewertowski, Gabriel Pédrot, Pierre-Marie a ďalší

Prispievatelia: Jaber, Guilhem Lewertowski, Gabriel Pédrot, Pierre-Marie a ďalší

Zdroj: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science-LICS '16
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Predmety: Effects, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Dependent type theory, 0202 electrical engineering, electronic engineering, information engineering, Coq, Forcing, 02 engineering and technology, Inductive types, 16. Peace & justice, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], 3. Good health

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01319066/file/main.pdf
https://hal.archives-ouvertes.fr/hal-01319066
https://hal.inria.fr/hal-01319066
https://dblp.uni-trier.de/db/conf/lics/lics2016.html#JaberLPST16
https://hal.archives-ouvertes.fr/hal-01319066/document
https://hal-mines-nantes.archives-ouvertes.fr/hal-01319066v1

On Recurrent Reachability for Continuous Linear Dynamical Systems

Autori: Chonev, Ventsislav Ouaknine, Joël Worrell, James

Zdroj: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science-LICS '16
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Predmety: FOS: Electrical engineering, electronic engineering, information engineering, Systems and Control (eess.SY), 0101 mathematics, Electrical Engineering and Systems Science - Systems and Control, 01 natural sciences, F.2.m

Prístupová URL adresa: http://arxiv.org/pdf/1507.03632
http://arxiv.org/abs/1507.03632
https://dblp.uni-trier.de/db/conf/lics/lics2016.html#ChonevOW16
https://ora.ox.ac.uk/objects/uuid:7e40a52e-1b71-4fb0-b58e-053f0b04d4f0
https://doi.org/10.1145/2933575.2934548
https://ora.ox.ac.uk/objects/uuid:da71face-32f6-4e5c-a132-820497bab752
https://doi.org/10.1145/2933575.2934548

Solvability of Matrix-Exponential Equations

Autori: Ouaknine, Joel Pouly, Amaury Sousa-Pinto, Joao a ďalší

Zdroj: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science-LICS 16
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science-LICS '16
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Computer Science - Discrete Mathematics, Logic in Computer Science (cs.LO)

Prístupová URL adresa: https://ora.ox.ac.uk/objects/uuid:81df8e97-aa74-4803-bb6c-c83c37ef9daf/download_file?safe_filename=Worrell%2Bet%2Bal%252C%2BSolvability%2Bof%2Bmatrix-exponential%2Bequations.pdf&file_format=application%2Fpdf&type_of_work=Conference+item
http://arxiv.org/abs/1601.05002
https://www.arxiv.org/abs/1601.05002
https://core.ac.uk/display/77435171
http://ui.adsabs.harvard.edu/abs/2016arXiv160105002O/abstract
https://arxiv.org/pdf/1601.05002.pdf
http://ieeexplore.ieee.org/document/8576409
https://dl.acm.org/citation.cfm?doid=2933575.2934538
https://dblp.uni-trier.de/db/journals/corr/corr1601.html#OuakninePPW16
https://dl.acm.org/doi/pdf/10.1145/2933575.2934538
https://ieeexplore.ieee.org/document/8576409
https://ora.ox.ac.uk/objects/uuid:e363af1b-045a-4d5f-87e6-b4ff24580290
https://doi.org/10.1145/2933575.2934538
https://ora.ox.ac.uk/objects/uuid:81df8e97-aa74-4803-bb6c-c83c37ef9daf
https://doi.org/10.1145/2933575.2934538

A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine

Autori: Melliès, Paul-André Zeilberger, Noam

Prispievatelia: Melliès, Paul-André Zeilberger, Noam

Zdroj: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science-LICS '16
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science-LICS 16
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Mathematics - Category Theory, Mathematics - Logic, 0102 computer and information sciences, Lawvere's presheaf hyperdoctrine, 16. Peace & justice, type refinement systems, [MATH.MATH-CT] Mathematics [math]/Category Theory [math.CT], 01 natural sciences, Logic in Computer Science (cs.LO), linear logic, FOS: Mathematics, [MATH.MATH-LO] Mathematics [math]/Logic [math.LO], Category Theory (math.CT), monoidal closed chiralities, 0101 mathematics, monoidal closed bifibrations, Logic (math.LO)

Prístupová URL adresa: http://arxiv.org/pdf/1601.06098
http://arxiv.org/abs/1601.06098
https://hal.science/hal-01261955v1
https://research.birmingham.ac.uk/portal/en/publications/a-bifibrational-reconstruction-of-lawveres-presheaf-hyperdoctrine(db2270d3-b7e1-4ba0-82cf-3f8cb713139e).html
https://dl.acm.org/doi/pdf/10.1145/2933575.2934525
https://hal.archives-ouvertes.fr/hal-01261955
https://doi.org/10.1145/2933575.2934525
https://ieeexplore.ieee.org/document/8576448
https://dblp.uni-trier.de/db/journals/corr/corr1601.html#MelliesZ16

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete

Autori: Englert, Matthias Lazic, Ranko Totzke, Patrick

Zdroj: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Englert, M, Lazic, R & Totzke, P 2016, Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete . in LICS '16 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science . New York, USA, pp. 477-484, 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York City, United States, 5/07/16 . https://doi.org/10.1145/2933575.2933577

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, F.1.1, QA76, Logic in Computer Science (cs.LO)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/1602.00477
http://arxiv.org/abs/1602.00477
http://wrap.warwick.ac.uk/78941/7/WRAP_0771998-cs-060516-2vass.pdf
https://ieeexplore.ieee.org/document/8576391
https://arxiv.org/pdf/1602.00477
https://www.research.ed.ac.uk/portal/files/25276455/ELT2016.pdf
https://livrepository.liverpool.ac.uk/3031040/
https://dblp.uni-trier.de/db/journals/corr/corr1602.html#EnglertLT16
https://homepages.inf.ed.ac.uk/ptotzke/blobs/drafts/ELT2016.pdf
https://hdl.handle.net/20.500.11820/84bfc574-5886-494a-841d-fe878245fa67
https://www.pure.ed.ac.uk/ws/files/25276455/ELT2016.pdf

Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints

Autori: Sam Staton Hongseok Yang Chris Heunen a ďalší

Zdroj: Staton, S, Yang, H, Heunen, C, Kammar, O & Wood, F 2016, Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints . in LICS '16 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science . New York, USA, pp. 525-534, 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York City, New York, United States, 5/07/16 . https://doi.org/10.1145/2933575.2935313
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Predmety: FOS: Computer and information sciences, D.3.1, Computer Science - Programming Languages, Artificial Intelligence (cs.AI), I.2.5, Computer Science - Artificial Intelligence, F.3.2, G.3, Programming Languages (cs.PL)

Popis súboru: application/pdf

Prístupová URL adresa: http://dl.acm.org/ft_gateway.cfm?id=2935313&type=pdf
http://arxiv.org/abs/1601.04943
https://arxiv.org/abs/1601.04943
https://arxiv.org/pdf/1601.04943.pdf
http://ui.adsabs.harvard.edu/abs/2016arXiv160104943S/abstract
https://dblp.uni-trier.de/db/journals/corr/corr1601.html#StatonYHKW16
https://homepages.inf.ed.ac.uk/cheunen/publications/2016/probabilistic/probabilistic.pdf
https://www.research.ed.ac.uk/portal/en/publications/semantics-for-probabilistic-programming-higherorder-functions-continuous-distributions-and-soft-constraints(d7bf4f7a-663f-49cb-9f4e-5c184566a989).html
https://ieeexplore.ieee.org/document/8576406
https://arxiv.org/abs/1601.04943
https://dl.acm.org/doi/pdf/10.1145/2933575.2935313
https://ora.ox.ac.uk/objects/uuid:8360e2c7-fa16-456e-8f10-28c24a98b72e
https://doi.org/10.1145/2933575.2935313
https://www.pure.ed.ac.uk/ws/files/25273011/Staton_et_al_2016_Semantics_for_Probabilistic_Programming.pdf
https://hdl.handle.net/20.500.11820/d7bf4f7a-663f-49cb-9f4e-5c184566a989

Duality in Computer Science

Autori: Gehrke, Mai

Zdroj: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science-LICS '16
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

Predmety: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Prístupová URL adresa: https://dl.acm.org/citation.cfm?id=2934575
https://ieeexplore.ieee.org/document/8576455
https://dblp.uni-trier.de/db/conf/lics/lics2016.html#Gehrke16
https://dl.acm.org/doi/pdf/10.1145/2933575.2934575

Guarding Our Vital Systems: A Metric for Critical Infrastructure Cyber Resilience.

Autori: Lubis, Muharman Safitra, Muhammad Fakhrul Fakhrurroja, Hanif a ďalší

Zdroj: Sensors (14248220); Aug2025, Vol. 25 Issue 15, p4545, 36p

Predmety: SITUATIONAL awareness, RISK management in business, BEST practices, INTERNET security, SOFTWARE frameworks, INFRASTRUCTURE (Economics)

On quantitative convergence for stochastic processes: Crossings, fluctuations and martingales.

Autori: Neri, Morenikeji Powell, Thomas

Zdroj: Transactions of the American Mathematical Society, Series B; 7/24/2025, Vol. 12, p974-1019, 46p

Predmety: STOCHASTIC convergence, STOCHASTIC processes, PROOF theory, PROBABILITY theory, DATA extraction

A Domain-theoretic Approach to Statistical Programming Languages.

Autori: GOUBAULT-LARRECQ, JEAN XIAODONG JIA THÉRON, CLÉMENT

Zdroj: Journal of the ACM; Oct2023, Vol. 70 Issue 5, p1-63, 63p

Predmety: PROGRAMMING languages, PROGRAMMING language semantics, PROGRAM transformation, REAL numbers

Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler--Lehman Refinement Steps.

Autori: BERKHOLZ, CHRISTOPH NORDSTRÖM, JAKOB

Zdroj: Journal of the ACM; Oct2023, Vol. 70 Issue 5, p1-31, 32p

Predmety: FIRST-order logic, CONDENSATION, HARDNESS

Compositional runtime enforcement of safety and co-safety timed properties.

Autori: Shankar, Saumya Pinisetty, Srinivas

Zdroj: International Journal on Software Tools for Technology Transfer; Apr2025, Vol. 27 Issue 2, p169-199, 31p

Predmety: INDIVIDUAL needs, PROTOTYPES, SAFETY