Conferences in DBLP

Theoretical Aspects of Computer Software (TACS) (tacs)
2001 (conf/tacs/2001)

1. Luís Caires, Luca Cardelli
   A Spatial Logic for Concurrency. [Citation Graph (0, 0)][DBLP]
   TACS, 2001, pp:1-37 [Conf]
   
2. Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
   Boxed Ambients. [Citation Graph (0, 0)][DBLP]
   TACS, 2001, pp:38-63 [Conf]
   
3. Daisuke Hoshina, Eijiro Sumii, Akinori Yonezawa
   A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation. [Citation Graph (0, 0)][DBLP]
   TACS, 2001, pp:64-81 [Conf]
   
4. Martín Abadi, Jan Jürjens
   Formal Eavesdropping and Its Computational Interpretation. [Citation Graph (0, 0)][DBLP]
   TACS, 2001, pp:82-94 [Conf]
   
5. Kazunori Ueda
   Resource-Passing Concurrent Programming. [Citation Graph (0, 0)][DBLP]
   TACS, 2001, pp:95-126 [Conf]
   
6. Cosimo Laneve, Joachim Parrow, Björn Victor
   Solo Diagrams. [Citation Graph (0, 0)][DBLP]
   TACS, 2001, pp:127-144 [Conf]
   
7. Barbara König, Ugo Montanari
   Observational Equivalence for Synchronized Graph Rewriting with Mobility. [Citation Graph (0, 0)][DBLP]
   TACS, 2001, pp:145-164 [Conf]
   
8. Hiroshi Nakano
   Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness. [Citation Graph (0, 0)][DBLP]
   TACS, 2001, pp:165-182 [Conf]
   
9. Daniel Leivant
   Termination Proofs and Complexity Certification. [Citation Graph (0, 0)][DBLP]
   TACS, 2001, pp:183-200 [Conf]
   
10. Keye Martin
    A Renee Equation for Algorithmic Complexity. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:201-218 [Conf]
    
11. Andrew M. Pitts
    Nominal Logic: A First Order Theory of Names and Binding. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:219-242 [Conf]
    
12. Makoto Hamana
    A Logic Programming Language Based on Binding Algebras. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:243-262 [Conf]
    
13. Didier Galmiche, Daniel Méry
    Proof-Search and Countermodel Generation in Propositional BI Logic. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:263-282 [Conf]
    
14. Mizuhito Ogawa
    Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:283-297 [Conf]
    
15. Christine Paulin-Mohring
    Modelisation of Timed Automata in Coq. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:298-315 [Conf]
    
16. Javier Esparza, Antonín Kucera, Stefan Schwoon
    Model-Checking LTL with Regular Valuations for Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:316-339 [Conf]
    
17. Martin Fränzle
    What Will Be Eventually True of Polynomial Hybrid Automata? [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:340-359 [Conf]
    
18. Joachim Niehren, Tim Priesnitz
    Non-structural Subtype Entailment in Automata Theory. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:360-384 [Conf]
    
19. Ph. Schnoebelen
    Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:385-399 [Conf]
    
20. Antti Puhakka
    Weakest Congruence Results Concerning "Any-Lock". [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:400-419 [Conf]
    
21. Anindya Banerjee, Nevin Heintze, Jon G. Riecke
    Design and Correctness of Program Transformations Based on Control-Flow Analysis. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:420-447 [Conf]
    
22. Marcello M. Bonsangue, Joost N. Kok
    Infinite Intersection and Union Types for the Lazy Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:448-458 [Conf]
    
23. Yoriyuki Yamagata
    Strong Normalization of Second Order Symmetric Lambda-mu Calculus. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:459-467 [Conf]
    
24. Philip Wadler
    The Girard-Reynolds Isomorphism. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:468-491 [Conf]
    
25. Daniel Jackson, Alan Fekete
    Lightweight Analysis of Object Interactions. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:492-513 [Conf]
    
26. Lennart Beringer
    Typing Assembly Programs with Explicit Forwarding. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:514-534 [Conf]
    
27. Andrei Serjantov, Peter Sewell, Keith Wansbrough
    The UDP Calculus: Rigorous Semantics for Real Networking. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:535-559 [Conf]
    
28. Benjamin C. Pierce, Jerome Vouillon
    Unison: A File Synchronizer and Its Specification. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:560- [Conf]