Author:
Conchon Sylvain,Filliâtre Jean-Christophe
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Baker, H.G.: Shallow binding makes functional arrays fast. SIGPLAN Not. 26(8), 145–147 (1991)
2. Lecture Notes in Computer Science;K. Mike Barnett,2005
3. Benedikt, M., Reps, T.W., Sagiv, S.: A decidable logic for describing linked data structures. In: European Symposium on Programming, pp. 2–19 (1999)
4. Blanchet, B.: Escape analysis: Correctness proof, implementation and experimental results. In: Symposium on Principles of Programming Languages, pp. 25–37 (1998)
5. Conchon, S., Contejean, E.: Ergo: A Decision Procedure for Program Verification, http://ergo.lri.fr/
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Formal Model for a Linear Time Correctness Condition of Proof Nets of Multiplicative Linear Logic;Logic-Based Program Synthesis and Transformation;2021
2. Ensuring the Strong Exception Safety;Towards a Synergistic Combination of Research and Practice in Software Engineering;2017-08-06
3. An Abstract Machine for the Old Value Retrieval;Lecture Notes in Computer Science;2010