The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tachio Terauchi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tachio Terauchi, Alex Aiken
    A Capability Calculus for Concurrency and Determinism. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:218-232 [Conf]
  2. Tachio Terauchi, Alexander Aiken
    Witnessing side-effects. [Citation Graph (0, 0)][DBLP]
    ICFP, 2005, pp:105-115 [Conf]
  3. Tachio Terauchi, Alex Aiken
    On Typability for Rank-2 Intersection Types with Polymorphic Recursion. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:111-122 [Conf]
  4. Alexander Aiken, Jeffrey S. Foster, John Kodumal, Tachio Terauchi
    Checking and inferring local non-aliasing. [Citation Graph (0, 0)][DBLP]
    PLDI, 2003, pp:129-140 [Conf]
  5. Jeffrey S. Foster, Tachio Terauchi, Alexander Aiken
    Flow-Sensitive Type Qualifiers. [Citation Graph (0, 0)][DBLP]
    PLDI, 2002, pp:1-12 [Conf]
  6. Tachio Terauchi, Alexander Aiken
    Secure Information Flow as a Safety Problem. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:352-367 [Conf]
  7. Tobias Höllerer, Steven Feiner, Tachio Terauchi, Gus Rashid, Drexel Hallaway
    Exploring MARS: developing indoor and outdoor user interfaces to a mobile augmented reality system. [Citation Graph (0, 0)][DBLP]
    Computers & Graphics, 1999, v:23, n:6, pp:779-785 [Journal]

  8. A Type System for Observational Determinism. [Citation Graph (, )][DBLP]


  9. Quantitative Information Flow - Verification Hardness and Possibilities. [Citation Graph (, )][DBLP]


  10. Inferring Channel Buffer Bounds Via Linear Programming. [Citation Graph (, )][DBLP]


  11. On Bounding Problems of Quantitative Information Flow. [Citation Graph (, )][DBLP]


  12. Checking race freedom via linear programming. [Citation Graph (, )][DBLP]


  13. Dependent types from counterexamples. [Citation Graph (, )][DBLP]


  14. Polymorphic Fractional Capabilities. [Citation Graph (, )][DBLP]


  15. Quantitative Information Flow - Verification Hardness and Possibilities [Citation Graph (, )][DBLP]


Search in 0.582secs, Finished in 0.582secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002