Precondition Inference from Intermittent Assertions and Application to Contracts on Collections-Reference-Cited by-同舟云学术

Precondition Inference from Intermittent Assertions and Application to Contracts on Collections

Published:2011 Issue: Volume: Page:150-168
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cousot Patrick,Cousot Radhia,Logozzo Francesco

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-18275-4_12

Reference28 articles.

1. Arnout, K., Meyer, B.: Uncovering hidden contracts: The. NET example. IEEE Computer 36(11), 48–55 (2003)

2. Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)

3. Barnett, M., Fähndrich, M., Garbervetsky, D., Logozzo, F.: Annotations for (more) precise points-to analysis. In: IWACO 2007, Stockholm U. and KTH (2007)

4. Barnett, M., Fähndrich, M., Logozzo, F.: Embedded contract languages. In: SAC 2010, pp. 2103–2110. ACM, New York (2010)

5. Biere, A., Cimatti, A., Clarke, E., Strichman, O., Zhu, Y.: Bounded model checking. Advances in Computers 58, 118–149 (2003)

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

1. Limits and Difficulties in the Design of Under-Approximation Abstract Domains;ACM Transactions on Programming Languages and Systems;2024-06-09

2. Ill-Typed Programs Don’t Evaluate;Proceedings of the ACM on Programming Languages;2024-01-05

3. Calculational Design of [In]Correctness Transformational Program Logics by Abstract Interpretation;Proceedings of the ACM on Programming Languages;2024-01-05

4. Maximal Quantified Precondition Synthesis for Linear Array Loops;Lecture Notes in Computer Science;2024

5. Weakest Precondition Inference for Non-Deterministic Linear Array Programs;Lecture Notes in Computer Science;2024