首页> 外文会议>ACM SIGPLAN conference on Programming language design and implementation >A decision procedure for subset constraints over regular languages
【24h】

A decision procedure for subset constraints over regular languages

机译:常规语言中子集约束的决策过程

获取原文

摘要

Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings, and are often manipulated using high-level string operations such as equality checks, regular expression matching, and string concatenation. It is difficult to reason about these operations because they are not well-integrated into current constraint solvers.
机译:关于字符串变量的推理,特别是程序输入,是许多程序分析和测试框架的一个重要方面。程序输入总是作为字符串到达​​,并且通常使用高级字符串操作进行操作,例如平等检查,正则表达式匹配和字符串连接。这很难推理这些操作,因为它们并不融合到电流约束溶剂中。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号