TACS

Keyphrases

Publications

2001

Mizuhito Ogawa
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders. TACS (2001)
Makoto Hamana
A Logic Programming Language Based on Binding Algebras. TACS (2001)
Andrei Serjantov, Peter Sewell, Keith Wansbrough
The UDP Calculus: Rigorous Semantics for Real Networking. TACS (2001)
Martin Fränzle
What Will Be Eventually True of Polynomial Hybrid Automata? TACS (2001)
Andrew M. Pitts
Nominal Logic: A First Order Theory of Names and Binding. TACS (2001)
Lennart Beringer
Typing Assembly Programs with Explicit Forwarding. TACS (2001)
Marcello M. Bonsangue, Joost N. Kok
Infinite Intersection and Union Types for the Lazy Lambda Calculus. TACS (2001)
Javier Esparza, Antonín Kucera, Stefan Schwoon
Model-Checking LTL with Regular Valuations for Pushdown Systems. TACS (2001)
Yoriyuki Yamagata
Strong Normalization of Second Order Symmetric Lambda-mu Calculus. TACS (2001)
Hiroshi Nakano
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness. TACS (2001)
Benjamin C. Pierce, Jerome Vouillon
Unison: A File Synchronizer and Its Specification. TACS (2001)
Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
Boxed Ambients. TACS (2001)
Joachim Niehren, Tim Priesnitz
Non-structural Subtype Entailment in Automata Theory. TACS (2001)
Philippe Schnoebelen
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. TACS (2001)
Didier Galmiche, Daniel Méry
Proof-Search and Countermodel Generation in Propositional BI Logic. TACS (2001)
Daisuke Hoshina, Eijiro Sumii, Akinori Yonezawa
A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation. TACS (2001)
Luís Caires, Luca Cardelli
A Spatial Logic for Concurrency. TACS (2001)
Cosimo Laneve, Joachim Parrow, Björn Victor
Solo Diagrams. TACS (2001)
Antti Puhakka
Weakest Congruence Results Concerning "Any-Lock". TACS (2001)
Daniel Leivant
Termination Proofs and Complexity Certification. TACS (2001)
Daniel Jackson, Alan D. Fekete
Lightweight Analysis of Object Interactions. TACS (2001)
Martín Abadi, Jan Jürjens
Formal Eavesdropping and Its Computational Interpretation. TACS (2001)
Barbara König, Ugo Montanari
Observational Equivalence for Synchronized Graph Rewriting with Mobility. TACS (2001)
Keye Martin
A Renee Equation for Algorithmic Complexity. TACS (2001)
Kazunori Ueda
Resource-Passing Concurrent Programming. TACS (2001)
Christine Paulin-Mohring
Modelisation of Timed Automata in Coq. TACS (2001)
Philip Wadler
The Girard-Reynolds Isomorphism. TACS (2001)
Anindya Banerjee, Nevin Heintze, Jon G. Riecke
Design and Correctness of Program Transformations Based on Control-Flow Analysis. TACS (2001)

volume 2215, 2001

Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings TACS 2215 (2001)

1997

volume 1281, 1997

Theoretical Aspects of Computer Software, Third International Symposium, TACS '97, Sendai, Japan, September 23-26, 1997, Proceedings TACS 1281 (1997)