Difference between revisions of "FOSSACS 2002"
Jump to navigation
Jump to search
Tim Holzheim (talk | contribs) (Added page provenance(#264) and contribution type(#271)) |
|||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
{{Event | {{Event | ||
|Acronym=FOSSACS 2002 | |Acronym=FOSSACS 2002 | ||
| − | |Title=International Conference on Foundations of Software Science and Computation | + | |Title=International Conference on Foundations of Software Science and Computation Structure |
|Ordinal=5 | |Ordinal=5 | ||
|Series=FOSSACS | |Series=FOSSACS | ||
| Line 22: | Line 22: | ||
|has Proceedings DOI=https://doi.org/10.1007/3-540-45931-6 | |has Proceedings DOI=https://doi.org/10.1007/3-540-45931-6 | ||
|has Proceedings Bibliography=https://link.springer.com/book/10.1007%2F3-540-45931-6 | |has Proceedings Bibliography=https://link.springer.com/book/10.1007%2F3-540-45931-6 | ||
| + | |pageCreator=Tolga.karaarslan | ||
| + | |pageEditor=Tolga.karaarslan | ||
| + | |contributionType=1 | ||
}} | }} | ||
| − | The 5. International Conference on Foundations of Software Science and Computation (FOSSACS) 2002 | + | The 5. International Conference on Foundations of Software Science and Computation Structure (FOSSACS) 2002 |
Latest revision as of 20:24, 1 April 2022
| FOSSACS 2002 | |
|---|---|
International Conference on Foundations of Software Science and Computation Structure
| |
| Ordinal | 5 |
| Event in series | FOSSACS |
| Subevent of | ETAPS 2002 |
| Dates | 2002/04/08 (iCal) - 2002/04/12 |
| Presence | presence |
| Homepage: | https://www.brics.dk/fossacs02/ |
| Location | |
| Location: | Grenoble, France |
| Papers: | Submitted 67 / Accepted 29 (43.3 %) |
| Committees | |
| General chairs: | Mogens Nielsen |
| PC chairs: | Mogens Nielsen, Uffe Engberg |
| Keynote speaker: | Bruno Courcelle |
| Table of Contents | |
The 5. International Conference on Foundations of Software Science and Computation Structure (FOSSACS) 2002
Topics
- Computation processes over discrete and continuous data, methods and techniques for their manipulation, and analysis of their algorithmic properties.
- Type theory, domain theory, category theory.
- Models of concurrency, and corresponding calculi, algebras, and logics.
- Techniques for proving properties of protocols.
- Formal descriptions of general frames for the integration of specification techniques.