检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

154 篇 会议
17 篇 期刊文献
7 册 图书

馆藏范围

176 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

145 篇 工学
- 139 篇 计算机科学与技术...
- 94 篇 软件工程
- 15 篇 电气工程
- 14 篇 信息与通信工程
- 8 篇 控制科学与工程
- 4 篇 化学工程与技术
- 3 篇 土木工程
- 2 篇 力学（可授工学、理...
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
- 1 篇 电子科学与技术（可...
- 1 篇 建筑学
- 1 篇 测绘科学与技术
- 1 篇 城乡规划学
- 1 篇 生物工程
- 1 篇 网络空间安全
62 篇 理学
- 59 篇 数学
- 5 篇 化学
- 5 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 系统科学
- 1 篇 大气科学
12 篇 管理学
- 12 篇 图书情报与档案管...
2 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
- 1 篇 基础医学(可授医学...

主题

9 篇 computer softwar...
7 篇 system analysis
6 篇 semantics
5 篇 model checking
5 篇 artificial intel...
4 篇 software enginee...
4 篇 specifications
4 篇 data structures
4 篇 congresses.
4 篇 temporal logic
3 篇 computer science
3 篇 calculations
3 篇 differentiation ...
3 篇 algebra
2 篇 program debuggin...
2 篇 conferences
2 篇 computer circuit...
2 篇 mobile computati...
2 篇 congruence resul...
2 篇 formal logic

机构

4 篇 max planck inst ...
4 篇 chinese acad sci...
3 篇 max planck inst ...
3 篇 nanjing univ sta...
3 篇 tech univ dortmu...
2 篇 department of co...
2 篇 univ sci & tech ...
2 篇 univ wisconsin d...
2 篇 xidian univ inst...
2 篇 univ london impe...
2 篇 univ bologna dip...
2 篇 xidian univ isn ...
2 篇 chinese acad sci...
2 篇 univ leicester d...
2 篇 cwi dept softwar...
2 篇 microsoft res as...
2 篇 rhein westfal th...
2 篇 tel aviv univ sc...
2 篇 chinese acad sci...
2 篇 univ oxford dept...

作者

3 篇 zavattaro g
3 篇 doberkat ernst-e...
3 篇 chistikov dmitry
2 篇 ulidowski irek
2 篇 rabinovich alexa...
2 篇 busi n
2 篇 zhan naijun
2 篇 yoshida nobuko
2 篇 sagiv mooly
2 篇 cai jin-yi
2 篇 haase christoph
2 篇 furio honsell
2 篇 kurz alexander
2 篇 yang xiaoxiao
2 篇 aceto luca
2 篇 berard beatrice
2 篇 uustalu tarmo
2 篇 xia mingji
2 篇 vale deivid
2 篇 duan zhenhua

语言

171 篇 英文
4 篇 中文
3 篇 其他

检索条件"任意字段=6th International Conference on Foundations of Software Science and Computation Structures"

共 178 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

28th international conference on foundations of software science and computation structures, FOSSACS 2025, held as part of the international Joint conferences on theory and Practice of software, ETAPS 2025

28th International Conference on Foundations of Software Sci...

引用

28th international conference on foundations of software science and computation structures, FOSSACS 2025, held as part of the international Joint conferences on theory and Practice of software, ETAPS 2025

ISBN: (纸本)9783031908965

the proceedings contain 19 papers. the special focus in this conference is on foundations of software science and computation structures. the topics include: Fair Quantitative Games;model-Checking Real-Time Systems: Revisiting the Alternating Automaton Route;two-sorted algebraic decompositions of Brookes’s shared-state denotational semantics;idempotent Resources in Separation Logic: the Heart of core in Iris;a Behavioural Pseudometric for Continuous-Time Markov Processes;complementation of Emerson-Lei Automata;alternative Characterizations of Hereditary History-Preserving Bisimilarity via Backward Ready Multisets;context-Free Languages of String Diagrams;relational Connectors and Heterogeneous Simulations;on the cut-elimination of the modal μ-calculus: Linear Logic to the rescue;combining quantum and classical control: syntax, semantics and adequacy;BiGKAT: An Algebraic Framework for Relational Verification of Probabilistic Programs;sharing and Linear Logic with Restricted Access;a General Completeness theorem for Skip-Free Star Algebras;complete Test Suites for Automata in Monoidal Closed Categories;temporal Hyperproperties for Population Protocols;preface;ETAPS Foreword.

关键词：

来源：评论

学校读者我要写书评

暂无评论

27th international conference on foundations of software science and computation structures, FOSSACS 2024 held as part of the European Joint conferences on theory and Practice of software, ETAPS 2024

27th International Conference on Foundations of Software Sci...

引用

27th international conference on foundations of software science and computation structures, FOSSACS 2024 held as part of the European Joint conferences on theory and Practice of software, ETAPS 2024

ISBN: (纸本)9783031572302

the proceedings contain 12 papers. the special focus in this conference is on foundations of software science and computation structures. the topics include: From Rewrite Rules to Axioms in the λΠ-Calculus Modulo theory;light Genericity;logical Predicates in Higher-Order Mathematical Operational Semantics;on Basic Feasible Functionals and the Interpretation Method;Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems;A Resolution-Based Interactive Proof System for UNSAT;craig Interpolation for Decidable First-Order Fragments;clones, closed categories, and combinatory logic;Reachability in Fixed VASS: Expressiveness and Lower Bounds;from Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting;dimension-Minimality and Primality of Counter Nets.

关键词：

来源：评论

学校读者我要写书评

暂无评论

27th International Conference on Foundations of Software Sci...

引用

27th international conference on foundations of software science and computation structures, FOSSACS 2024 held as part of the European Joint conferences on theory and Practice of software, ETAPS 2024

ISBN: (纸本)9783031572272

关键词：

来源：评论

学校读者我要写书评

暂无评论

25th international conference on foundations of software science and computation structures, FoSSaCS 2022, held as part of the European Joint conferences on theory and Practice of software, ETAPS 2022

25th International Conference on Foundations of Software Sci...

引用

25th international conference on foundations of software science and computation structures, FoSSaCS 2022, held as part of the European Joint conferences on theory and Practice of software, ETAPS 2022

ISBN: (纸本)9783030992521

the proceedings contain 23 papers. the special focus in this conference is on foundations of software science and computation structures. the topics include: A new criterion for M, N -adhesivity, with an application to hierarchical graphs;quantifier elimination for counting extensions of Presburger arithmetic;a first-order logic characterisation of safety and co-safety languages;first-order separation over countable ordinals;a Faithful and Quantitative Notion of Distant Reduction for Generalized Applications;modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy;temporal Stream Logic modulo theories;the Different Shades of Infinite Session Types;complete and tractable machine-independent characterizations of second-order polytime;limits and difficulties in the design of under-approximation abstract domains;variable binding and substitution for (nameless) dummies;uniform Guarded Fragments;sweedler theory of Monads;model Checking Temporal Properties of Recursive Probabilistic Programs;on probability-raising causality in Markov decision processes;parameterized Analysis of Reconfigurable Broadcast Networks;separators in Continuous Petri Nets;graphical Piecewise-Linear Algebra;token Games and History-Deterministic Quantitative Automata;on the Translation of Automata to Linear Temporal Logic.

关键词：

来源：评论

学校读者我要写书评

暂无评论

24th international conference on foundations of software science and computation structures, FOSSACS 2021 held as part of the European Joint conferences on theory and Practice of software, ETAPS 2021

24th International Conference on Foundations of Software Sci...

引用

24th international conference on foundations of software science and computation structures, FOSSACS 2021 held as part of the European Joint conferences on theory and Practice of software, ETAPS 2021

ISBN: (纸本)9783030719944

the proceedings contain 28 papers. the special focus in this conference is on foundations of software science and computation structures. the topics include: Finding cut-offs in leaderless rendez-vous protocols is easy;fixpoint theory – upside down;"Most of" leads to undecidability: Failure of adding frequencies to LTL;combining semilattices and semimodules;one-way resynchronizability of word transducers;fair refinement for asynchronous session types;running time analysis of broadcast consensus protocols;leafy automata for higher-order concurrency;factorization in call-by-name and call-by-value calculi via linear logic;generalized bounded linear logic and its categorical semantics;focused proof-search in the logic of bunched implications;interpolation and amalgamation for arrays with maxdiff;adjoint reactive gui programming;on the expressiveness of büchi arithmetic;learning pomset automata;parametricity for primitive nested types;the spirit of node replication;nondeterministic and co-nondeterministic implies deterministic, for data languages;certifying inexpressibility;a general semantic construction of dependent refinement type systems, categorically;simple stochastic games with almost-sure energy-parity objectives are in np and conp;nondeterministic syntactic complexity;a string diagrammatic axiomatisation of finite-state automata;work-sensitive dynamic complexity of formal languages;the structure of sum-over-paths, its consequences, and completeness for clifford;a quantified coalgebraic van benthem theorem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

ISBN: (纸本)9783031572302;9783031572319

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 termination. We adapt these criteria to the probabilistic setting, e.g., we show when it suffices to analyze almost-sure termination (AST) w.r.t. innermost rewriting to prove full AST of probabilistic term rewrite systems. these criteria also apply to other notions of termination like positive AST. We implemented and evaluated our new contributions in the tool AProVE.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

ISBN: (纸本)9783031572302;9783031572319

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 of cosafety languages (L-n) n >= 1 such that Ln can be expressed with a pure future formula of size O(n), but it requires formulae of size 2(Omega(n)) to be captured with past formulae. As a by-product, such a succinctness result shows the optimality of the pastification algorithm proposed in [Artale et al., KR, 2023]. We show that, in the considered case, succinctness cannot be proven by relying on the classical automata-based method introduced in [Markey, Bull. EATCS, 2003]. In place of this method, we devise and apply a combinatorial proof system whose deduction trees represent LTL formulae. the system can be seen as a proof-centric (one-player) view on the games used by Adler and Immerman to study the succinctness of CTL.

关键词： Temporal logics LTL Succinctness Proof systems

来源：评论

学校读者我要写书评

暂无评论

Fair ω-Regular Games 27th

Fair ω-Regular Games

引用

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)

