搜索结果: 1-13 共查到“计算机科学技术 constraint”相关记录13条 . 查询时间(0.046 秒)
Constraint-based program analyses are appealing because elaborate analyses can be described with a concise and simple set of constraint generation rules. Constraint resolution algorithms have been dev...
A Toolkit for Constructing Type- and Constraint-Based Program Analyses
Constructing Type Constraint-Based Program Analyses
2016/5/24
BANE (the Berkeley Analysis Engine) is a publicly available toolkit for constructing type- and constraint-based program analyses.1 We describe the goals of the pro ject, the rationale for BANE's overa...
Partial Online Cycle Elimination in Inclusion Constraint Graphs
Partial Online Cycle Elimination Inclusion Constraint Graphs
2016/5/24
Many program analyses are naturally formulated and implemented using inclusion constraints. We present new results on the scalable implementation of such analyses based on two insights: rst, that onl...
Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs
Projection Merging Reducing Redundancies Inclusion Constraint Graphs
2016/5/24
Inclusion-based program analyses are implemented by adding new edges to directed graphs. In most analyses, there are many di erent ways to add a transitive edge between two nodes, namely through each ...
The Set Constraint/CFL Reachability Connection in Practice
Set constraints context-free language reachability flow analysis type qualifiers
2016/5/24
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new reduction from Dyck-CFL r...
Banshee: A Scalable Constraint-Based Analysis Toolkit
Banshee Scalable Constraint-Based Analysis Toolkit
2016/5/24
We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resolution engines, incremental analysis...
Small Formulas for Large Programs: On-line Constraint Simplification in Scalable Static Analysis
Small Formulas Large Programs On-line Constraint Simplification Scalable Static Analysis
2016/5/24
Static analysis techniques that represent program states as formulas typically generate a large number of redundant formulas that are incrementally constructed from previous formulas. In addition to q...
Introduction to Set Constraint-Based Program Analysis
Set Constraint-Based Program Analysis
2016/5/24
Introduction to Set Constraint-Based Program Analysis.
Learning the Structure of Bayesian Networks with Constraint Satisfaction
Bayesian networks Constraint satisfaction Constraint-based Structure learning
2014/12/18
A Bayesian network is graphical representation of the probabilistic relationships among set of variables and can be used to encode expert knowledge about uncertain domains. The structure of this model...
Vision-Based Semi-Supervised Homecare with Spatial Constraint
Intelligent homecare semi-supervised learning tracking action detection surveillance
2013/7/17
Vision-based homecare system receives increasing research interest owing to its efficiency, portability and low-cost characters. This paper presents a vision-based semi-supervised homecare system to a...
AbstractThe ultimate goal of workflow management is to implement the right person executes the right activity at the right time. To make enterprises more competitive, time-related restrictions of busi...
期刊信息
篇名
A constraint solver and its application to path feasibility analysis
语种
英文
撰写或编译
撰写
作者
张健,王晓旭
第一作者单位
刊物名称
Internationl Journal of Software Engineering and Knowledge Engineering
页面
2001
出版日期
20...
A Constraint Specification Approach to Building Flexible Workflows
workflow flexible tertiary domain constraint specification
2014/3/12
Process support systems, such as workflows, are being used in a variety of domains.However, most areas of application have focused on traditional production-style processes, which are characterised by...