Tachio Terauchi

Citat de

	Toate	Din 2020
Referințe bibliografice	2821	709
h-index	21	14
i10-index	33	20

180

135

200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202526 49 57 108 98 111 103 110 107 117 133 136 111 137 124 97 144 135 158 135 117 109 142 172 34

Acces public

Afișați-le pe toate

8 articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Alex AikenProfessor of Computer Science, Stanford UniversityAdresă de e-mail confirmată pe cs.stanford.edu
Hiroshi UnnoTohoku UniversityAdresă de e-mail confirmată pe acm.org
Eric KoskinenCharles Berendsen Associate Professor of Computer Science, Stevens Institute of TechnologyAdresă de e-mail confirmată pe stevens.edu
Jeffrey S. FosterComputer Science, Tufts UniversityAdresă de e-mail confirmată pe tufts.edu
Steven FeinerProfessor of Computer Science, Columbia UniversityAdresă de e-mail confirmată pe cs.columbia.edu
Tobias HöllererProfessor, Computer Science, UC Santa BarbaraAdresă de e-mail confirmată pe cs.ucsb.edu
Timos AntonopoulosResearch Scientist, Yale UniversityAdresă de e-mail confirmată pe yale.edu
Naoki KobayashiThe University of TokyoAdresă de e-mail confirmată pe is.s.u-tokyo.ac.jp
Nariyoshi ChidaNTT Social Informatics LaboratoriesAdresă de e-mail confirmată pe global.ntt
Paul GazzilloUniversity of Central FloridaAdresă de e-mail confirmată pe ucf.edu
Shiyi WeiAssociate Professor of Computer Science, University of Texas at DallasAdresă de e-mail confirmată pe utdallas.edu
Michael W. HicksSenior Principal Scientist, AWS, and Professor Emeritus, UMDAdresă de e-mail confirmată pe umd.edu
Ryosuke SatoTokyo University of Agriculture and TechnologyAdresă de e-mail confirmată pe acm.org
Blair MacIntyreHead of Immersive Tech Research @ JPMorgan Chase. Professor of AR+Design & Computing at NortheasternAdresă de e-mail confirmată pe macmynatt.com
Koji NakazawaNagoya UniversityAdresă de e-mail confirmată pe i.nagoya-u.ac.jp
hong yuProfessor, Director, CHORDS; Professor, Miner school of computer & information sciences, UMassAdresă de e-mail confirmată pe uml.edu
Taro SekiyamaNational Institute of InformaticsAdresă de e-mail confirmată pe nii.ac.jp
William Stafford NobleProfessor of Genome Sciences, University of WashingtonAdresă de e-mail confirmată pe uw.edu

Urmăriți

Tachio Terauchi

Alte nume寺内多智弘

Professor of Computer Science and Engineering, Waseda University

Adresă de e-mail confirmată pe waseda.jp - Pagina de pornire

Programming Languages Program Verification Program Synthesis Security Type Systems


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
Exploring MARS: developing indoor and outdoor user interfaces to a mobile augmented reality system T Höllerer, S Feiner, T Terauchi, G Rashid, D Hallaway Computers & Graphics 23 (6), 779-785, 1999	753	1999
Flow-sensitive type qualifiers JS Foster, T Terauchi, A Aiken Proceedings of the ACM SIGPLAN 2002 Conference on Programming language …, 2002	475	2002
Secure information flow as a safety problem T Terauchi, A Aiken International Static Analysis Symposium, 352-367, 2005	394	2005
Decomposition instead of self-composition for proving the absence of timing channels T Antonopoulos, P Gazzillo, M Hicks, E Koskinen, T Terauchi, S Wei ACM SIGPLAN Notices 52 (6), 362-375, 2017	123	2017
Checking and inferring local non-aliasing A Aiken, JS Foster, J Kodumal, T Terauchi Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language …, 2003	109	2003
Quantitative information flow-verification hardness and possibilities H Yasuoka, T Terauchi 2010 23rd IEEE Computer Security Foundations Symposium, 15-27, 2010	89	2010
Dependent types from counterexamples T Terauchi ACM Sigplan Notices 45 (1), 119-130, 2010	79	2010
Constraint-based relational verification H Unno, T Terauchi, E Koskinen International Conference on Computer Aided Verification, 742-766, 2021	63	2021
Automating relatively complete verification of higher-order functional programs H Unno, T Terauchi, N Kobayashi Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2013	57	2013
A type system for observational determinism T Terauchi 2008 21st IEEE Computer Security Foundations Symposium, 287-300, 2008	55	2008
Checking race freedom via linear programming T Terauchi ACM SIGPLAN Notices 43 (6), 1-10, 2008	51	2008
Automatic termination verification for higher-order functional programs T Kuwahara, T Terauchi, H Unno, N Kobayashi European Symposium on Programming Languages and Systems, 392-411, 2014	47	2014
A capability calculus for concurrency and determinism T Terauchi, A Aiken ACM Transactions on Programming Languages and Systems (TOPLAS) 30 (5), 27, 2008	40	2008
Local temporal reasoning E Koskinen, T Terauchi Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014	37	2014
Temporal verification of higher-order functional programs A Murase, T Terauchi, N Kobayashi, R Sato, H Unno Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2016	36	2016
Quantitative information flow as safety and liveness hyperproperties H Yasuoka, T Terauchi Theoretical Computer Science 538, 167-182, 2014	32	2014
A fixpoint logic and dependent effects for temporal property verification Y Nanjo, H Unno, E Koskinen, T Terauchi Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018	31	2018
Witnessing side effects T Terauchi, A Aiken ACM Transactions on Programming Languages and Systems (TOPLAS) 30 (3), 1-42, 2008	31	2008
On bounding problems of quantitative information flow H Yasuoka, T Terauchi Computer Security–ESORICS 2010, 357-372, 2010	29	2010
Relatively complete refinement type system for verification of higher-order non-deterministic programs H Unno, Y Satake, T Terauchi Proceedings of the ACM on Programming Languages 2 (POPL), 1-29, 2017	26	2017

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori