咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是51-60 订阅
排序:
foundations of software science and computational structures - 8th international conference, FOSSACS 2005, held as part of the Joint European conferences on theory and Practice of software, ETAPS 2005, Proceedings
Foundations of Software Science and Computational Structures...
收藏 引用
8th international conference on foundations of software science and computation structures, FOSSACS 2005, held as part of the Joint European conferences on theory and Practice of software, ETAPS 2005
the proceedings contain 32 papers from the foundations of software science and computational structures, - 8th international conference, FOSSACS 2005, held as part of the Joint European conferences on theory and Pract... 详细信息
来源: 评论
Resource Reachability Games on Pushdown Graphs
收藏 引用
17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)
作者: Lang, Martin Rhein Westfal TH Aachen Lehrstuhl Informat 7 D-52056 Aachen Germany
We consider two-player reachability games with additional resource counters on arenas that are induced by the configuration graphs of pushdown systems. For a play, we define the resource cost to be the highest occurri... 详细信息
来源: 评论
Model-checking infinite systems generated by ground tree rewriting  5th
收藏 引用
5th international conference on foundations of software science and computation structures (FOSSACS 2002)
作者: Löding, C Rhein Westfal TH Aachen Lehrstuhl Informat 7 D-52056 Aachen Germany
We consider infinite graphs that are generated by ground tree (or term) rewriting systems. the vertices of these graphs are trees. thus, with a finite tree automaton one can represent a regular set of vertices. It is ... 详细信息
来源: 评论
Step-Indexed Logical Relations for Probability  18th
Step-Indexed Logical Relations for Probability
收藏 引用
18th international conference on foundations of software science and computation structures (FoSSaCS)
作者: Bizjak, Ales Birkedal, Lars Aarhus Univ DK-8000 Aarhus C Denmark
It is well-known that constructing models of higher-order probabilistic programming languages is challenging. We show how to construct step-indexed logical relations for a probabilistic extension of a higher-order pro... 详细信息
来源: 评论
Homotopy canonicity for cubical type theory  4
Homotopy canonicity for cubical type theory
收藏 引用
4th international conference on Formal structures for computation and Deduction, FSCD 2019
作者: Coquand, thierry Huber, Simon Sattler, Christian Department of Computer Science and Engineering University of Gothenburg Sweden
Cubical type theory provides a constructive justification of homotopy type theory and satisfies canonicity: every natural number is convertible to a numeral. A crucial ingredient of cubical type theory is a path lifti... 详细信息
来源: 评论
Basic mereology with equivalence relations
Basic mereology with equivalence relations
收藏 引用
30th international Symposium on Mathematical foundations of Computer science
作者: Janicki, R McMaster Univ Dept Comp & Software Hamilton ON L8S 4K1 Canada
the traditional theory of "part of" relations (i.e. mereology) is enriched by adding the formal concept of equivalent and exchangeable parts. Various possible axioms and their roles are discussed. An approac... 详细信息
来源: 评论
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting  27th
From Innermost to Full Almost-Sure Termination of Probabilis...
收藏 引用
27th international conference on foundations of software science and computation structures (FoSSaCS) Held as Part of the 27th European Joint conferences on theory and Practice of software (ETAPS)
作者: Kassing, Jan-Christoph Frohn, Florian Giesl, Jurgen Rhein Westfal TH Aachen LuFG Informat 2 Aachen Germany
there are many evaluation strategies for term rewrite systems, but proving termination automatically is usually easiest for innermost rewriting. Several syntactic criteria exist when innermost termination implies full... 详细信息
来源: 评论
A theory of Slicing for Probabilistic Control Flow Graphs  19th
A Theory of Slicing for Probabilistic Control Flow Graphs
收藏 引用
19th international conference on foundations of software science and computation structures (FoSSaCS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)
作者: Amtoft, Torben Banerjee, Anindya Kansas State Univ Manhattan KS 66506 USA IMDEA Software Inst Madrid Spain
We present a theory for slicing probabilistic imperative programs-containing random assignment and "observe" statements-represented as control flow graphs whose nodes transform probability distributions. We ... 详细信息
来源: 评论
foundations for a graph-based approach to the specification of access control policies  4th
收藏 引用
4th international conference on foundations of software science and computation structures, FOSSACS 2001 Held as Part of the Joint European conferences on theory and Practice of software, ETAPS 2001
作者: Koch, Manuel Mancini, Luigi Vincenzo Parisi-Presicce, Francesco PSI AG Berlin Germany Univ. di Roma La Sapienza Rome Italy George Mason Univ FairfaxVA United States
Graph Transformations provide a uniform and precise frame- work for the specification of access control policies allowing the detailed comparison of different policy models and the precise description of the evolution... 详细信息
来源: 评论
Shortest Paths in One-Counter Systems  19th
Shortest Paths in One-Counter Systems
收藏 引用
19th international conference on foundations of software science and computation structures (FoSSaCS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)
作者: Chistikov, Dmitry Czerwinski, Wojciech Hofman, Piotr Pilipczuk, Michal Wehar, Michael Max Planck Inst Software Syst MPI SWS Kaiserslautern Germany Max Planck Inst Software Syst MPI SWS Saarbrucken Germany Univ Warsaw Inst Informat Warsaw Poland ENS Cachan LSV Paris France CNRS Paris France Univ Buffalo Dept Comp Sci & Engn Buffalo NY USA
We show that any one-counter automaton with n states, if its language is non-empty, accepts some word of length at most O(n(2)). this closes the gap between the previously known upper bound of O(n(3)) and lower bound ... 详细信息
来源: 评论