[FOM] [LICS] LICS 2012 - Accepted Papers and Call for Participation

Kreutzer, Stephan martin at eipye.com
Wed Apr 11 14:13:47 EDT 2012

           Twenty-Seventh Annual ACM/IEEE Symposium on


                 June 25­28, 2012, Dubrovnik, Croatia

               Call for Participation and Accepted Papers

The LICS Symposium is an annual international forum on theoretical and
practical topics in computer science that relate to logic, broadly construed.
LICS 2012 will be hosted by the University of Dubrovnik, in Dubrovnik,
Croatia, from June 25th to 28th, 2012.

Registration for LICS 2012 is now open. To register for the conference
or its affiliated workshops, please visit.


and follow the link to "Registration".

The Early Registration Deadline is 31 May 2012.

In case of any problems, please contact the conference chairs:
* Vlatko Lipovac, Univ. of Dubrovnik
    vlipovac at unidu.hr
* Andre Scedrov, Univ. of Pennsylvania
    scedrov at math.upenn.edu

LICS 2012 Accepted Papers
	• Parossh Abdulla, Mohamed Faouzi Atig and Jari 
Stenman. Dense-Timed Pushdown Automata
	• Jiří Adámek, Nathan Bowlerr, Paul Blain 
Levy and Stefan Milius. Coproducts of Monads on Set
	• Manindra Agrawal, S. Akshay, Blaise 
Genest  and P. S. Thiagarajan. Approximate 
Verification of the Symbolic Dynamics of Markov Chains
	• Rajeev Alur, Emmannuel Filiot and Ashutosh 
Trivedi. Regular Transformations of Infinite Strings
	• Robert Atkey. The Semantics of  Parsing with Semantic Actions
	• Albert Atserias, Moriitz Müller and Sergi 
Oliva. Proof Complexity of Relativized Statements
	• Arnon Avron, Beata Konikowska and Annna 
Zamansky. Modular Construction of Cut-Free 
Sequent Calculi for Paraconsistent Logics
	• Steve Awodey, Nicola  Gambino and Kristina 
Sojakova. Inductive Types in Homotopy Type Theory
	• David Baelde and Gopalan Nadathur. Coombining 
Deduction Modulo and Logics of Fixed-Point Definitions
	• Pablo Barceló, Diego Figueira and Leonid 
Libbkin. Graph Logics with Rational Relations and 
the Generalized Intersection Problem
	• Libor Barto, Marcin Kozikk and Ross Willard. 
Near Unanimity Constraints have Bounded Pathwidth Duality
	• Christoph Berkholz. Lower Boundds for 
Existential Pebble Games and k-Consistency Tests
	• Jean-Philippe Bernardy and Guilhem Moulin. A 
Computattional Interpretation of Parametricity
	• Daniel Bundalla, Joel Ouaknine and James 
Worrell. On the Magnitude of Completeness Thresholds in Bounded Model Checking
	• Arrnaud Carayol and Olivier Serre. Collapsible 
Pushdown Automata and Labeled Recursion Schemes: 
Equivalence, Safety and Effective Selection
	• Krishnendu Chatterjee and Laaurent Doyen. 
Partial-Observation Stochastic Games: How to Win when Belief Fails
	• Krishnendu Chatterjee and Maathieu Tracol. 
Decidable Problems for Probabilistic Automata on Infinite Words
	• Krishnendu Chatterjee and Yaroon Velner. Mean-Payoff Pushdown Games
	• Hubie Chen andd Victor Dalmau. Decomposing 
Quantified Conjunctive (or Disjunctive) Formulas
	• Hubie Chen and Moritz Müller.  An Algebraic 
Preservation Theorem for ℵ0-categorical Quantified Constraint Satisfaction
	• Yijia Chen and Jö¶rg Flum. On the Ordered Conjecture
	• Pierre Clairambaault, Julian Gutierrez and 
Glynn Winskel. The Winning Ways of Concurrent Games
	• Bob Coecke, Ross Duncan, Alekss Kissinger and 
Quanlong Wang. Strong Complementarity and 
Non-locality in Categorical Quantum Mechanics
	• Carlees Creus, Adrià  Gascón, Guillem Godoy 
and Lander Ramos. The HOM Problem is EXPTIME-complete
	• Michael Elberfeeld, Martin Grohe and Till 
Tantau. Where First-Order and Monadic Second-Order Logic Coincide
	• Viktor Engelmannn, Stephan Kreutzer and 
Sebastian Siebertz. First-Order Model-Checking on Ordered Structures
	• Javier Esparza,  Pierre Ganty and Rupak 
