Probabilistic Abstract Interpretation

Up: Probabilistic Abstract Interpretation Previous: Relevance to Beneficiaries

References

1: Emile Aarts and Jan Korst. Simulated Annealing and Boltzmann Machines. John Wiley & Sons, Chicester, 1989.
2: M. Abadi and A. Gordon. A calculus for cryptographic protocols: the spi calculus. In ACM Conference on Computer and Communication Security (CCS-4), pages 36-47, 1997.
3: Martin Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The Spi calculus. SRC Research Report 149, Digital Systems Research Center, Palo Alto CA, January 1998.
4: Samson Abramsky and Chris Hankin, editors. Abstract Interpretation of Declarative Languages. Ellis-Horwood, 1987.
5: David Applebaum. Probability and Information - An Integrated Approach. Cambridge University Press, Cambridge, 1996.
6: F. Bacchus. Representing and Reasoning with Probabilistic Knowledge. MIT Press, Cambridge, Massachusetts, 1990.
7: Roberto Bagnara. A reactive implementation of Pos using ROBDDs. In H. Kuchen and S.D. Swierstra, editors, Programming Languages: Implementations, Logics and Programs, volume 1140 of Lecture Notes in Computer Science, pages 107-121, Berlin, 1996. Springer Verlag.
8: Roberto Bagnara. Data-Flow Analysis for Constraint Logic-Based Languages. PhD thesis, Dipartimento di Informatica, Università di Pisa, February 1997.
9: Christel Baier and Marta Z. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Technical Report CSR-96-12, School of Computer Science, University of Birmingham, June 1996.
10: Marco Bernardo and Roberto Gorrieri. A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time. Technical Report UBLCS-96-17, Department of Computer Science, University of Bologna, January 1997.
11: Richard Blute, Josée Desharnais, Abbas Edalat, and Prakash Panangaden. Bisimulation for labelled Markov processes. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 149-158, Warsaw, Poland, June/July 1997. IEEE Computer Society Press.
12: Marcello M. Bonsangue, Franck van Breugel, and J. J. M. M. Rutten. Generalized ultrametric spaces: completion, topology, and powerdomains via the yoneda embedding. Technical Report CS-R9560, CWI - Centrum voor Wiskunde en Informatica, September 1995.
13: Geoffrey L. Burn. Abstract Interpretation and the Parallel Evaluation of Functional Languages. Ph.D. Thesis, Imperial College, London, 1987.
14: Patrick Cousot. Méthodes itératives de construction et d'approximation de point fixes d'opérateurs monotone sur un treilis, analyse sémantique des programmes. Thése de Doctoratés Science Mathématiques, University of Grenoble, France, 1978.
15: Patrick Cousot. An indo-french school on abstract interpretation. Overview, 1996.
16: Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixedpoints. In Proceedings of 4th POPL, pages 238-252, London - New York, January 1977. ACM.
17: Patrick Cousot and Radhia Cousot. Automatic synthesis of optimal invariant assertions mathematical foundation. In Symposium on Artificial Intelligence and Programming Languages, volume 12(8) of ACM SIGPLAN Notices, pages 1-12, August 1977.
18: Patrick Cousot and Radhia Cousot. Systematic Design of Program Analysis Frameworks. In 6th POPL, San Antonio, Texas, pages 269-282, January 1979.
19: Luca de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Stanford, December 1997.
20: J.I. den Hartog. Comparative semantics for a process language with probabilistic choice and non-determinism. Technical Report IR-445, Vrije Universiteit, Amsterdam, 1998.
21: A. Di Pierro and H. Wiklicky. A Banach Space Based Semantics for Probabilistic Concurrent Constraint Programming. In Xuemin Lin, editor, Proc. 4th Australasian Theory Symposium, CATS'98, volume 20 - 3 of Australian Computer Science Communications, pages 245-259, Singapore, 1998. Springer-Verlag.
22: A. Di Pierro and H. Wiklicky. A Markov Model for Probabilistic Concurrent Constraint Programming. In M. Falaschi J. L. Freire-Nistral and M. Vilares-Ferro, editors, Proc. of APPIA-GULP-PRODE'98, Joint Conference on Declarative Programming, pages 15-27, La Corunna, Spain, 1998.
23: A. Di Pierro and H. Wiklicky. An Operational Semantics for Probabilistic Concurrent Constraint Programming. In Y. Choo P. Iyer and D. Schmidt, editors, Proc. ICCL'98 - International Conference on Computer Languages, IEEE Computer Society and ACM SIGPLAN, pages 174-183, Chicago, 1998. IEEE Computer Society Press.
24: A. Di Pierro and H. Wiklicky. Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model. In Gruska Brim and Zlatuska, editors, Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science, MFCS'98, Lecture Notes in Computer Science, Brno, Czech Republic, 1998. Springer-Verlag.
25: Jean Dieudonné. History of Functional Analysis, volume 49 of North-Holland Mathematical Studies. North-Holland, Amsterdam - New York - Oxford, 1981.
26: M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Compositional Analysis for Concurrent Constraint Programming. In Proceedings, Eight Annual IEEE Symposium on Logic in Computer Science, pages 210-221. IEEE Computer Society Press, 1993.
27: Paul A. Fuhrmann. A Polynomial Approach to Linear Algebra. Universitext. Springer Verlag, New York - Berlin - Heidelberg, 1996.
28: Dani Gamerman. Markov Chain Monte Carlo: Stochastic Simulation for Bayesian Inference. Chapman and Hall, London, 1997.
29: Roberto Giacobazzi. Semantic Aspects of Logic Program Analysis. PhD thesis, Dipartimento di Informatica, Università di Pisa, March 1993.
30: David E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, Massachusetts, 1989.
31: C. Hankin and P. Malacaria. Program analysis games. to appear in ACM Computing Surveys, 1998.
32: Chris Hankin. Program analysis tools. to appear in Software Tools for Technology Transfer, 1998.
33: M. Hecht. Flow analysis of computer programs. North-Holland, 1977.
34: Nevin Heintze and John G. Riecke. The SLam calculus: Programming with secrecy and integrity. In 25th ACM Symposium on Principles of Programming Languages (POPL '98), pages 365-377, San Diego, California, January 1998. SIGACT and SIGPLAN, Association for Computing Machinery.
35: Matthew Hennessy and James Riely. A typed language for distributed mobile processes. In 25th ACM Symposium on Principles of Programming Languages (POPL '98), pages 378-390, San Diego, California, January 1998. SIGACT and SIGPLAN, Association for Computing Machinery.
36: Dorit S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1997.
37: Manfred Jaeger and Emil Weydert. Formal systems for probabilistic inference. Technical report, 10th European Summer School in Logic Language and Information, Saarbrücken, Germany, August 1998.
38: Claire Jones. Probabilistic Non-Determinism. PhD thesis, University of Edinburgh, Edingburgh, 1993.
39: Neil D. Jones and Alan Mycroft. Data Flow Analysis of Applicative Programs using Minimal Function Graphs. In 13th POPL, pages 296-306, St. Petersburg, Florida, January 1986.
40: Neil D. Jones and Flemming Nielson. Abstract interpretation: A semantic-based tool for program analysis. In S.Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Semantic Modelling, volume 4 of Handbook of Logic in Computer Science, pages 527-636. Clarendon Press, Oxford, 1995.
41: Richard V. Kadison and John R. Ringrose. Fundamentals of the Theory of Operator Algebras, volume I - Elementary Theory of Pure and Applied Mathematics. Academic Press, New York - London, 1983.
42: Richard V. Kadison and John R. Ringrose. Fundamentals of the Theory of Operator Algebras, volume II - Advanced Theory of Pure and Applied Mathematics. Academic Press, Orlando - London, 1986.
43: Dexter Kozen. Semantics for probabilistic programs. Journal of Computer and System Sciences, 22:328-350, 1981.
44: F. William Lawvere. Metric spaces, generalised logic, and closed categories. In Rend. del Sem. Mat. e Fis. di Milano, volume 43, 1973.
45: K. Rustan M. Leino and Rajeev Joshi. A semantic approach to secure information flow. SRC Technical Note 1997-032, Digital Systems Research Center, Palo Alto CA, December 1997.
46: Patrick D. Lincoln, John C. Mitchell, and Andre Scedrov. Stochastic interaction and Linear Logic. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, volume 222 of London Mathematical Society Lecture Note Series, pages 147-166. Cambridge University Press, Cambridge, 1995.
47: P.D. Lincoln, J.C. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In ACM Computer and Communication Security (CCS-5), 1998.
48: Bev Littlewood and Lorenzo Stringini. Validation of ultrahigh dependability for software-based systems. Communications of the ACM, 36(11):69-80, November 1993.
49: P. Malacaria and C. Hankin. Generalised flowcharts and games. In Proceedings of ICALP'98, volume 1443 of Lecture Notes in Computer Science. Springer Verlag, 1998.
50: P. Malacaria and C. Hankin. A new approach to control flow analysis. In Proceedings of CC'98, volume 1383 of Lecture Notes in Computer Science, pages 95-108. Springer Verlag, 1998.
51: Carroll Morgan, Annabelle McIver, Karen Seidel, and J.W. Sanders. Probabilistic predicate transformers. Technical Report PRG-TR-4-95, Programming Research Group, Oxford University Computing Laboratory, 1995.
52: Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, England, 1995.
53: Steven S. Muchnick and Neil D. Jones, editors. Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981.
54: Alan Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. Ph.D. Thesis, University of Edinburgh, December 1981.
55: P. Naur. Checking of Operand Types in Algol Compilers. BIT, 5:151-163, 1965.
56: J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, California, 1988.
57: Viktor V. Prasolov. Problems and Theorems in Linear Algebra, volume 134 of Translation of Mathematical Monographs. American Mathematical Society, Providence, Rhode Island, 1994.
58: John C. Reynolds. Automatic Computation of Data Set Definitions. In IFIP'68, pages 456-461, 1969.
59: Walter Rudin. Functional Analysis. International Series in Pure and Applied Mathematics. McGraw-Hill, New York - Singapore, second edition, 1991.
60: N. Saheb-Djahromi. CPO's of measures for nondeterminism. Theoretical Computer Science, 12:19-37, 1980.
61: Vijay A. Saraswat and Martin Rinard. Concurrent constraint programming. In Proceedings of POPL, pages 232-245. ACM, 1990.
62: Vijay A. Saraswat, Martin Rinard, and Prakash Panangaden. Semantics foundations of concurrent constraint programming. In Proceedings of POPL, pages 333-353. ACM, 1991.
63: M. Sintzoff. Calculating properties of programs by valuations on specific models. In ACM Conference on Proving Assertions About Programs, volume 7(1) of ACM SIGPLAN Not., pages 203-207, January 1972.
64: J. Vitter, editor. 13th ACM Symposium on Theory of Computation, Dallas, Texas, May 1998. ACM SIGACT.
65: Dennis Volpano and Geoffrey Smith. Confinement properties for programming languages. SIGACT News, 29(3):33-42, September 1998.
66: Kim Ritter Wagner. Solving Recursive Domain Equations with Enriched Categories. Technical Report 94-62, RISC-Linz, Johannes Kepler University, Linz, Austria, 1994. Published as Ph.D. thesis at Carnegie Mellon University.
67: Kôsaku Yosida. Functional Analysis. Springer Verlag, Berlin - Heidelberg - New York, sixth edition, 1980.

Up: Probabilistic Abstract Interpretation Previous: Relevance to Beneficiaries