Exploration of the Capabilities of Constraint Programming for Software Verification-Reference-Cited by-同舟云学术

Exploration of the Capabilities of Constraint Programming for Software Verification

Published:2006 Issue: Volume: Page:182-196
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Collavizza Hélène,Rueher Michel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11691372_12

Reference23 articles.

1. Armando, A., Mantovani, J., Platania, L.: Bounded Model Checking of C Programs using a SMT solver instead of a SAT solver Technical Report, AI-Lab, DIST, University of Genova, December 19, 16 pages (2005)

2. Ball, T., Rajamani, S.K.: Boolean Programs: A Model and Process For Software Analysis. Technical Report MSR TR 200-14 (2000)

3. Lecture Notes in Computer Science;F. Bouquet,2005

4. Lecture Notes in Computer Science;E. Clarke,2004

5. Clarke, E., Kroenig, D., Sharygina, N., Yorav, K.: Predicate abstraction of ANSIC Programs using SAT. In: Formal Methods in System Design, vol. 25, pp. 105–127. Kluwer Academic Press, Dordrecht (2004)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Computational Complexities of Finding Selected Refutations of Linear Programs;Lecture Notes in Computer Science;2024

2. Optimal length cutting plane refutations of integer programs;Discrete Optimization;2023-11

3. Optimal Length Cutting Plane Refutations of Integer Programs;Algorithms and Discrete Applied Mathematics;2023

4. From MiniZinc to Optimization Modulo Theories, and Back;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2020

5. Portability Analysis for Weak Memory Models porthos: One Tool for all Models;Static Analysis;2017