咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是81-90 订阅
排序:
foundations of software science and computation structures  1
收藏 引用
丛书名: Lecture Notes in Computer science
1000年
作者: Anca Muscholl
this book constitutes the proceedings of the 17th international conference on foundations of software science and computation structures, FOSSACS 2014, held as part of the European Joint conferences on theory and Prac... 详细信息
来源: 评论
Synchronizing Automata over Nested Words  19th
Synchronizing Automata over Nested Words
收藏 引用
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 Martyugin, Pavel Shirmohammadi, Mahsa Max Planck Inst Software Syst MPI SWS Kaiserslautern Germany Max Planck Inst Software Syst MPI SWS Saarbrucken Germany Ural Fed Univ Inst Math & Comp Sci Ekaterinburg Russia Univ Oxford Oxford England
We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nested word automata (NWA): A well-matched nested word is called synchronizing if it resets the control state of any conf... 详细信息
来源: 评论
Specifying and verifying partial order properties using template MSCs
收藏 引用
7th international conference on foundations of software science and computation structures
作者: Genest, B Minea, M Muscholl, A Peled, D Univ Paris 07 LIAFA F-75251 Paris 05 France CNRS F-75251 Paris 05 France Politech Univ Timisoara Dept Comp RO-300223 Timisoara Romania Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England
Message sequence charts (MSC) are a graphical language for the description of communication scenarios between asynchronous processes. Our starting point is to model systems using an assume-guarantee formalism, in the ... 详细信息
来源: 评论
foundations of software science and computation structures
Foundations of software science and computation structures
收藏 引用
丛书名: Lecture notes in computer science
2002年
作者: Mogens Nielsen Uffe Engberg (eds.).
来源: 评论
foundations of software science and computation structures  1
收藏 引用
丛书名: Lecture Notes in Computer science
1000年
作者: Andrew Pitts
this book constitutes the proceedings of the 18th international conference on foundations of software science and computation structures, FOSSACS 2015, held in London, UK, in April 2015, as part of the European Joint ... 详细信息
来源: 评论
Synchronized tree languages revisited and new applications  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
作者: Gouranton, Valérie Réty, Pierre Seidl, Helmut LIFO Université d'Orléans France Dept. of Computer Science University of Trier Germany
We present a new formulation for tree-tuple synchronized languages, much simpler than the existing one. this new formulation allows us to prove stronger structural results. As a consequence, synchronized languages giv... 详细信息
来源: 评论
Nominal Equational Problems  1
收藏 引用
24th 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)
作者: Ayala-Rincon, Mauricio Fernandez, Maribel Nantes-Sobrinho, Daniele Vale, Deivid Univ Brasilia Dept Comp Sci Brasilia DF Brazil Univ Brasilia Dept Math Brasilia DF Brazil Kings Coll London Dept Informat London England Radboud Univ Nijmegen Dept Software Sci Nijmegen Netherlands
We define nominal equational problems of the form E (W) over bar for all(Y) over bar : P, where P consists of conjunctions and disjunctions of equations s approximate to(alpha) t, freshness constraints a#t and their n... 详细信息
来源: 评论
Locating reaction with 2-categories
Locating reaction with 2-categories
收藏 引用
6th international conference on foundations of software science and computation structures
作者: Sassone, V Sobocinski, P Univ Sussex Dept Informat Brighton BN1 9QH E Sussex England Aarhus Univ BRICS DK-8000 Aarhus Denmark
Groupoidal relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner's approach to deriving labelled bisimulation congruences from reduction systems. In this pa... 详细信息
来源: 评论
When ambients cannot be opened
收藏 引用
thEORETICAL COMPUTER science 2005年 第1-2期333卷 127-169页
作者: Boneva, I Talbot, JM Univ Sci & Tech Lille Flandres Artois Lab Informat Fondamentale Lille F-59655 Villeneuve Dascq France
We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from... 详细信息
来源: 评论
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems  27th
Succinctness of Cosafety Fragments of LTL via Combinatorial ...
收藏 引用
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)
作者: Geatti, Luca Mansutti, Alessio Montanari, Angelo Univ Udine Udine Italy IMDEA Software Inst Madrid Spain
this paper focuses on succinctness results for fragments of Linear Temporal Logic with Past (LTL) devoid of binary temporal operators like until, and provides methods to establish them. We prove that there is a family... 详细信息
来源: 评论