Search results for "FoSSaCS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Lucian Wischik, Philippa Gardner	Strong Bisimulation for the Explicit Fusion Calculus.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Daniel Leivant	Partial Correctness Assertions Provable in Dynamic Logics.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Roberto Zunino, Pierpaolo Degano	A Note on the Perfect Encryption Assumption in a Process Calculus.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Dan R. Ghica, Andrzej S. Murawski	Angelic Semantics of Fine-Grained Concurrency.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Blaise Genest, Marius Minea, Anca Muscholl, Doron A. Peled	Specifying and Verifying Partial Order Properties Using Template MSCs.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Luís Caires	Behavioral and Spatial Observations in a Logic for the pi-Calculus.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Matthew Hennessy, Julian Rathke, Nobuko Yoshida	safeDpi: A Language for Controlling Mobile Code.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Sebastian Maneth, Giorgio Busatto	Tree Transducers and Tree Compressions.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Wieslaw Zielonka	Perfect-Information Stochastic Parity Games.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Hubert Comon-Lundh	Intruder Theories (Ongoing Work).	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Patrick Baillot, Virgile Mogbil	Soft lambda-Calculus: A Language for Polynomial Time Computation.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Daniel Kirsten	Distance Desert Automata and the Star Height One Problem.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	James Laird	A Game Semantics of Local Names and Good Variables.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Liana Bozga, Cristian Ene, Yassine Lakhnech	On the Existence of an Effective and Complete Inference System for Cryptographic Protocols.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Antoine Meyer	On Term Rewriting Systems Having a Rational Derivation.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Wan J. Fokkink, Sumit Nain	On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds.	FoSSaCS	2004	DBLP DOI BibTeX RDF
1	Tamarah Arons, Amir Pnueli, Lenore D. Zuck	Parameterized Verification by Probabilistic Abstraction.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Samson Abramsky, Radha Jagadeesan	A Game Semantics for Generic Polymorphism.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Luca Cardelli, Philippa Gardner, Giorgio Ghelli	Manipulating Trees with Hidden Labels.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Nathalie Bertrand 0001, Philippe Schnoebelen	Model Checking Lossy Channels Systems Is Probably Decidable.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Patrick Maier 0001	Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Eugenio Moggi, Sonia Fagorzi	A Monadic Multi-stage Metalanguage.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	André Arnold, Luigi Santocanale	Ambiguous Classes in the Games µ-Calculus Hierarchy.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	James Laird	A Game Semantics of Linearly Used Continuations.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	John Power, Konstantinos Tourlas	Abstraction in Reasoning about Higraph-Based Systems.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Denis Lugiez	Counting and Equality Constraints for Multitree Automata.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Martin Berger 0001, Kohei Honda 0001, Nobuko Yoshida	Genericity and the pi-Calculus.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Michael Gordon Abbott, Thorsten Altenkirch, Neil Ghani	Categories of Containers.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Iovka Boneva, Jean-Marc Talbot	When Ambients Cannot Be Opened.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Jana Dunfield, Frank Pfenning	Type Assignment for Intersections and Unions in Call-by-Value Languages.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Eduardo Bonelli	A Normalisation Result for Higher-Order Calculi with Explicit Substitutions.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Andrew D. Gordon 0001 (eds.)	Foundations of Software Science and Computational Structures, 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Ernst-Erich Doberkat	The Converse of a Stochastic Relation.	FoSSaCS	2003	DBLP DOI BibTeX RDF	Stochastic relations, relational calculi, concurrency, converse, bisimulation, nondeterminism
1	Alberto Momigliano, Simon Ambler	Multi-level Meta-reasoning with Higher-Order Abstract Syntax.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Bruno Blanchet, Andreas Podelski	Verification of Cryptographic Protocols: Tagging Enforces Termination.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Matthew Hennessy, Massimo Merro, Julian Rathke	Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Vladimiro Sassone, Pawel Sobocinski 0001	Deriving Bisimulation Congruences: 2-Categories Vs Precategories.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Emanuel Kieronski	The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell 0001	An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion	Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Christoph Sprenger 0001, Mads Dam	On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Andreas Abel 0001, Ralph Matthes, Tarmo Uustalu	Generalized Iteration and Coiteration for Higher-Order Nested Datatypes.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Wan J. Fokkink, Jun Pang 0001	Cones and Foci for Protocol Verification Revisited.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Alexander Moshe Rabinovich	Verification of Probabilistic Systems with Faulty Communication.	FoSSaCS	2003	DBLP DOI BibTeX RDF
1	Somesh Jha, Jens Palsberg, Tian Zhao 0002	Efficient Type Matching.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Teodor Knapik, Damian Niwinski, Pawel Urzyczyn	Higher-Order Pushdown Trees Are Easy.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Jirí Srba	Note on the Tableau Technique for Commutative Transition Systems.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Bruno Courcelle	Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Christof Löding	Model-Checking Infinite Systems Generated by Ground Tree Rewriting.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Carsten Führmann	Varieties of Effects.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Olivier Danvy, Lasse R. Nielsen	A First-Order One-Pass CPS Transformation.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Gordon D. Plotkin, John Power	Notions of Computation Determine Monads.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Benedikt Bollig, Martin Leucker, Thomas Noll 0001	Generalised Regular MSC Languages.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Michele Boreale, Daniele Gorla	On Compositional Reasoning in the Spi-calculus.	FoSSaCS	2002	DBLP DOI BibTeX RDF	reasoning on security, process calculi, axiomatization
1	Alexander Kurz 0001	Logics Admitting Final Semantics.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Keye Martin	The Informatic Derivative at a Compact Element.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Michel Bidoit, Rolf Hennicker	On the Integration of Observability and Reachability Concepts.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Gian-Luigi Ferrari 0002, Ugo Montanari, Marco Pistore	Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Luigi Santocanale	A Calculus of Circular Proofs and Its Categorical Semantics.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Nobuko Yoshida, Kohei Honda 0001, Martin Berger 0001	Linearity and Bisimulation.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Ernst-Erich Doberkat	The Demonic Product of Probabilistic Relations.	FoSSaCS	2002	DBLP DOI BibTeX RDF	Probabilistic relations, demonic product, concurrency, bisimulation
1	Till Mossakowski	Heterogeneous Development Graphs and Heterogeneous Borrowing.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce	Conflict Detection and Resolution in Access Control Policy Specifications.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Martin Lange, Colin Stirling	Model Checking Fixed Point Logic with Chop.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Ulrich Schöpp, Alex K. Simpson	Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Erika Ábrahám-Mumm, Frank S. de Boer, Willem P. de Roever, Martin Steffen	Verification for Java's Reentrant Multithreading Concept.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Corina Cîrstea	On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Mogens Nielsen, Uffe Engberg (eds.)	Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Emmanuel Godard, Yves Métivier	A Characterization of Families of Graphs in Which Election Is Possible.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	François Laroussinie, Nicolas Markey, Philippe Schnoebelen	On Model Checking Durational Kripke Structures.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Markus Lohrey, Anca Muscholl	Bounded MSC Communication.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo	Proving Correctness of Timed Concurrent Constraint Programs.	FoSSaCS	2002	DBLP DOI BibTeX RDF	Concurrency, constraints, temporal logic, real-time programming
1	Hongseok Yang, Peter W. O'Hearn	A Semantic Basis for Local Reasoning.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Petr Jancar, Antonín Kucera 0001, Faron Moller, Zdenek Sawa	Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds.	FoSSaCS	2002	DBLP DOI BibTeX RDF
1	Thomas P. Jensen, Fausto Spoto	Class Analysis of Object-Oriented Programs through Abstract Interpretation.	FoSSaCS	2001	DBLP DOI BibTeX RDF	semantics, Abstract interpretation, object-oriented languages, domain theory, class analysis
1	Sava Krstic, John Launchbury, Dusko Pavlovic	Categories of Processes Enriched in Final Coalgebras.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Valerie King, Orna Kupferman, Moshe Y. Vardi	On the Complexity of Parity Word Automata.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Martín Abadi, Bruno Blanchet	Secrecy Types for Asymmetric Communication.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Annegret Habel, Detlef Plump	Computational Completeness of Programming Languages Based on Graph Transformation.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Mario Coppo	Type Inference with Recursive Type Equations.	FoSSaCS	2001	DBLP DOI BibTeX RDF	type assignment, Recursive types
1	Simone Tini	An Axiomatic Semantics for the Synchronous Language Gentzen.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Horatiu Cirstea, Claude Kirchner, Luigi Liquori	The Rho Cube.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Rémi Morin	On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Gilles Barthe, Olivier Pons	Type Isomorphisms and Proof Reuse in Dependent Type Theory.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Christine Röckl, Daniel Hirschkoff, Stefan Berghofer	Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Furio Honsell, Marino Miculan (eds.)	Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Masahito Hasegawa, Yoshihiko Kakutani	Axioms for Recursion in Call-by-Value.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Michel Bidoit, Rolf Hennicker, Alexander Kurz 0001	On the Duality between Observability and Reachability.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir	Axiomatizing Tropical Semirings.	FoSSaCS	2001	DBLP DOI BibTeX RDF	relative axiomatizations, commutative idempotent weak semirings, tropical semirings, exponential time complexity, convexity, varieties, Equational logic, complete axiomatizations
1	Tobias Nipkow	Verified Bytecode Verifiers.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	François Laroussinie, Nicolas Markey, Philippe Schnoebelen	Model Checking CTL+ and FCTL is Hard.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon 0001, Supratik Mukhopadhyay, Jean-Marc Talbot	The Complexity of Model Checking Mobile Ambients.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Valérie Gouranton, Pierre Réty, Helmut Seidl	Synchronized Tree Languages Revisited and New Applications.	FoSSaCS	2001	DBLP DOI BibTeX RDF	tree-tuple language, concurrency, rewriting
1	Mikolaj Bojanczyk	The Finite Graph Problem for Two-Way Alternating Automata.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Colin Stirling	Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Dominique Ambroise, Patrick Augé, Kamel Bouchefra, Brigitte Rozoy	MARRELLA and the Verification of an Embedded System.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Irène Durand, Aart Middeldorp	On the Modularity of Deciding Call-by-Need.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro	Temporary Data in Shared Dataspace Coordination Languages.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Cristiano Calcagno, Peter W. O'Hearn	On Garbage and Program Logic.	FoSSaCS	2001	DBLP DOI BibTeX RDF
1	Maria Grazia Buscemi, Vladimiro Sassone	High-Level Petri Nets as Type Theories in the Join Calculus.	FoSSaCS	2001	DBLP DOI BibTeX RDF

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