Search results for "FoSSaCS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Anthony Widjaja To, Leonid Libkin	Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Nobuko Yoshida, Pierre-Malo Deniélou, Andi Bejleri, Raymond Hu	Parameterised Multiparty Session Types.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Stéphane Demri, Arnaud Sangnier	When Model-Checking Freeze LTL over Counter Machines Becomes Decidable.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Sonja Georgievska, Suzana Andova	Retaining the Probabilities in Probabilistic Testing Theory.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Balder ten Cate, Gaëlle Fontaine	An Easy Completeness Proof for the Modal µ-Calculus on Finite Trees.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Flemming Nielson, Hanne Riis Nielson	Model Checking Is Static Analysis of Modal Logic.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Eugene Asarin, Raphaël Chane-Yack-Fa, Daniele Varacca	Fair Adversaries and Randomization in Two-Player Games.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Thomas Wies, Damien Zufferey, Thomas A. Henzinger	Forward Analysis of Depth-Bounded Processes.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Andrzej S. Murawski, Nikos Tzevelekos	Block Structure vs. Scope Extrusion: Between Innocence and Omniscience.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Lucia Acciai, Michele Boreale, Gianluigi Zavattaro	On the Relationship between Spatial Logics and Behavioral Simulations.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas	Degrees of Lookahead in Regular Infinite Games.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Pierre Chambart, Philippe Schnoebelen	Toward a Compositional Theory of Leftist Grammars and Transformations.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Alexis Saurin	A Hierarchy for Delimited Continuations in Call-by-Name.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Stefan Milius, Lawrence S. Moss, Daniel Schwencke	CIA Structures and the Semantics of Recursion.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Takeshi Tsukada, Naoki Kobayashi 0001	Untyped Recursion Schemes and Infinite Intersection Types.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Andrei Popescu 0001, Elsa L. Gunter	Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Colin Stirling	Introduction to Decidability of Higher-Order Matching.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Jeff Egger, Rasmus Ejlers Møgelberg, Alex Simpson	Linearly-Used Continuations in the Enriched Effect Calculus.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Franck Cassez, Ron van der Meyden, Chenyi Zhang	The Complexity of Synchronous Notions of Information Flow Security.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong (eds.)	Foundations of Software Science and Computational Structures, 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Alexander Heußner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre	Reachability Analysis of Communicating Pushdown Systems.	FoSSaCS	2010	DBLP DOI BibTeX RDF
1	Luca Fossati, Daniele Varacca	The Calculus of Handshake Configurations.	FoSSaCS	2009	DBLP DOI BibTeX RDF	Petri nets, types, process calculus, Handshake protocols
1	Pierre Clairambault	Least and Greatest Fixpoints in Game Semantics.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani	Normal Bisimulations in Calculi with Passivation.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Andrzej S. Murawski, Nikos Tzevelekos	Full Abstraction for Reduced ML.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Rajeev Alur	Temporal Reasoning about Program Executions.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Wolfgang Thomas	Facets of Synthesis: Revisiting Church's Problem.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Joshua D. Guttman	Cryptographic Protocol Composition via the Authentication Tests.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer	Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale	Reactive Systems, Barbed Semantics, and the Mobile Ambients.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Sven Schewe	Tighter Bounds for the Determinisation of Büchi Automata.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva 0001	A Kleene Theorem for Polynomial Coalgebras.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Samy Abbes, Albert Benveniste	Concurrency, sigma-Algebras, and Probabilistic Fairness.	FoSSaCS	2009	DBLP DOI BibTeX RDF	Probabilistic Petri nets, probabilistic event structures, probabilistic fairness, true-concurrency
1	Geoffrey Smith 0001	On the Foundations of Quantitative Information Flow.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Yoad Lustig, Moshe Y. Vardi	Synthesis from Component Libraries.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Christopher H. Broadbent, C.-H. Luke Ong	On Global Model Checking Trees Generated by Higher-Order Recursion Schemes.	FoSSaCS	2009	DBLP DOI BibTeX RDF	Collapsible Pushdown Automaton, Parity Game, Model Checking, Game Semantics, Recursion Scheme
1	Daniel Leivant	On the Completeness of Dynamic Logic.	FoSSaCS	2009	DBLP DOI BibTeX RDF	inductive completeness, relative completeness, arithmetical completeness, Dynamic logic
1	Luca de Alfaro (eds.)	Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Orna Kupferman, Nir Piterman	Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Richard Mayr	Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Jirí Adámek, Stefan Milius, Jirí Velebil	A Description of Iterative Reflections of Monads (Extended Abstract).	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Konstantinos Chatzikokolakis 0001, Gethin Norman, David Parker 0001	Bisimulation for Demonic Schedulers.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl	Realizability of Concurrent Recursive Programs.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Martin R. Neuhäußer, Mariëlle Stoelinga, Joost-Pieter Katoen	Delayed Nondeterminism in Continuous-Time Markov Decision Processes.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Robert S. R. Myers, Dirk Pattinson, Lutz Schröder	Coalgebraic Hybrid Logic.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Béatrice Bérard, Serge Haddad	Interrupt Timed Automata.	FoSSaCS	2009	DBLP DOI BibTeX RDF	decidability of reachability, timed automata, interruptions, Hybrid automata, multi-task systems
1	Julian Gutierrez 0001	Logics and Bisimulation Games for Concurrency, Causality and Conflict.	FoSSaCS	2009	DBLP DOI BibTeX RDF	Bisimulation games, Behavioural equivalences, Concurrent and reactive systems, Petri nets, Modal and temporal logics
1	Rajeev Alur, Aldric Degorre, Oded Maler, Gera Weiss	On Omega-Languages Defined by Mean-Payoff Conditions.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Colin Stirling	Dependency Tree Automata.	FoSSaCS	2009	DBLP DOI BibTeX RDF	binding terms, Tree automata, typed lambda calculus
1	Lars Birkedal, Kristian Støvring, Jacob Thamsborg	Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß	Parameter Reduction in Grammar-Compressed Trees.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Kshitij Bansal, Rémi Brochenin, Étienne Lozes	Beyond Shapes: Lists with Ordered Data.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Timos Antonopoulos, Anuj Dawar	Separating Graph Logic from MSO.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Jesús Aranda, Frank D. Valencia, Cristian Versari	On the Expressive Power of Restriction and Priorities in CCS with Replication.	FoSSaCS	2009	DBLP DOI BibTeX RDF
1	Guillem Godoy, Sebastian Maneth, Sophie Tison	Classes of Tree Homomorphisms with Decidable Preservation of Regularity.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee, Koushik Sen, Thomas A. Henzinger	Model-Checking omega-Regular Properties of Interval Markov Chains.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Jean Goubault-Larrecq	Prevision Domains and Convex Powercones.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Kentaro Kikuchi, Stéphane Lengrand	Strong Normalisation of Cut-Elimination That Simulates beta-Reduction.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Christel Baier, Nathalie Bertrand 0001, Marcus Größer	On Decision Problems for Probabilistic Büchi Automata.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Hermann Gruber, Jan Johannsen	Optimal Lower Bounds on Regular Expression Size Using Communication Complexity.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Hugo Gimbert, Florian Horn 0001	Simple Stochastic Games with Few Random Vertices Are Easy to Solve.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Christelle Braun, Konstantinos Chatzikokolakis 0001, Catuscia Palamidessi	Compositional Methods for Information-Hiding.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Pawel Parys	Systems of Equations Satisfied in All Commutative Finite Semigroups.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Guilherme Rangel, Barbara König 0001, Hartmut Ehrig	Deriving Bisimulation Congruences in the Presence of Negative Application Conditions.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Jean Goubault-Larrecq	Simulation Hemi-metrics between Infinite-State Stochastic Games.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Bruno Barras, Bruno Bernardo	The Implicit Calculus of Constructions as a Programming Language with Dependent Types.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Roberto M. Amadio (eds.)	Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Peter Habermehl, Radu Iosif, Tomás Vojnar	What Else Is Decidable about Integer Arrays?.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Pierre Chambart, Philippe Schnoebelen	The omega-Regular Post Embedding Problem.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Michael Ummels	The Complexity of Nash Equilibria in Infinite Multiplayer Games.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Adam Antonik, Michael Huth 0001, Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasowski	Complexity of Decision Problems for Mixed and Modal Specifications.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Mohammad Raza, Philippa Gardner	Footprints in Local Reasoning.	FoSSaCS	2008	DBLP DOI BibTeX RDF	Hoare Logic, Separation Logic, Local Reasoning, Footprints
1	Manfred Droste, Karin Quaas	A Kleene-Schützenberger Theorem for Weighted Timed Automata.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Deepak Garg 0001, Martín Abadi	A Modal Deconstruction of Access Control Logics.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva 0001	Coalgebraic Logic and Synthesis of Mealy Machines.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Laura Bozzelli	The Complexity of CTL* + Linear Past.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Igor Walukiewicz	Finding Your Way in a Forest: On Different Types of Trees and Their Properties.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Dirk Pattinson, Lutz Schröder	Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Mikolaj Bojanczyk	The Common Fragment of ACTL and LTL.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Stéphane Demri, Ranko Lazic 0001, Arnaud Sangnier	Model Checking Freeze LTL over One-Counter Automata.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier	Robust Analysis of Timed Automata via Channel Machines.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Filippo Bonchi, Ugo Montanari	Symbolic Semantics Revisited.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Bartek Klin, Vladimiro Sassone	Structural Operational Semantics for Stochastic Process Calculi.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Pietro Di Gianantonio, Furio Honsell, Marina Lenisa	RPO, Second-Order Contexts, and lambda-Calculus.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg	Stochastic Games with Lossy Channels.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Ichiro Hasuo, Bart Jacobs 0001, Ana Sokolova	The Microcosm Principle and Concurrency in Coalgebra.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Peter Selinger, Benoît Valiron	A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract).	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Nathan Mishra-Linger, Tim Sheard	Erasure and Polymorphism in Pure Type Systems.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Philippe Darondeau, Blaise Genest, Loïc Hélouët	Products of Message Sequence Charts.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Clara Bertolissi, Claude Kirchner	The Rewriting Calculus as a Combinatory Reduction System.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Akihiko Tozawa, Yasuhiko Minamide	Complexity Results on Balanced Context-Free Languages.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin 0001	Tree Automata with Memory, Visibility and Structural Constraints.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman	Generalized Parity Games.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Jesper Bengtson, Joachim Parrow	Formalising the pi-Calculus Using Nominal Logic.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee	Optimal Strategy Synthesis in Stochastic Müller Games.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Helmut Seidl (eds.)	Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Alessandro Ferrante, Aniello Murano	Enriched µ-Calculi Module Checking.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Grigore Rosu	An Effective Algorithm for the Membership Problem for Extended Regular Expressions.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Daniel Hirschkoff, Damien Pous	A Distribution Law for CCS and a New Congruence Result for the pi-Calculus.	FoSSaCS	2007	DBLP DOI BibTeX RDF
1	Matthew Hague, C.-H. Luke Ong	Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.	FoSSaCS	2007	DBLP DOI BibTeX RDF

Publications at "FoSSaCS"( http://dblp.L3S.de/Venues/FoSSaCS )