• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 30 matches

• 2006
• 
  Martín Abadi, Mathieu Baudet, Bogdan Warinschi:
  Guessing Attacks and the Computational Soundness of Static Equivalence. FoSSaCS 2006: 398-412
• 
  Michael Backes, Sebastian Mödersheim, Birgit Pfitzmann, Luca Viganò:
  Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario. FoSSaCS 2006: 428-445
• 
  Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Pawel Sobocinski:
  Processes for Adhesive Rewriting Systems. FoSSaCS 2006: 202-216
• 
  Paolo Baldan, Stefan Haar, Barbara König:
  Distributed Unfolding of Petri Nets. FoSSaCS 2006: 126-141
• 
  Lars Birkedal, Søren Debois, Ebbe Elsborg, Thomas T. Hildebrandt, Henning Niss:
  Bigraphical Models of Context-Aware Systems. FoSSaCS 2006: 187-201
• 
  Frédéric Blanqui, Claude Kirchner, Colin Riba:
  On the Confluence of lambda-Calculus with Conditional Rewriting. FoSSaCS 2006: 382-397
• 
  Marcello M. Bonsangue, Alexander Kurz:
  Presenting Functors by Operations and Equations. FoSSaCS 2006: 172-186
• 
  Zining Cao:
  More on Bisimulations for Higher Order pi-Calculus. FoSSaCS 2006: 63-78
• 
  Taolue Chen, Wan J. Fokkink, Sumit Nain:
  On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation. FoSSaCS 2006: 1-15
• 
  Abbas Edalat, Dirk Pattinson:
  Denotational Semantics of Hybrid Automata. FoSSaCS 2006: 231-245
• 
  Adrian Francalanza, Matthew Hennessy:
  A Theory for Observational Fault Tolerance. FoSSaCS 2006: 16-31
• 
  Daniele Gorla:
  On the Relative Expressive Power of Asynchronous Communication Primitives. FoSSaCS 2006: 47-62
• 
  Petr Jancar, Jirí Srba:
  Undecidability Results for Bisimilarity on Prefix Rewrite Systems. FoSSaCS 2006: 277-291
• 
  Dietrich Kuske, Markus Lohrey:
  First-Order and Counting Theories of omega-Automatic Structures. FoSSaCS 2006: 322-336
• 
  James Laird:
  Bidomains and Full Abstraction for Countable Nondeterminism. FoSSaCS 2006: 352-366
• 
  Cosimo Laneve, Luca Padovani:
  Smooth Orchestrators. FoSSaCS 2006: 32-46
• 
  Christof Löding, Olivier Serre:
  Propositional Dynamic Logic with Recursive Programs. FoSSaCS 2006: 292-306
• 
  Gerald Lüttgen, Walter Vogler:
  Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics. FoSSaCS 2006: 261-276
• 
  Joël Ouaknine, James Worrell:
  On Metric Temporal Logic and Faulty Turing Machines. FoSSaCS 2006: 217-230
• 
  Luca Paolini, Elaine Pimentel, Simona Ronchi Della Rocca:
  An Operational Characterization of Strong Normalization. FoSSaCS 2006: 367-381
• 
  Fernando Magno Quintão Pereira, Jens Palsberg:
  Register Allocation After Classical SSA Elimination is NP-Complete. FoSSaCS 2006: 79-93
• 
  Iain C. C. Phillips, Irek Ulidowski:
  Reversing Algebraic Process Calculi. FoSSaCS 2006: 246-260
• 
  Corin Pitcher, James Riely:
  Dynamic Policy Discovery with Remote Attestation. FoSSaCS 2006: 111-125
• 
  Andrei Popescu, Traian Serbanuta, Grigore Rosu:
  A Semantic Approach to Interpolation. FoSSaCS 2006: 307-321
• 
  Philipp Rohde:
  On the µ-Calculus Augmented with Sabotage. FoSSaCS 2006: 142-156
• 
  Lutz Schröder:
  A Finite Model Construction for Coalgebraic Modal Logic. FoSSaCS 2006: 157-171
• 
  Olivier Serre:
  Parity Games Played on Transition Graphs of One-Counter Processes. FoSSaCS 2006: 337-351
• 
  Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani:
  A Logic of Reachable Patterns in Linked Data-Structures. FoSSaCS 2006: 94-110
• 
  Roberto Zunino, Pierpaolo Degano:
  Handling exp, × (and Timestamps) in Protocol Analysis. FoSSaCS 2006: 413-427
• 
  Luca Aceto, Anna Ingólfsdóttir:
  Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25-31, 2006, Proceedings. Lecture Notes in Computer Science 3921, Springer 2006, ISBN 3-540-33045-3 [contents]