Majumdar. A Perfect Model for Bounded Verification
	• Nathanaël Fijalkow, Hugo Gimbert  and 
Youssouf Oualhadj. Deciding the Value 1 Problem 
of Probabilistic Leaktight Automata
	• Deepak Garg and Valeerio Genovese. 
Countermodels from Sequent Calculi in Multi-Modal Logics
	• Sicun Gao, Jeremy Avigad and Edmund CClarke. 
Delta-Decidability over the Reals
	• Serge Griggorieff and Pierre Valarcher. 
Functionals using Bounded Information and the Dynamics of Algorithms
	• Stefan Gö¶ller, Jean Christoph Jung and 
Markus Lohrey. The Complexity of Decomposing Modal and First-Order Theories
	• Cllemens Grabmayer, Joerg Endrullis, Dimitri 
Hendriks, Jan Willem Klop and Lawrence S. Moss. 
Automatic Sequences and Zip-Specifications
	• Serge Haddad, Sylvain Schmitz annd Philippe 
Schnoebelen. The Ordinal-Recursive Complexity of 
Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets
	• Hugo Herbelin. A Constructive Proof of the 
Axiomm of Dependent Choice, Compatible with Classical Logic
	• Frédéric Herbreteau, B. Srivathsan and 
Igor Walukiewicz. Better Abstractions for Timed Automata
	• Naohikoo Hoshino. Step Indexed Realizability 
Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
	• Guilhem Jaber, Nicolas Tabareau and Matthieu 
Sozeau.. Extending Type Theory with Forcing
	• Sanjay Jain, Allexei Miasnikov and Frank 
Stephan. The Complexity of Verbal Languages over Groups
	• Petr Jancar. Bisimulation EEquivalence for First-Order Grammars
	• Jean-Baptiste JJeannin and Dexter Kozen. Capsules and Separation Logic
	• Emanuel Kieronski, Jakub Michaliszyn, Ian 
Pratt-Hartmmann and Lidia Tendera. Two-Variable 
First-Order Logic with Equivalence Closure
	• Anvesh Komuravelli, Corina S.. Pasareanu and 
Edmund M. Clarke. Learning Probabilistic Systems from Tree Samples
	• Andreas Krebs and A. V. Srreejith. 
Non-definability of Languages by Generalized First-Order Formulas over (N,+)
	• Annabelle McIver, Larisssa Meinicke and 
Carroll Morgan. A Kantorovich-Monadic Powerdomain 
for Information Hiding, with Probability and Nondeterminism
	• Damiano Mazza. An Infinitary Affine 
Lammbda-Calculus Isomorphic to the Full Lambda-Calculus
	•¢ Paul-André Melliès. Game Semantics in String Diagrams
	• Jakub Michaliszyn and Jan Otop. Decidable Elementarry Modal Logics
	• Benoît Monin and Laurent Bienvenu.  von Neumann's Biased Coin Revisited
	• Sebastian Mulleer and Iddo Tzameret. Short 
Propositional Refutations for Dense Random 3CNF Formulas
	• Vivek Nigam. On the Compplexity of Linear Authorization Logics
	• Pawel Parys.  On the Significance of the Collapse Operation
	• Adrieen Piérard and Eijiro Sumii. A 
Higher-Order Distributed Calculus with Name Creation
	• Andre Platzer. The Compllete Proof Theory of Hybrid Systems
	• Sasha Rubin and  Alexander Rabinovich. Interpetations in Scattered Trees
	• David Sabel and Manfred Schmidt-Schauss. 
Conservativve Concurrency in Haskell
	• Peter Schuster. Induction  in Algebra: A First Case Study
	• Hugh Steele and Andrrea Schalk. Constructing 
Fully Complete Models for Multiplicative Linear Logic
	• Tony Tan. An Automata Model foor Trees with Ordered Data Values
	• Dmitriy Traytel, AAndrei Popescu and Jasmin 
Christian Blanchette. Foundational, Compositional 
(Co)Datatypes for Higher-Order Logic
	• Jamie Vicary. Higher Semantics of Quantum Protocols

You are subscribed to the lics mailing list 
because you have signed up for it in the past. 
Submissions to the newsletter: Send an email to 
las-lics at lists.tu-berlin.de (moderated) or 
lics at informatik.hu-berlin.de. Unsubscribe: To 
unsubscribe, please send an email to 
las-lics-request at lists.tu-berlin.de with the 
keyword 'unsubscribe' in the message body 
(without '). Subscribe: To subscribe,  please 
send an email to 
las-lics-request at lists.tu-berlin.de with the 
keyword 'subscribe' in the message body (without ').

More information about the FOM mailing list