Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th LICS 2010: Edinburgh, Scotland, United Kingdom
- Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom. IEEE Computer Society 2010, ISBN 978-0-7695-4114-3
Finite Model Theory
- Vince Bárány, Georg Gottlob
, Martin Otto:
Querying the Guarded Fragment. 1-10 - Martin Otto:
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment. 11-20
Type theory
- Vincent Siles, Hugo Herbelin:
Equality Is Typable in Semi-full Pure Type Systems. 21-30 - Andrei Popescu, Elsa L. Gunter, Christopher J. Osborn:
Strong Normalization for System F by HOAS on Top of FOAS. 31-40 - James Laird:
Game Semantics for a Polymorphic Programming Language. 41-49 - Hugo Herbelin:
An Intuitionistic Logic that Proves Markov's Principle. 50-56
Tribute to Amir and Robin
- David Harel:
Amir Pnueli: A Gentle Giant, Lord of the Phi's and the Psi's. 57 - Gordon D. Plotkin:
Robin Milner, a Craftsman of Tools for the Mind. 58-59
Logic and Automata
- Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell:
Alternating Timed Automata over Bounded Time. 60-69 - Thomas Colcombet, Christof Löding:
Regular Cost Functions over Finite Trees. 70-79 - Eryk Kopczynski, Anthony Widjaja To:
Parikh Images of Grammars: Complexity and Applications. 80-89
Complexity of CSP
- Manuel Bodirsky, Martin Hils, Barnaby Martin:
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. 90-99 - Libor Barto, Marcin Kozik:
New Conditions for Taylor Varieties and CSP. 100-109
Invited Lecture
- Martín Abadi:
The Fine Print of Security. 110
Semantics
- Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop:
Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. 111-119 - Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre:
Recursion Schemes and Logical Reflection. 120-129 - James Brotherston, Max I. Kanovich:
Undecidability of Propositional Separation Logic and Its Neighbours. 130-139 - Dominique Larchey-Wendling, Didier Galmiche:
The Undecidability of Boolean BI through Phase Semantics. 140-149 - Paul-André Melliès:
Segal Condition Meets Computational Effects. 150-159
Finite Model Theory
- Dietrich Kuske, Jiamou Liu, Markus Lohrey:
The Isomorphism Problem on Classes of Automatic Structures. 160-169 - Yuguo He:
On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures. 170-178
Finite Model Theory
- Martin Grohe:
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors. 179-188 - Stephan Kreutzer, Siamak Tazari:
Lower Bounds for the Complexity of Monadic Second-Order Logic. 189-198 - Bastian Laubner:
Capturing Polynomial Time on Interval Graphs. 199-208
Logics
- Patricia Johann, Alex Simpson, Janis Voigtländer:
A Generic Operational Metatheory for Algebraic Effects. 209-218 - Noam Zeilberger:
Polarity and the Logic of Delimited Continuations. 219-227
Keynote Lecture
- Andrea Calì, Georg Gottlob, Thomas Lukasiewicz, Bruno Marnette, Andreas Pieris:
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications. 228-242
Logic and Automata
- Mikolaj Bojanczyk, Slawomir Lasota:
An Extension of Data Automata that Captures XPath. 243-252 - Thomas Place, Luc Segoufin:
Deciding Definability in FO2(<) (or XPath) on Trees. 253-262 - Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher:
The Emptiness Problem for Tree Automata with Global Constraints. 263-272 - Nicole Schweikardt, Luc Segoufin:
Addition-Invariant FO and Regularity. 273-282
Keynote Lecture
- J Strother Moore:
Theorem Proving for Verification: The Early Days. 283
Logics
- Alessio Guglielmi, Tom Gundersen, Lutz Straßburger:
Breaking Paths in Atomic Flows for Classical Logic. 284-293 - Michele Basaldella, Kazushige Terui:
Infinitary Completeness in Ludics. 294-303 - Arnon Avron, Ofer Arieli, Anna Zamansky:
On Strong Maximality of Paraconsistent Finite-Valued Logics. 304-313
Invited Lecture
- Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi:
Probabilistic Information Flow. 314-321
Process Calculi
- Magnus Johansson, Jesper Bengtson, Joachim Parrow, Björn Victor:
Weak Equivalences in Psi-Calculi. 322-331 - Massimo Bartoletti, Roberto Zunino:
A Calculus of Contracting Processes. 332-341 - Christian Eisentraut, Holger Hermanns, Lijun Zhang:
On Probabilistic Automata in Continuous Time. 342-351 - Jean Goubault-Larrecq:
omega-QRB-Domains and the Probabilistic Powerdomain. 352-361
Invited Lecture
- Vincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jean Krivine:
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction. 362-381
Concurrency
- Cosimo Laneve, Antonio Vitale:
The Expressive Power of Synchronizations. 382-391 - Sam Staton, Glynn Winskel:
On the Expressivity of Symmetry in Event Structures. 392-401 - Thomas Ehrhard:
A Finiteness Structure on Resource Terms. 402-410
Coalgebras
- Samson Abramsky:
Coalgebras, Chu Spaces, and Representations of Physical Systems. 411-420 - Stefan Milius:
A Sound and Complete Calculus for Finite Stream Circuits. 421-430
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-31 18:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
