Proceedings of the Second International Conference on Foundations of Software Science and Computation Structures
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Wolfgang Thomas
Proceedings of the Second International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 1999.

TCS
DBLP
Scholar
Full names Links ISxN
@proceedings{FoSSaCS-1999,
	address       = "Amsterdam, The Netherlands",
	editor        = "Wolfgang Thomas",
	isbn          = "3-540-65719-3",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Second International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 1578,
	year          = 1999,
}

Contents (21 items)

FoSSaCS-1999-Abadi #protocol #security #specification
Security Protocols and Specifications (MA), pp. 1–13.
FoSSaCS-1999-EsparzaK #analysis #approach #data flow #interprocedural
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis (JE, JK), pp. 14–30.
FoSSaCS-1999-Sangiorgi #concurrent #reasoning #using
Reasoning About Concurrent Systems Using Types (DS), pp. 31–40.
FoSSaCS-1999-AcetoI #logic #recursion #testing
Testing Hennessy-Milner Logic with Recursion (LA, AI), pp. 41–55.
FoSSaCS-1999-ArruabarrenaLN #embedded #logic programming
A Strong Logic Programming View for Static Embedded Implications (RA, PL, MN), pp. 56–72.
FoSSaCS-1999-BaldranCM #graph grammar #semantics
Unfolding and Event Structure Semantics for Graph Grammars (PB, AC, UM), pp. 73–89.
FoSSaCS-1999-Barthe
Expanding the Cube (GB), pp. 90–103.
FoSSaCS-1999-Benke #algebra #ml #type system
An Algebraic Characterization of Typability in ML with Subtyping (MB), pp. 104–119.
FoSSaCS-1999-BodeiDNN #process #static analysis
Static Analysis of Processes for No and Read-Up and No Write-Down (CB, PD, FN, HRN), pp. 120–134.
FoSSaCS-1999-Boer #calculus #object-oriented
A WP-calculus for OO (FSdB), pp. 135–149.
FoSSaCS-1999-BogaertST #automaton #problem
The Recognizability Problem for Tree Automata with Comparisons between Brothers (BB, FS, ST), pp. 150–164.
FoSSaCS-1999-BorealeNP #formal method #testing
A Theory of “May” Testing for Asynchronous Languages (MB, RDN, RP), pp. 165–179.
FoSSaCS-1999-DantsinV #algorithm #nondeterminism #polynomial #set #unification
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees (ED, AV), pp. 180–196.
FoSSaCS-1999-GhaniPR #category theory #modelling
Categorical Models of Explicit Substitutions (NG, VdP, ER), pp. 197–211.
FoSSaCS-1999-GordonC #equation #mobile
Equational Properties of Mobile Ambients (ADG, LC), pp. 212–226.
FoSSaCS-1999-HuhnNW #communication #logic #model checking
Model Checking Logics for Communicating Sequential Agents (MH, PN, FW), pp. 227–242.
FoSSaCS-1999-Lenisa #bisimulation #equivalence #induction #logic
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects (ML), pp. 243–257.
FoSSaCS-1999-Maneth #metaprogramming #string #transducer
String Languages Generated by Total Deterministic Macro Tree Transducers (SM), pp. 258–272.
FoSSaCS-1999-Muscholl #sequence chart #specification
Matching Specifications for Message Sequence Charts (AM), pp. 273–287.
FoSSaCS-1999-NarasimhaCI #calculus #logic #probability #μ-calculus
Probabilistic Temporal Logics via the Modal μ-Calculus (MN, RC, SPI), pp. 288–305.
FoSSaCS-1999-RocklS #algol #concurrent #process #semantics #π-calculus
A π-calculus Process Semantics of Concurrent Idealised ALGOL (CR, DS), pp. 306–321.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.