作者： Hausmann, Daniel Piterman, Nir Saglam, Irmak Schmuck, Anne-Kathrin Univ Gothenburg Gothenburg Sweden Max Planck Inst Software Syst MPI SWS Kaiserslautern Germany

ISBN: (纸本)9783031572272;9783031572289

We consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph G = (V, E) and a set of fair moves E-f subset of E a player is said to play fair in G if they choose an edge e is an element of E-f infinitely often whenever the source node of e is visited infinitely often. Otherwise, they play unfair. We equip such games with two w -regular winning conditions alpha and beta deciding the winner of mutually fair and mutually unfair plays, respectively. Whenever one player plays fair and the other plays unfair, the fairly playing player wins the game. the resulting games are called fair alpha/beta games. We formalize fair alpha/beta games and show that they are determined. For fair parity/parity games, i.e., fair alpha/beta games where alpha and beta are given each by a parity condition over G, we provide a polynomial reduction to (normal) parity games via a gadget construction inspired by the reduction of stochastic parity games to parity games. We further give a direct symbolic fixpoint algorithm to solve fair parity/parity games. On a conceptual level, we illustrate the translation between the gadget -based reduction and the direct symbolic algorithm which uncovers the underlying similarities of solution algorithms for fair and stochastic parity games, as well as for the recently considered class of fair games in which only one player is restricted by fair moves.

