Helmut Seidl
Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 2007.

@proceedings{FoSSaCS-2007,
	address       = "Braga, Portugal",
	doi           = "10.1007/978-3-540-71389-0",
	editor        = "Helmut Seidl",
	isbn          = "978-3-540-71388-3",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 4423,
	year          = 2007,
}

Contents (26 items)

5 ×#logic
4 ×#automaton
3 ×#complexity
3 ×#probability
2 ×#analysis
2 ×#bound
2 ×#calculus
2 ×#constraints
2 ×#formal method
2 ×#game studies

FoSSaCS-2007-Jagadeesan #aspect-oriented #formal method

Formal Foundations for Aspects (RJ), p. 1.

FoSSaCS-2007-AbdullaKY #automaton

Sampled Universality of Timed Automata (PAA, PK, WY), pp. 2–16.

FoSSaCS-2007-AlvesFFM

Iterator Types (SA, MF, MF, IM), pp. 17–31.

FoSSaCS-2007-BartolettiDFZ #analysis #resource management

Types and Effects for Resource Usage Analysis (MB, PD, GLF, RZ), pp. 32–47.

FoSSaCS-2007-BaulandSSSV #complexity #linear #logic #satisfiability

The Complexity of Generalized Satisfiability for Linear Temporal Logic (MB, TS, HS, IS, HV), pp. 48–62.

FoSSaCS-2007-BengtsonP #formal method #logic #using #π-calculus

Formalising the π-Calculus Using Nominal Logic (JB, JP), pp. 63–77.

FoSSaCS-2007-BertolissiK #calculus #combinator #reduction

The Rewriting Calculus as a Combinatory Reduction System (CB, CK), pp. 78–92.

FoSSaCS-2007-BirkedalY #logic #parametricity #relational

Relational Parametricity and Separation Logic (LB, HY), pp. 93–107.

FoSSaCS-2007-BouyerLM #automaton #model checking

Model-Checking One-Clock Priced Timed Automata (PB, KGL, NM), pp. 108–122.

FoSSaCS-2007-BreugelSW #approximate #behaviour #probability #pseudo

Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems (FvB, BS, JW), pp. 123–137.

FoSSaCS-2007-Chatterjee #game studies #probability #synthesis

Optimal Strategy Synthesis in Stochastic Müller Games (KC), pp. 138–152.

FoSSaCS-2007-ChatterjeeHP #game studies

Generalized Parity Games (KC, TAH, NP), pp. 153–167.

FoSSaCS-2007-Comon-LundhJP #automaton #constraints #memory management

Tree Automata with Memory, Visibility and Structural Constraints (HCL, FJ, NP), pp. 168–182.

FoSSaCS-2007-FerranteM #calculus #μ-calculus

Enriched μ-Calculi Module Checking (AF, AM), pp. 183–197.

FoSSaCS-2007-GollerLL

PDL with Intersection and Converse Is 2 EXP-Complete (SG, ML, CL), pp. 198–212.

FoSSaCS-2007-HagueO #analysis #automaton #higher-order

Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems (MH, CHLO), pp. 213–227.

FoSSaCS-2007-HirschkoffP #congruence #π-calculus

A Distribution Law for CCS and a New Congruence Result for the π-Calculus (DH, DP), pp. 228–242.

FoSSaCS-2007-LaroussinieMO #atl #complexity #on the

On the Expressiveness and Complexity of ATL (FL, NM, GO), pp. 243–257.

FoSSaCS-2007-MarnetteKR #bound #constraints #polynomial #set

Polynomial Constraints for Sets with Cardinality Bounds (BM, VK, MCR), pp. 258–273.

FoSSaCS-2007-MuschollW #bound #composition #web #web service

A Lower Bound on Web Services Composition (AM, IW), pp. 274–286.

FoSSaCS-2007-ParmaS #bisimulation #logic #probability

Logical Characterizations of Bisimulations for Discrete Probabilistic Systems (AP, RS), pp. 287–301.

FoSSaCS-2007-RathkeSS #semantics

Semantic Barbs and Biorthogonality (JR, VS, PS), pp. 302–316.

FoSSaCS-2007-Riba #on the

On the Stability by Union of Reducibility Candidates (CR), pp. 317–331.

FoSSaCS-2007-Rosu #algorithm #effectiveness #problem #regular expression

An Effective Algorithm for the Membership Problem for Extended Regular Expressions (GR), pp. 332–345.

FoSSaCS-2007-TozawaM #complexity #context-free grammar

Complexity Results on Balanced Context-Free Languages (AT, YM), pp. 346–360.

FoSSaCS-2007-YoshidaHB #higher-order #logic #reasoning

Logical Reasoning for Higher-Order Functions with Local State (NY, KH, MB), pp. 361–377.