咨询与建议

限定检索结果

文献类型

  • 156 篇 会议
  • 43 册 图书
  • 14 篇 期刊文献

馆藏范围

  • 211 篇 电子文献
  • 2 种 纸本馆藏

日期分布

学科分类号

  • 146 篇 工学
    • 138 篇 计算机科学与技术...
    • 100 篇 软件工程
    • 13 篇 电气工程
    • 13 篇 信息与通信工程
    • 10 篇 控制科学与工程
    • 5 篇 土木工程
    • 3 篇 化学工程与技术
    • 2 篇 建筑学
    • 1 篇 力学(可授工学、理...
    • 1 篇 机械工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 测绘科学与技术
    • 1 篇 轻工技术与工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 农业工程
    • 1 篇 生物医学工程(可授...
  • 56 篇 理学
    • 52 篇 数学
    • 6 篇 统计学(可授理学、...
    • 4 篇 化学
    • 4 篇 生物学
    • 3 篇 系统科学
    • 1 篇 物理学
    • 1 篇 大气科学
    • 1 篇 地球物理学
  • 10 篇 管理学
    • 9 篇 图书情报与档案管...
  • 2 篇 医学
    • 2 篇 基础医学(可授医学...
    • 1 篇 临床医学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 文学
    • 1 篇 新闻传播学
  • 1 篇 农学
    • 1 篇 作物学

主题

  • 22 篇 theory of comput...
  • 22 篇 software enginee...
  • 16 篇 software enginee...
  • 15 篇 logics and meani...
  • 13 篇 mathematical log...
  • 12 篇 programming lang...
  • 11 篇 semantics
  • 10 篇 artificial intel...
  • 10 篇 computation by a...
  • 9 篇 computer softwar...
  • 8 篇 computer system ...
  • 8 篇 programming tech...
  • 8 篇 data structures
  • 8 篇 data structures ...
  • 7 篇 system analysis
  • 6 篇 computer communi...
  • 6 篇 mathematics of c...
  • 5 篇 model checking
  • 5 篇 algorithm analys...
  • 4 篇 discrete mathema...

机构

  • 4 篇 max planck inst ...
  • 3 篇 max planck inst ...
  • 3 篇 univ leicester d...
  • 3 篇 university of ox...
  • 2 篇 department of co...
  • 2 篇 univ sci & tech ...
  • 2 篇 univ london impe...
  • 2 篇 univ bologna dip...
  • 2 篇 cwi dept softwar...
  • 2 篇 univ warwick dep...
  • 2 篇 rwth aachen univ...
  • 2 篇 queen mary univ ...
  • 2 篇 rhein westfal th...
  • 2 篇 tel aviv univ sc...
  • 2 篇 univ oxford dept...
  • 2 篇 imdea software i...
  • 2 篇 the university o...
  • 2 篇 university of ca...
  • 2 篇 univ paris 07 li...
  • 2 篇 univ london quee...

作者

  • 3 篇 zavattaro g
  • 3 篇 uustalu tarmo
  • 3 篇 chistikov dmitry
  • 3 篇 o'hearn p
  • 2 篇 ulidowski irek
  • 2 篇 rabinovich alexa...
  • 2 篇 james worrell
  • 2 篇 busi n
  • 2 篇 sagiv mooly
  • 2 篇 naoki kobayashi
  • 2 篇 anna ingólfsdótt...
  • 2 篇 luca aceto
  • 2 篇 haase christoph
  • 2 篇 furio honsell
  • 2 篇 kurz alexander
  • 2 篇 aceto luca
  • 2 篇 pfenning frank
  • 2 篇 boneva i
  • 2 篇 plump detlef
  • 2 篇 mogens nielsen

语言

  • 204 篇 英文
  • 5 篇 其他
  • 4 篇 中文
检索条件"任意字段=4th International Conference on Foundations of Software Science and Computation Structures"
213 条 记 录,以下是31-40 订阅
排序:
Notions of computation determine monads  5th
收藏 引用
5th international conference on foundations of software science and computation structures (FOSSACS 2002)
作者: Plotkin, G Power, J Univ Edinburgh Div Informat Edinburgh EH9 3JZ Midlothian Scotland
We model notions of computation using algebraic operations and equations. We show that these generate several of the monads of primary interest that have been used to model computational effects, with the striking omi... 详细信息
来源: 评论
First-order and counting theories of ω-automatic structures
收藏 引用
9th international conference on foundations of software science and computation structures
作者: Kuske, Dietrich Lohrey, Markus Univ Leipzig Inst Informat Leipzig Germany Univ Stuttgart FMI Stuttgart Germany
the logic C(Q(u)) extends first-order logic by a generalized form of counting quantifiers ("the number of elements satisfying ... belongs to the set C"). this logic is investigated for structures with an inj... 详细信息
来源: 评论
A semantic basis for local reasoning  5th
收藏 引用
5th international conference on foundations of software science and computation structures (FOSSACS 2002)
作者: Yang, HS O'Hearn, P Korea Adv Inst Sci & Technol ROPAS Taejon South Korea Queen Mary Univ London London E1 4NS England
We present a semantic analysis of a recently proposed formalism for local reasoning, where a specification (and hence proof) can concentrate on only those cells that a program accesses. Our main results are the soundn... 详细信息
来源: 评论
Confluence of right ground term rewriting systems is decidable  1
收藏 引用
8th international conference on foundations of software science and computation structures
作者: Kaiser, L Rhein Westfal TH Aachen Math Grundlagen Informat D-5100 Aachen Germany
Term rewriting systems provide a versatile model of computation. An important property which allows to abstract from potential nondeterminism of parallel execution of the modelled program is confluence. In this paper ... 详细信息
来源: 评论
A calculus of circular proofs and its categorical semantics  5th
收藏 引用
5th international conference on foundations of software science and computation structures (FOSSACS 2002)
作者: Santocanale, L Univ Calgary Dept Comp Sci Calgary AB T2N 1N4 Canada
We present a calculus of "circular proofs": the graph underlying a proof is not a finite tree but instead it is allowed to contain a certain amount of cycles. the main challenge in developing a theory for th... 详细信息
来源: 评论
Program logic and equivalence in the presence of garbage collection
收藏 引用
thEORETICAL COMPUTER science 2003年 第3期298卷 557-581页
作者: Calcagno, C O'Hearn, P Bornat, R Univ London Queen Mary & Westfield Coll Dept Comp Sci London E1 4NS England
it is generally thought that reasoning about programs in memory safe, garbage collected languages is much easier than in languages where the programmer has more explicit control over memory. Paradoxically, existing pr...
来源: 评论
foundations of web transactions  1
收藏 引用
8th international conference on foundations of software science and computation structures
作者: Laneve, C Zavattaro, G Univ Bologna Dept Comp Sci I-40126 Bologna Italy
A timed extension of pi-calculus with a transaction construct - the calculus Web pi - is studied. the underlying model of Web pi relies on networks of processes;time proceeds asynchronously at the network level, while... 详细信息
来源: 评论
foundations of Differential Dataflow  18th
Foundations of Differential Dataflow
收藏 引用
18th international conference on foundations of software science and computation structures (FoSSaCS)
作者: Abadi, Martin McSherry, Frank Plotkin, Gordon D. Microsoft Res Redmond WA USA Univ Edinburgh Sch Informat LFCS Edinburgh EH8 9YL Midlothian Scotland
Differential dataflow is a recent approach to incremental computation that relies on a partially ordered set of differences. In the present paper, we aim to develop its foundations. We define a small programming langu... 详细信息
来源: 评论
Tuning the Schur complement computations for finite element partitions
收藏 引用
ADVANCES IN ENGINEERING software 2000年 第12期31卷 913-920页
作者: Nikishkov, GP Kanda, H Makinouchi, A Univ Calif Los Angeles Ctr Aerosp Res & Educ Los Angeles CA 90095 USA Univ Aizu Dept Comp Software Fukushima 9658580 Japan RIKEN Inst Phys & Chem Res Mab Fabricat Lab Wako Saitama 35101 Japan
the domain decomposition method (DDM) is an efficient algorithmic tool for the parallelization of finite element computer codes. A variant of the DDM with direct solution algorithm is based on computation of Schur com... 详细信息
来源: 评论
Principal filters definable by parameters in EbT
收藏 引用
MAthEMATICAL structures IN COMPUTER science 2009年 第1期19卷 153-167页
作者: Li, Angsheng Li, Weilin Pani, Yicheng Tang, Linqing Chinese Acad Sci State Key Lab Comp Sci Beijing 100080 Peoples R China Chinese Acad Sci Inst Software Beijing 100080 Peoples R China
We show that there exist c.e. bounded Turing degrees a, b such that 0 = a. the result gives an unexpected definability theorem in the structure of bounded Turing reducibility.
来源: 评论