关键词： games on graphs fairness two-player games parity games

来源：评论

学校读者我要写书评

暂无评论

Context-Free Languages of String Diagrams 28th

Context-Free Languages of String Diagrams

引用

作者： Earnshaw, Matt Román, Mario Department of Software Science Tallinn University of Technology Tallinn Estonia Department of Computer Science University of Oxford Oxford United Kingdom

ISBN: (纸本)9783031908965

We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string diagrams. Context-free languages of string diagrams include classical context-free languages of words, trees, and hypergraphs, when instantiated over appropriate monoidal categories. We prove a representation theorem for context-free languages of string diagrams: every such language arises as the image under a monoidal functor of a regular language of string diagrams. © the Author(s) 2025.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Structural Liveness of Conservative Petri Nets 28th

Structural Liveness of Conservative Petri Nets

引用

作者： Jančar, Petr Leroux, Jérôme Valůšek, Jiří Department of Computer Science Faculty of Science Palacký University Olomouc Czech Republic LaBRI CNRS University of Bordeaux Bordeaux France

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jančar and Purser, 2019] holds even for a60;simple subclass of conservative nets. As the main result we then show that for structural... 详细信息

ISBN: (纸本)9783031908965

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jančar and Purser, 2019] holds even for a simple subclass of conservative nets. As the main result we then show that for structurally live conservative nets the values of the least live markings are at most double exponential in the size of the nets, which entails the EXPSPACE-completeness of structural liveness for conservative Petri nets;the complexity of the general case remains unclear. As a proof ingredient with a potential of wider applicability, we present an extension of the known results bounding the smallest integer solutions of boolean combinations of linear (in)equations and divisibility constraints. © the Author(s) 2025.

关键词： conservative net Petri net structural liveness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共18页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：