FoSSaCS B

30 papers

YearTitle / Authors
2006A Finite Model Construction for Coalgebraic Modal Logic.
Lutz Schröder
2006A Logic of Reachable Patterns in Linked Data-Structures.
Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani
2006A Semantic Approach to Interpolation.
Andrei Popescu, Traian Serbanuta, Grigore Rosu
2006A Theory for Observational Fault Tolerance.
Adrian Francalanza, Matthew Hennessy
2006An Operational Characterization of Strong Normalization.
Luca Paolini, Elaine Pimentel, Simona Ronchi Della Rocca
2006Bidomains and Full Abstraction for Countable Nondeterminism.
James Laird
2006Bigraphical Models of Context-Aware Systems.
Lars Birkedal, Søren Debois, Ebbe Elsborg, Thomas T. Hildebrandt, Henning Niss
2006Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics.
Gerald Lüttgen, Walter Vogler
2006Denotational Semantics of Hybrid Automata.
Abbas Edalat, Dirk Pattinson
2006Distributed Unfolding of Petri Nets.
Paolo Baldan, Stefan Haar, Barbara König
2006Dynamic Policy Discovery with Remote Attestation.
Corin Pitcher, James Riely
2006First-Order and Counting Theories of
Dietrich Kuske, Markus Lohrey
2006Foundations 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
Luca Aceto, Anna Ingólfsdóttir
2006Guessing Attacks and the Computational Soundness of Static Equivalence.
Martín Abadi, Mathieu Baudet, Bogdan Warinschi
2006Handling exp, × (and Timestamps) in Protocol Analysis.
Roberto Zunino, Pierpaolo Degano
2006More on Bisimulations for Higher Order
Zining Cao
2006On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation.
Taolue Chen, Wan J. Fokkink, Sumit Nain
2006On Metric Temporal Logic and Faulty Turing Machines.
Joël Ouaknine, James Worrell
2006On the
Philipp Rohde
2006On the Confluence of
Frédéric Blanqui, Claude Kirchner, Colin Riba
2006On the Relative Expressive Power of Asynchronous Communication Primitives.
Daniele Gorla
2006Parity Games Played on Transition Graphs of One-Counter Processes.
Olivier Serre
2006Presenting Functors by Operations and Equations.
Marcello M. Bonsangue, Alexander Kurz
2006Processes for Adhesive Rewriting Systems.
Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Pawel Sobocinski
2006Propositional Dynamic Logic with Recursive Programs.
Christof Löding, Olivier Serre
2006Register Allocation After Classical SSA Elimination is NP-Complete.
Fernando Magno Quintão Pereira, Jens Palsberg
2006Reversing Algebraic Process Calculi.
Iain Phillips, Irek Ulidowski
2006Smooth Orchestrators.
Cosimo Laneve, Luca Padovani
2006Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario.
Michael Backes, Sebastian Mödersheim, Birgit Pfitzmann, Luca Viganò
2006Undecidability Results for Bisimilarity on Prefix Rewrite Systems.
Petr Jancar, Jirí Srba