Probabilistic non-determinism
- Author:
- Claire Jones
Abstract
No abstract available.
Cited By
- Lago U and Hoshino N The geometry of Bayesian programming Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
Wang P, Fu H, Goharshady A, Chatterjee K, Qin X and Shi W Cost analysis of nondeterministic probabilistic programs Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, (204-220)- Tassarotti J and Harper R (2019). A separation logic for concurrent randomized programs, Proceedings of the ACM on Programming Languages, 3:POPL, (1-30), Online publication date: 2-Jan-2019.
- Wang D, Hoffmann J and Reps T (2018). PMAF: an algebraic framework for static analysis of probabilistic programs, ACM SIGPLAN Notices, 53:4, (513-528), Online publication date: 2-Dec-2018.
- Wang D, Hoffmann J and Reps T PMAF: an algebraic framework for static analysis of probabilistic programs Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, (513-528)
- Gburek D and Baier C Bisimulations, logics, and trace distributions for stochastic systems with rewards Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week), (31-40)
- Mislove M (2017). Semantics column, ACM SIGLOG News, 4:4, (31-32), Online publication date: 3-Nov-2017.
- Kaminski B and Katoen J A weakest pre-expectation semantics for mixed-sign expectations Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Lago U, Gavazzo F and Levy P Effectful applicative bisimilarity Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, (1-12)
- Smolka S, Kumar P, Foster N, Kozen D and Silva A (2017). Cantor meets Scott: semantic foundations for probabilistic networks, ACM SIGPLAN Notices, 52:1, (557-571), Online publication date: 11-May-2017.
- Smolka S, Kumar P, Foster N, Kozen D and Silva A Cantor meets Scott: semantic foundations for probabilistic networks Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, (557-571)
- Borgström J, Dal Lago U, Gordon A and Szymczak M (2016). A lambda-calculus foundation for universal probabilistic programming, ACM SIGPLAN Notices, 51:9, (33-46), Online publication date: 5-Dec-2016.
- Borgström J, Dal Lago U, Gordon A and Szymczak M A lambda-calculus foundation for universal probabilistic programming Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, (33-46)
- Hino W, Kobayashi H, Hasuo I and Jacobs B Healthiness from Duality Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (682-691)
- Olmedo F, Kaminski B, Katoen J and Matheja C Reasoning about Recursive Probabilistic Programs Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (672-681)
- Mardare R, Panangaden P and Plotkin G Quantitative Algebraic Reasoning Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, (700-709)
- Foster N, Kozen D, Mamouras K, Reitblatt M and Silva A Probabilistic NetKAT Proceedings of the 25th European Symposium on Programming Languages and Systems - Volume 9632, (282-309)
- McIver A, Morgan C and Rabehaja T Abstract Hidden Markov Models Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), (597-608)
- Ferrer Fioriti L and Hermanns H (2015). Probabilistic Termination, ACM SIGPLAN Notices, 50:1, (489-501), Online publication date: 11-May-2015.
- Ferrer Fioriti L and Hermanns H Probabilistic Termination Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, (489-501)
- Barthe G, Köpf B, Olmedo F and Zanella-Béguelin S (2013). Probabilistic Relational Reasoning for Differential Privacy, ACM Transactions on Programming Languages and Systems, 35:3, (1-49), Online publication date: 1-Nov-2013.
- Doberkat E and Schubert C (2011). Coalgebraic logic over general measurable spaces ??? a survey, Mathematical Structures in Computer Science, 21:2, (175-234), Online publication date: 1-Apr-2011.
- Toronto N and McCarthy J From Bayesian notation to pure racket via discrete measure-theoretic probability in λZFC Proceedings of the 22nd international conference on Implementation and application of functional languages, (89-104)
- Escardó M (2009). Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting, Electronic Notes in Theoretical Computer Science (ENTCS), 249, (219-242), Online publication date: 1-Aug-2009.
- Keimel K and Plotkin G (2009). Predicate transformers for extended probability and non-determinism, Mathematical Structures in Computer Science, 19:3, (501-539), Online publication date: 1-Jun-2009.
- Audebaud P and Paulin-Mohring C (2009). Proofs of randomized algorithms in Coq, Science of Computer Programming, 74:8, (568-589), Online publication date: 1-Jun-2009.
- Mogensen T Troll, a language for specifying dice-rolls Proceedings of the 2009 ACM symposium on Applied Computing, (1910-1915)
- Tix R, Keimel K and Plotkin G (2009). Semantic Domains for Combining Probability and Non-Determinism, Electronic Notes in Theoretical Computer Science (ENTCS), 222, (3-99), Online publication date: 1-Feb-2009.
- Ndukwu U and Sanders J Reasoning about a distributed probabilistic system Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94, (37-44)
- Park S, Pfenning F and Thrun S (2008). A probabilistic language based on sampling functions, ACM Transactions on Programming Languages and Systems, 31:1, (1-46), Online publication date: 1-Dec-2008.
- Goubault-Larrecq J Simulation hemi-metrics between infinite-state stochastic games Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures, (50-65)
- Goubault-Larrecq J Continuous previsions Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic, (542-557)
- Mislove M (2007). Discrete random variables over domains, Theoretical Computer Science, 380:1-2, (181-198), Online publication date: 20-Jul-2007.
- Goubault-Larrecq J Continuous capacities on continuous state spaces Proceedings of the 34th international conference on Automata, Languages and Programming, (764-776)
- Chadha R, Cruz-Filipe L, Mateus P and Sernadas A (2007). Reasoning about probabilistic sequential programs, Theoretical Computer Science, 379:1-2, (142-165), Online publication date: 1-Jul-2007.
- Beaulieu G (2007). Probabilistic Completion of Nondeterministic Models, Electronic Notes in Theoretical Computer Science (ENTCS), 173, (67-84), Online publication date: 1-Apr-2007.
- Battenfeld I, Schröder M and Simpson A (2007). A Convenient Category of Domains, Electronic Notes in Theoretical Computer Science (ENTCS), 172, (69-99), Online publication date: 1-Apr-2007.
- Größer M, Norman G, Baier C, Ciesinski F, Kwiatkowska M and Parker D On reduction criteria for probabilistic reward models Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science, (309-320)
- Schröder M and Simpson A (2006). Representing probability measures using probabilistic processes, Journal of Complexity, 22:6, (768-782), Online publication date: 1-Dec-2006.
- Doberkat E (2006). Eilenberg--Moore algebras for stochastic relations, Information and Computation, 204:12, (1756-1781), Online publication date: 1-Dec-2006.
- Chadha R, Mateus P and Sernadas A Reasoning about states of probabilistic sequential programs Proceedings of the 20th international conference on Computer Science Logic, (240-255)
- Hyland M, Plotkin G and Power J (2006). Combining effects, Theoretical Computer Science, 357:1, (70-99), Online publication date: 25-Jul-2006.
- Audebaud P and Paulin-Mohring C Proofs of randomized algorithms in CoQ Proceedings of the 8th international conference on Mathematics of Program Construction, (49-68)
- Cohen B, Escardo M and Keimel K The extended probabilistic powerdomain monad over stably compact spaces Proceedings of the Third international conference on Theory and Applications of Models of Computation, (566-575)
- Schröder M and Simpson A (2006). Probabilistic Observations and Valuations, Electronic Notes in Theoretical Computer Science (ENTCS), 155, (605-615), Online publication date: 1-May-2006.
- Keimel K (2006). Topological Cones, Electronic Notes in Theoretical Computer Science (ENTCS), 155, (423-443), Online publication date: 1-May-2006.
- Mislove M Discrete random variables over domains Proceedings of the 32nd international conference on Automata, Languages and Programming, (1006-1017)
- Bournez O and Garnier F Proving positive almost-sure termination Proceedings of the 16th international conference on Term Rewriting and Applications, (323-337)
- Goubault-Larrecq J (2005). Extensions of valuations, Mathematical Structures in Computer Science, 15:2, (271-297), Online publication date: 1-Apr-2005.
- Tix R, Keimel K and Plotkin G (2005). RETRACTED, Electronic Notes in Theoretical Computer Science (ENTCS), 129, (1-104), Online publication date: 1-Apr-2005.
- van Breugel F, Mislove M, Ouaknine J and Worrell J (2005). Domain theory, testing and simulation for labelled Markov processes, Theoretical Computer Science, 333:1-2, (171-197), Online publication date: 1-Mar-2005.
- Park S, Pfenning F and Thrun S (2005). A probabilistic language based upon sampling functions, ACM SIGPLAN Notices, 40:1, (171-182), Online publication date: 12-Jan-2005.
- Park S, Pfenning F and Thrun S A probabilistic language based upon sampling functions Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (171-182)
- Lawson J (2004). Domains, integration and ‘positive analysis’, Mathematical Structures in Computer Science, 14:6, (815-832), Online publication date: 1-Dec-2004.
- Keimel K (2004). The Probabilistic Powerdomain for Stably Compact Spaces via Compact Ordered Spaces, Electronic Notes in Theoretical Computer Science (ENTCS), 87, (225-238), Online publication date: 1-Nov-2004.
- Jung A (2004). Stably Compact Spaces and the Probabilistic Powerspace construction, Electronic Notes in Theoretical Computer Science (ENTCS), 87, (5-20), Online publication date: 1-Nov-2004.
- Bartels F, Sokolova A and de Vink E (2004). A hierarchy of probabilistic system types, Theoretical Computer Science, 327:1-2, (3-22), Online publication date: 25-Oct-2004.
- Morgan C Of probabilistic wp and CSP - and compositionality Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years, (220-241)
- Martin K, Mislove M and Worrell J (2004). Measuring the probabilistic powerdomain, Theoretical Computer Science, 312:1, (99-119), Online publication date: 26-Jan-2004.
- PROBMELA Proceedings of the Second ACM/IEEE International Conference on Formal Methods and Models for Co-Design, (57-66)
- Desharnais J, Gupta V, Jagadeesan R and Panangaden P (2003). Approximating labelled Markov processes, Information and Computation, 184:1, (160-200), Online publication date: 10-Jul-2003.
- van Breugel F, Mislove M, Ouaknine J and Worrell J An intrinsic characterization of approximate probabilistic bisimilarity Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software, (200-215)
- Park S (2003). A calculus for probabilistic languages, ACM SIGPLAN Notices, 38:3, (38-49), Online publication date: 18-Mar-2003.
- Park S A calculus for probabilistic languages Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation, (38-49)
- Ramsey N and Pfeffer A Stochastic lambda calculus and monads of probability distributions Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (154-165)
- Ramsey N and Pfeffer A (2002). Stochastic lambda calculus and monads of probability distributions, ACM SIGPLAN Notices, 37:1, (154-165), Online publication date: 1-Jan-2002.
- McIver A and Morgan C (2001). Partial correctness for probabilistic demonic programs, Theoretical Computer Science, 266:1-2, (513-541), Online publication date: 6-Sep-2001.
- Desharnais J, Panangaden P, Jagadeesan R and Gupta V Approximating Labeled Markov Processes Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
- Edalat A The Scott Topology Induces the Weak Topology Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Index Terms
- Probabilistic non-determinism
Recommendations
Ownership Concentration and Firm Value: New Evidence from Owner Stakes in IPOs
We study the relationship between ownership concentration and firm value using hand-collected data on the stakes of owner–managers before and after initial public offerings (IPOs). We instrument for the reduction in stake using market returns shortly ...
A universal characterization of the double powerlocale
Logic, semantics and theory of programmingThe double powerlocale P(X) (found by composing, in either order, the upper and lower powerlocale constructions PU and PL) is shown to be isomolphic in [Locop, Set] to the double exponential SSX where S is the Sierpinski locale. Further PU(X) and PL(X) ...
Do Underwriters Compete in IPO Pricing?
We propose and implement a direct test of the hypothesis of oligopolistic competition in the U.S. underwriting market against the alternative of implicit collusion among underwriters. We construct a simple model of interaction between heterogeneous ...