Luca Aceto, Anna Ingólfsdóttir
Proceedings of the Ninth International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 2006.
@proceedings{FoSSaCS-2006, address = "Vienna, Austria", doi = "10.1007/11690634", editor = "Luca Aceto and Anna Ingólfsdóttir", isbn = "3-540-33045-3", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the Ninth International Conference on Foundations of Software Science and Computation Structures}", volume = 3921, year = 2006, }
Contents (29 items)
- FoSSaCS-2006-ChenFN #finite #infinity #on the #simulation
- On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation (TC, WF, SN), pp. 1–15.
- FoSSaCS-2006-FrancalanzaH #fault tolerance
- A Theory for Observational Fault Tolerance (AF, MH), pp. 16–31.
- FoSSaCS-2006-LaneveP
- Smooth Orchestrators (CL, LP), pp. 32–46.
- FoSSaCS-2006-Gorla #communication #on the #power of
- On the Relative Expressive Power of Asynchronous Communication Primitives (DG), pp. 47–62.
- FoSSaCS-2006-Cao #bisimulation #higher-order #π-calculus
- More on Bisimulations for Higher Order π-Calculus (ZC), pp. 63–78.
- FoSSaCS-2006-PereiraP
- Register Allocation After Classical SSA Elimination is NP-Complete (FMQP, JP), pp. 79–93.
- FoSSaCS-2006-YorshRSMB #linked data #logic #open data
- A Logic of Reachable Patterns in Linked Data-Structures (GY, AMR, MS, AM, AB), pp. 94–110.
- FoSSaCS-2006-PitcherR #policy
- Dynamic Policy Discovery with Remote Attestation (CP, JR), pp. 111–125.
- FoSSaCS-2006-BaldanHK #distributed #petri net
- Distributed Unfolding of Petri Nets (PB, SH, BK), pp. 126–141.
- FoSSaCS-2006-Rohde #calculus #on the #μ-calculus
- On the μ-Calculus Augmented with Sabotage (PR), pp. 142–156.
- FoSSaCS-2006-Schroder #algebra #finite #logic
- A Finite Model Construction for Coalgebraic Modal Logic (LS), pp. 157–171.
- FoSSaCS-2006-BonsangueK #equation
- Presenting Functors by Operations and Equations (MMB, AK), pp. 172–186.
- FoSSaCS-2006-BirkedalDEHN #modelling
- Bigraphical Models of Context-Aware Systems (LB, SD, EE, TTH, HN), pp. 187–201.
- FoSSaCS-2006-BaldanCHKS #process #term rewriting
- Processes for Adhesive Rewriting Systems (PB, AC, TH, BK, PS), pp. 202–216.
- FoSSaCS-2006-OuaknineW #logic #metric #on the #turing machine
- On Metric Temporal Logic and Faulty Turing Machines (JO, JW), pp. 217–230.
- FoSSaCS-2006-EdalatP #automaton #hybrid #semantics
- Denotational Semantics of Hybrid Automata (AE, DP), pp. 231–245.
- FoSSaCS-2006-PhillipsU #algebra #calculus #process
- Reversing Algebraic Process Calculi (ICCP, IU), pp. 246–260.
- FoSSaCS-2006-LuttgenV #process #semantics
- Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics (GL, WV), pp. 261–276.
- FoSSaCS-2006-JancarS #similarity #term rewriting
- Undecidability Results for Bisimilarity on Prefix Rewrite Systems (PJ, JS), pp. 277–291.
- FoSSaCS-2006-LodingS #logic #recursion #source code
- Propositional Dynamic Logic with Recursive Programs (CL, OS), pp. 292–306.
- FoSSaCS-2006-PopescuSR #approach #semantics
- A Semantic Approach to Interpolation (AP, TS, GR), pp. 307–321.
- FoSSaCS-2006-KuskeL #first-order
- First-Order and Counting Theories of ω-Automatic Structures (DK, ML), pp. 322–336.
- FoSSaCS-2006-Serre #game studies #graph #process
- Parity Games Played on Transition Graphs of One-Counter Processes (OS), pp. 337–351.
- FoSSaCS-2006-Laird #abstraction #nondeterminism
- Bidomains and Full Abstraction for Countable Nondeterminism (JL), pp. 352–366.
- FoSSaCS-2006-PaoliniPR #normalisation
- An Operational Characterization of Strong Normalization (LP, EP, SRDR), pp. 367–381.
- FoSSaCS-2006-BlanquiKR #confluence #on the #λ-calculus
- On the Confluence of λ-Calculus with Conditional Rewriting (FB, CK, CR), pp. 382–397.
- FoSSaCS-2006-AbadiBW #equivalence
- Guessing Attacks and the Computational Soundness of Static Equivalence (MA, MB, BW), pp. 398–412.
- FoSSaCS-2006-ZuninoD #analysis #protocol
- Handling exp, × (and Timestamps) in Protocol Analysis (RZ, PD), pp. 413–427.
- FoSSaCS-2006-BackesMPV #analysis #encryption
- Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario (MB, SM, BP, LV), pp. 428–445.
5 ×#on the
4 ×#logic
4 ×#process
3 ×#semantics
2 ×#algebra
2 ×#analysis
2 ×#calculus
2 ×#finite
2 ×#term rewriting
4 ×#logic
4 ×#process
3 ×#semantics
2 ×#algebra
2 ×#analysis
2 ×#calculus
2 ×#finite
2 ×#term rewriting