Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. TACS 2001: Sendai, Japan
- Naoki Kobayashi, Benjamin C. Pierce:
Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings. Lecture Notes in Computer Science 2215, Springer 2001, ISBN 3-540-42736-8
Invited Talk 1
- Luís Caires, Luca Cardelli:
A Spatial Logic for Concurrency. 1-37
Session 1
- Michele Bugliesi, Giuseppe Castagna, Silvia Crafa:
Boxed Ambients. 38-63 - Daisuke Hoshina, Eijiro Sumii, Akinori Yonezawa:
A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation. 64-81 - Martín Abadi, Jan Jürjens:
Formal Eavesdropping and Its Computational Interpretation. 82-94
Invited Talk 2
- Kazunori Ueda:
Resource-Passing Concurrent Programming. 95-126
Session 2
- Cosimo Laneve
, Joachim Parrow, Björn Victor:
Solo Diagrams. 127-144 - Barbara König, Ugo Montanari:
Observational Equivalence for Synchronized Graph Rewriting with Mobility. 145-164
Session 3
- Hiroshi Nakano:
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness. 165-182 - Daniel Leivant:
Termination Proofs and Complexity Certification. 183-200 - Keye Martin:
A Renee Equation for Algorithmic Complexity. 201-218
Invited Talk 3
- Andrew M. Pitts:
Nominal Logic: A First Order Theory of Names and Binding. 219-242
Session 4
- Makoto Hamana:
A Logic Programming Language Based on Binding Algebras. 243-262 - Didier Galmiche, Daniel Méry:
Proof-Search and Countermodel Generation in Propositional BI Logic. 263-282 - Mizuhito Ogawa:
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders. 283-297
Invited Talk 4
- Christine Paulin-Mohring:
Modelisation of Timed Automata in Coq. 298-315
Session 5
- Javier Esparza, Antonín Kucera, Stefan Schwoon:
Model-Checking LTL with Regular Valuations for Pushdown Systems. 316-339 - Martin Fränzle:
What Will Be Eventually True of Polynomial Hybrid Automata? 340-359 - Joachim Niehren, Tim Priesnitz:
Non-structural Subtype Entailment in Automata Theory. 360-384
Session 6
- Philippe Schnoebelen:
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. 385-399 - Antti Puhakka:
Weakest Congruence Results Concerning "Any-Lock". 400-419
Invited Talk 5
- Anindya Banerjee, Nevin Heintze, Jon G. Riecke:
Design and Correctness of Program Transformations Based on Control-Flow Analysis. 420-447
Session 7
- Marcello M. Bonsangue, Joost N. Kok:
Infinite Intersection and Union Types for the Lazy Lambda Calculus. 448-458 - Yoriyuki Yamagata:
Strong Normalization of Second Order Symmetric Lambda-mu Calculus. 459-467 - Philip Wadler:
The Girard-Reynolds Isomorphism. 468-491
Invited Talk 6
- Daniel Jackson, Alan D. Fekete:
Lightweight Analysis of Object Interactions. 492-513
Session 8
- Lennart Beringer:
Typing Assembly Programs with Explicit Forwarding. 514-534 - Andrei Serjantov, Peter Sewell, Keith Wansbrough:
The UDP Calculus: Rigorous Semantics for Real Networking. 535-559
TACS Open Lecture
- Benjamin C. Pierce, Jerome Vouillon:
Unison: A File Synchronizer and Its Specification. 560
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-17 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
