sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM-SIGACT and EATCS ; with support from Ulmer Univeritäts-Gesellschaft ... [et al.]
出版情報:
Los Alamitos, Calif. : IEEE Computer Society, c1997 x, 315 p. ; 28 cm
organized by Indiana University, Bloomington ; sponsored by IEEE Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM SIGACT, The Association for Symbolic Logic, The European Association for Theoretical Computer Science ; with support from College of Arts and Sciences, Indiana University, Bloomington ... [et. al]
出版情報:
Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c1998 xv, 538 p. ; 28 cm
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM SIGACT, EATCS ; with support from DIMACS, University of Minnesota, Cornell University
出版情報:
Los Alamitos : IEEE Computer Society Press, c1995 x, 331 p. ; 28 cm
sponsored by IEEE Computer Society, IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM SIGACT, EATCS ; with support from State University of New York at Buffalo ; edited by Steve Homer and Jin-Yi Cai
出版情報:
Los Alamitos : IEEE Computer Society Press, c1996 x, 307 p. ; 28 cm
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM Special Interest Group on Automata and Computability Theory, The Association for Symbolic Logic, The European Association for Theoretical Computer Science ; with support from AT & T Research Bell Laboratories - Lucent Technologies DIMACS, IBM Almaden Research Center
出版情報:
Los Alamitos, Calif. ; Tokyo : IEEE Computer Society Press, c1996 xv, 535 p. ; 28 cm
sponsored by IEEE Technical Committee on Mathematical Foundations of Computing, CWI, Amsterdam, Vrije Universiteit, Amsterdam ; in cooperation with Association for Computing Machinery, Association for Symbolic Logic, European Association for Theoretical Computer Science
出版情報:
Los Alamitos, CA. ; Tokyo : IEEE Computer Society Press, c1991 xvii, 417 p. ; 28 cm
sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ... [et al.] ; in cooperation with ACM-SIGACT, EATCS
出版情報:
Los Alamitos : IEEE Computer Society Press, c1992 viii, 347 p. ; 28 cm
sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing in cooperation with ACM SIGACT, Association for Symbolic Logic, European Association for Theoretical Computer Science
出版情報:
Washington, D.C. : IEEE Computer Society Press , Los Angeles, CA : Order from IEEE Computer Society, c1986 xi, 383 p. ; 28 cm
sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM SIGACT, EATCS ; with support from CWI ... [et al.]
出版情報:
Los Alamitos : IEEE Computer Society Press, c1994 x, 397 p. ; 28 cm
sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, Boston University ; in cooperation with ACM-SIGACT, EATCS
出版情報:
Los Alamitos : IEEE Computer Society Press, c1993 viii, 326 p. ; 28 cm
organized by Warsaw University ; sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with The Special Interest Group on Automata and Computability Theory of the Association for Computing Machinery, The Association for Symbolic Logic, The European Association for Theoretical Computer Science ; with support from BRICS, University of Aarhus ... [et. al]
出版情報:
Los Alamitos, Calif. ; Tokyo : IEEE Computer Society Press, c1997 xiv, 447 p. ; 28 cm
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with ACM SIGACT, Association for Symbolic Logic, Europe Association for Theoretical Computer Science
出版情報:
Los Alamitos, Calif. ; Tokyo : IEEE Computer Society Press, c1992 xiii, 471 p. ; 28 cm
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with Association for Symbolic Logic, European Association for Theoretical Computer Science ; with support from Fields Institute for Research in Mathematical Sciences, Le Centre de Recherches Mathématiques (CRM), University of Ottawa
出版情報:
Los Alamitos, Calif. ; Tokyo : IEEE Computer Society, c2003 xiv, 393 p. ; 28 cm
sponsored by IEEE Computer Society Technical Committee on Mathematical Foundations of Computing ; in cooperation with Association of Symbolic Logic, European Association for Theoretical Computer Science ; with support from US Office of Naval Research International Field Office, European Office of Aerospace Research and Development of the US Air Force Office of Scientific Research
出版情報:
Los Alamitos, Calif. : IEEE Computer Society, c2002 xiii, 461 p. ; 28 cm
Automatic Decidability / C. Lynch ; B. MorawskaSession 1：
Tree-Like Counterexamples in Model Checking / E. Clarke ; S. Jha ; Y. Lu ; H. VeithSession 2：
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing / S. Laplante ; R. Lassaigne ; F. Magniez ; S. Peyronnet ; M. de Rougemont
Semantic Minimization of 3-Valued Propositional Formulae / T. Reps ; A. Loginov ; M. Sagiv
Invited Lecture: Separation Logic: A Logic for Shared Mutable Data Structures / J. C. ReynoldsSession 3：
A Stratified Semantics of General References Embeddable in Higher-Order Logic / A. J. Ahmed ; A. W. Appel ; R. Virga
A Syntactic Approach to Foundational Proof-Carrying Code / N. A. Hamid ; Z. Shao ; V. Trifonov ; S. Monnier ; Z. NiSession 4：
A Fully Abstract May Testing Semantics for Concurrent Objects / A. Jeffrey ; J. Rathke
Semantics and Logic of Object Calculi / B. Reus ; T. Streicher
Efficient Type Inference for Record Concatenation and Subtyping / J. Palsberg ; T. ZhaoSession 5：
Semantic Subtyping / A. Frisch ; G. Castagna ; V. Benzaken
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types / M. Fiore ; R. Di Cosmo ; V. Balat
On the Lambda Y Calculus / R. StatmanSession 6：
Dense Real-Time Games / M. Faella ; S. La Torre ; A. Murano
Computing Reachability Relations in Timed Automata / C. Dima
Invited Lecture: Monadic Queries over Tree-Structured Data / G. Gottlob ; C. KochSession 7：
Tree Extension Algebras: Logics, Automata, and Query Languages / M. Benedikt ; L. Libkin
The Complexity of First-Order and Monadic Second-Order Logic Revisited / M. Frick ; M. GroheSession 8：
The 0-1 Law Fails for Frame Satisfiability of Propositional Modal Logic / J.-M. Le Bars
Some Results on Automatic Structures / H. Ishihara ; B. Khoussainov ; S. Rubin
Observational Equivalence of 3rd-Order Idealized Algol is Decidable / C.-H. L. OngSession 9：
Games on Graphs and Sequentially Realizable Functionals / M. Hyland ; A. Schalk
Polarized Games / O. Laurent
Domain Theory and Differential Calculus (Functions of One Variable) / A. Edalat ; A. LieutierSession 10：
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory / A. Simpson
The Powerdomain of Indexed Valuations / D. Varacca
Invited Lecture: Complexity Classes, Propositional Proof Systems, and Formal Theories / S. A. CookSession 11：
Complete Problems for Dynamic Complexity Classes / W. Hesse ; N. Immerman
Unsatisfiable Random Formulas Are Hard to Certify / A. AtseriasSession 12：
The Proof Complexity of Linear Algebra / M. Soltys ; S. Cook
Calibrating Computational Feasibility by Abstraction Rank / D. Leivant
Short Presentations / Session 13：
Lessons Learned from Formal Developments in PVS / J. Ford ; I. A. Mason
CLP Implementation of a Phase Model Checker / S. Soliman
An Overview of MR, a Calculus of Mobile Resources / J. C. Godskesen ; T. Hildebrandt ; V. Sassone
Ludics Dynamics: Designs and Interactive Observability / C. Faggian
Invited Tutorial: Description Logics: Foundations for Class-Based Knowledge Representation / D. Calvanese ; G. De Giacomo ; M. LenzeriniSession 14：
Modal and Guarded Characterisation Theorems over Finite Transition Systems / M. Otto
Temporal Logic with Forgettable Past / F. Laroussinie ; N. Markey ; P. SchnoebelenSession 15：
Decidable and Undecidable Fragments of First-Order Branching Temporal Logics / I. Hodkinson ; F. Wolter ; M. Zakharyaschev
Expressive Equivalence of Least and Inflationary Fixed-Point Logic / S. Kreutzer
The Metric Analogue of Weak Bisimulation for Probabilistic Processes / J. Desharnais ; R. Jagadeesan ; V. Gupta ; P. PanangadenSession 16：
Separability, Expressiveness, and Decidability in the Ambient Logic / D. Hirschkoff ; E. Lozes ; D. Sangiorgi
Linearity in Process Languages / M. Nygaard ; G. Winskel
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time / A. TiwariSession 17：
Two Adversary Lower Bounds for Parity Games / H. Bjorklund ; S. Vorobyov
Is Randomized Gurvich-Karzanov-Khachiyan's Algorithm for Parity Games Polynomial? / E. Beffara
Time-Space Computational Complexity of Imperative Programming Languages / E. Covino ; G. Pani
図書
雑誌
