咨询与建议

限定检索结果

文献类型

  • 128 篇 期刊文献
  • 114 篇 会议

馆藏范围

  • 242 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 220 篇 工学
    • 208 篇 计算机科学与技术...
    • 166 篇 软件工程
    • 14 篇 电气工程
    • 11 篇 控制科学与工程
    • 8 篇 信息与通信工程
    • 4 篇 电子科学与技术(可...
    • 2 篇 化学工程与技术
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 航空宇航科学与技...
    • 1 篇 生物工程
    • 1 篇 安全科学与工程
  • 92 篇 理学
    • 89 篇 数学
    • 4 篇 化学
    • 3 篇 统计学(可授理学、...
    • 1 篇 物理学
    • 1 篇 生物学
    • 1 篇 系统科学
  • 36 篇 管理学
    • 26 篇 管理科学与工程(可...
    • 12 篇 图书情报与档案管...
    • 9 篇 工商管理
  • 3 篇 经济学
    • 3 篇 应用经济学
    • 1 篇 理论经济学
  • 3 篇 教育学
    • 2 篇 教育学
    • 1 篇 心理学(可授教育学...
  • 2 篇 医学
    • 1 篇 临床医学

主题

  • 242 篇 programming theo...
  • 10 篇 programming and ...
  • 5 篇 software enginee...
  • 5 篇 software testing
  • 4 篇 high level langu...
  • 3 篇 programming
  • 3 篇 ada
  • 3 篇 graph theory
  • 3 篇 software reliabi...
  • 3 篇 wireless mesh ne...
  • 3 篇 formal specifica...
  • 3 篇 capacity optimiz...
  • 3 篇 programming envi...
  • 3 篇 channel allocati...
  • 2 篇 parallel process...
  • 2 篇 formal logic
  • 2 篇 automation
  • 2 篇 automatic testin...
  • 2 篇 reliability theo...
  • 2 篇 formal languages

机构

  • 2 篇 univ of pennsylv...
  • 2 篇 mgu im. m.v. lom...
  • 2 篇 moskovskij gosud...
  • 2 篇 inria rocquencou...
  • 2 篇 ecole des mines ...
  • 2 篇 inst kibernetiki...
  • 2 篇 aarhus univ aarh...
  • 2 篇 univ oxford comp...
  • 2 篇 city univ london...
  • 2 篇 eindhoven univ t...
  • 2 篇 univ calif berke...
  • 2 篇 univ of nottingh...
  • 1 篇 beijing univ of ...
  • 1 篇 poznan universit...
  • 1 篇 addis ababa univ...
  • 1 篇 hewlett-packard ...
  • 1 篇 technion israel ...
  • 1 篇 johann wolfgang ...
  • 1 篇 national institu...
  • 1 篇 at&t research

作者

  • 3 篇 liu yanhong a.
  • 2 篇 banach r
  • 2 篇 stuckey peter j.
  • 2 篇 kiselyov oleg
  • 2 篇 cousot patrick
  • 2 篇 desharnais j
  • 2 篇 zakharov v.a.
  • 2 篇 duggan d
  • 2 篇 nielson flemming
  • 2 篇 stoller scott d.
  • 2 篇 nielson hanne ri...
  • 2 篇 henzinger thomas...
  • 2 篇 sheard tim
  • 2 篇 mili a
  • 2 篇 rehof jakob
  • 1 篇 merz stephan
  • 1 篇 davidov mikhail
  • 1 篇 puel laurence
  • 1 篇 mai zhongfan
  • 1 篇 ignatushchenko v...

语言

  • 209 篇 英文
  • 17 篇 其他
  • 12 篇 俄文
  • 4 篇 中文
检索条件"主题词=Programming Theory"
242 条 记 录,以下是191-200 订阅
排序:
Relations among objects
收藏 引用
Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics 1993年 第3期 81-88页
作者: Che, Dunren Mai, Zhongfan Beijing Univ of Aeronautics and Astronautics Beijing China
In developing object-oriented (OO) software, the first important thing is to identify objects and define the model of communicating relationships between objects. While designing objects the authors again have to anal... 详细信息
来源: 评论
TESTING FOR THE GROUND (CO-)REDUCIBILITY PROPERTY IN TERM-REWRITING SYSTEMS
收藏 引用
THEORETICAL COMPUTER SCIENCE 1992年 第1期106卷 87-117页
作者: KOUNALIS, E CTR RECH INFORMAT NANCYFRANCE
Given a term-rewriting system R, a term t is ground-reducible by R if every ground instance tsigma of it is R-reducible. A pair (t, s) of terms is ground-co--reducible by R if every ground instance (tsigma, ssigma] of... 详细信息
来源: 评论
WHEN A SOFTWARE MEASURE IS NOT A MEASURE
收藏 引用
SOFTWARE ENGINEERING JOURNAL 1992年 第5期7卷 357-362页
作者: FENTON, N CITY UNIV LONDON CTR SOFTWARE RELIABILLONDON EC1V 0HBENGLAND
A recent interesting paper by Melton et al. [1] discussed finding measures which preserve intuitive orderings on software documents. Informally, if less-than-or-equal-to is such an ordering, then they argue that a mea... 详细信息
来源: 评论
DATA-TYPES WITH ERRORS AND EXCEPTIONS
收藏 引用
THEORETICAL COMPUTER SCIENCE 1992年 第2期105卷 275-299页
作者: ZHANG, MH Department of Applied Mathematics Tsinghua University Beijing People's Republic of China
Ming-Hua Zhang (1988) has proposed a new specification method for data types based on second-order logic. Now we show that errors and exceptions are included directly in the specifications from the beginning. In our a... 详细信息
来源: 评论
INFERRING THE EQUIVALENCE OF FUNCTIONAL PROGRAMS THAT MUTATE DATA
收藏 引用
THEORETICAL COMPUTER SCIENCE 1992年 第2期105卷 167-215页
作者: MASON, I TALCOTT, C STANFORD UNIV DEPT COMP SCI STANFORD CA 94305 USA
In this paper we study the constrained equivalence of programs with effects. In particular, we present a formal system for deriving such equivalences. The formal system we present defines a single-conclusion consequen... 详细信息
来源: 评论
DEFINING CONDITIONAL-INDEPENDENCE USING COLLAPSES
收藏 引用
THEORETICAL COMPUTER SCIENCE 1992年 第2期101卷 337-359页
作者: KATZ, S PELED, D UNIV WARWICK DEPT COMP SCI COVENTRY CV4 7AL W MIDLANDS ENGLAND
Trace semantics is extended to allow conditional commutativity among operations. Conditional commutativity is obtained by identifying the context (the set of global states) in which operations are commutative using sp... 详细信息
来源: 评论
On reasoning with the global time assumption
收藏 引用
ACM letters on programming languages and systems 1992年 第1期1卷 89-103页
作者: Singh, Ambuj K. Univ of California Santa Barbara United States
Concurrency in distributed systems is usually modeled by a nondeterministic interleaving of atomic events. The consequences of this interleaving (or global time) assumption on the specifications and proofs of distribu... 详细信息
来源: 评论
What are race conditions? Some issues and formalizations
收藏 引用
ACM letters on programming languages and systems 1992年 第1期1卷 74-88页
作者: Netzer, Robert H.B. Miller, Barton P. Univ of Wisconsin Madison United States
In shared-memory parallel programs that use explicit synchronization, race conditions result when accesses to shared memory are not properly synchronized. Race conditions are often considered to be manifestations of b... 详细信息
来源: 评论
Polymorphic time systems for estimating program complexity
收藏 引用
ACM letters on programming languages and systems 1992年 第1期1卷 33-45页
作者: Dornic, Vincent Jouvelot, Pierre Gifford, David K. Ecole des Mines de Paris Paris France
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjunction with a conventional type system ... 详细信息
来源: 评论
MIXING LIST RECURSION AND ARITHMETIC
MIXING LIST RECURSION AND ARITHMETIC
收藏 引用
7TH ANNUAL SYMP ON LOGIC IN COMPUTER SCIENCE ( LICS 92 )
作者: FRIBOURG, L LIENS Paris France
A procedure that constructs mechanically the appropriate lemmas for proving assertions about programs with arrays is described. A certain subclass of formulas for which the procedure is guaranteed to terminate and thu... 详细信息
来源: 评论