咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 244 篇 programming theo...
  • 10 篇 programming and ...
  • 6 篇 software enginee...
  • 5 篇 software testing
  • 4 篇 high level langu...
  • 3 篇 programming
  • 3 篇 ada
  • 3 篇 graph theory
  • 3 篇 software reliabi...
  • 3 篇 program verifica...
  • 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 篇 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...

语言

  • 211 篇 英文
  • 17 篇 其他
  • 12 篇 俄文
  • 4 篇 中文
检索条件"主题词=Programming theory"
244 条 记 录,以下是31-40 订阅
排序:
SEMANTIC METRICS THROUGH ERROR FLOW-ANALYSIS
收藏 引用
JOURNAL OF SYSTEMS AND SOFTWARE 1993年 第3期20卷 253-265页
作者: MORELL, L MURRILL, B VIRGINIA COMMONWEALTH UNIV DEPT COMP SCIRICHMONDVA 23204 HAMPTON UNIV HAMPTONVA
Error flow analysis of a computer program derives information about how potential data state errors may arise and propagate as the program executes. This information can be used to measure the semantic effects on an e... 详细信息
来源: 评论
Higher-order matching for program transformation
收藏 引用
THEORETICAL COMPUTER SCIENCE 2001年 第1-2期269卷 135-162页
作者: de Moor, O Sittampalam, G Univ Oxford Comp Lab Programming Res Grp Oxford OX1 3QD England
We present a simple, practical algorithm for higher-order matching in the context of automatic program transformation. Our algorithm finds more matches than the standard second order matching algorithm of Huet and Lan... 详细信息
来源: 评论
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... 详细信息
来源: 评论
IMPLEMENTATION OF STATIC SEMANTIC ANALYSIS OF LOTOS SPECIFICATIONS
收藏 引用
SOFTWARE ENGINEERING JOURNAL 1994年 第2期9卷 55-66页
作者: DURANTE, L SISTO, R VALENZANO, A POLITECN TORINO DIPARTIMENTO AUTOMAT & INFORMAT I-10129 TURIN ITALY POLITECN TORINO CTR ELABORAZ NUMERALE SEGNALI I-10129 TURIN ITALY
The implementation of syntax-driven static semantic analysis of languages presenting recursive forward references in their definition requires the handling of a syntax tree. When dealing with languages for which the s... 详细信息
来源: 评论
Reductivity
收藏 引用
SCIENCE OF COMPUTER programming 1996年 第1-3期26卷 217-236页
作者: Doornbos, H Backhouse, R EINDHOVEN UNIV TECHNOL DEPT MATH & COMP SCI 5600 MB EINDHOVEN NETHERLANDS
The notion of reductivity of a relation with respect to a datatype is introduced and related to inductivity and initiality. The use of reductivity in constructing terminating programs is discussed. A calculus of reduc... 详细信息
来源: 评论
Higher-order substitutions
收藏 引用
INFORMATION AND COMPUTATION 2001年 第1期164卷 1-53页
作者: Duggan, D Stevens Inst Technol Dept Comp Sci Hoboken NJ 07030 USA
The lambda sigma -calculus is a concrete lambda -calculus of explicit substitutions, designed for reasoning about implementations of lambda -calculi. Higher-order abstract syntax is an approach to metaprogramming that... 详细信息
来源: 评论
PROGRAM VERIFICATION AND ADA
收藏 引用
IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1982年 第2期129卷 55-62页
作者: MCGETTRICK, AD Department of Computer Science University of Strathclyde Glasgow UK
One of the design aims of Ada was to provide a language which would encourage the production of reliable programs: An important technique used to provide greater reliability is program verification. In this paper, we ... 详细信息
来源: 评论
ON THE MUTUAL-EXCLUSION PROBLEM - A QUEST FOR MINIMAL SOLUTIONS
收藏 引用
THEORETICAL COMPUTER SCIENCE 1994年 第1期129卷 1-38页
作者: ABRAHAM, U MAGIDOR, M HEBREW UNIV JERUSALEM INST MATHJERUSALEMISRAEL
We investigate here the question of finding the minimal requirements for the registers used by n processes that solve the critical-section problem. For two processes, we show that there cannot be a solution to the cri... 详细信息
来源: 评论
New lower bounds and hierarchy results for restricted branching programs
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 1996年 第1期53卷 79-87页
作者: Sieling, D FB Informatik LS II Universität Dortmund 44221 Dortmund Germany
In unrestricted branching programs all variables may be tested arbitrarily often on each path. But exponential lower bounds are only known if on each path the number of tests of each variable is bounded. We examine br... 详细信息
来源: 评论