Author:
Gonzalez-de-Aledo Pablo,Sanchez Pablo
Publisher
Springer Berlin Heidelberg
Reference4 articles.
1. Yen, J.Y.: An algorithm for finding shortest routes from all source nodes to a given destination in general networks. The Quarterly of Applied Mathematics 27, 526–530
2. Lattner, C., Adve, V.: LLVM: A compilation framework for lifelong program analysis & transformation. In: International Symposium on Code Generation and Optimization 2004, pp. 75–86 (2004)
3. Lecture Notes in Computer Science;L. Moura de,2008
4. Hart, P.E., Nilsson, N.J., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics SSC4 4, 100–107 (1968)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Software Model Checking: 20 Years and Beyond;Lecture Notes in Computer Science;2022
2. YASSi: Yet Another Symbolic Simulator Large (Tool Demo);Communications in Computer and Information Science;2020
3. Automatic Loop Summarization via Path Dependency Analysis;IEEE Transactions on Software Engineering;2019-06-01
4. Re-utilizing Verification Results of UML/OCL Models;Automated Validation & Verification of UML/OCL Models Using Satisfiability Solvers;2018
5. A Symbolic Formulation for Models;Automated Validation & Verification of UML/OCL Models Using Satisfiability Solvers;2018