Convolution as a Unifying Concept
暂无分享,去创建一个
[1] Georg Struth,et al. Convolution, Separation and Concurrency , 2014, ArXiv.
[2] John C. Reynolds,et al. Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.
[3] Lawrence Charles Paulson,et al. Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .
[4] Jay L. Gischer,et al. The Equational Theory of Pomsets , 1988, Theor. Comput. Sci..
[5] Ralph-Johan Back,et al. Trace Refinement of Action Systems , 1994, CONCUR.
[6] G. Rota. On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .
[7] M. Droste,et al. Handbook of Weighted Automata , 2009 .
[8] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[9] Peter W. O'Hearn,et al. The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.
[10] Ben C. Moszkowski,et al. A complete axiomatization of interval temporal logic with infinite time , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[11] Peter W. O'Hearn,et al. Resources, Concurrency and Local Reasoning , 2004, CONCUR.
[12] Charles Antony Richard Hoare. Towards a theory of parallel programming , 2002 .
[13] C. A. R. Hoare,et al. Parallel Programming: An Axiomatic Approach , 1975, Comput. Lang..
[14] John Derrick,et al. Deriving real-time action systems with multiple time bands using algebraic reasoning , 2014, Sci. Comput. Program..
[15] Samson Abramsky,et al. Domain theory , 1995, LICS 1995.
[16] J. Grabowski,et al. On partial languages , 1981, Fundam. Informaticae.
[17] A. Tarski,et al. Boolean Algebras with Operators , 1952 .
[18] Robert Goldblatt,et al. Varieties of Complex Algebras , 1989, Ann. Pure Appl. Log..
[19] B. Day. On closed categories of functors , 1970 .
[20] J. Conway. Regular algebra and finite machines , 1971 .
[21] A. Tarski,et al. Boolean Algebras with Operators. Part I , 1951 .
[22] Alasdair Urquhart,et al. Semantics for relevant logics , 1972, Journal of Symbolic Logic.
[23] Richard Routley,et al. Classical relevant logics II , 1973 .
[24] Gerard Allwein,et al. Kripke models for linear logic , 1993, Journal of Symbolic Logic.
[25] Georg Struth,et al. On Locality and the Exchange Law for Concurrent Processes , 2011, CONCUR.
[26] Bernhard Möller,et al. An algebra of hybrid systems , 2009, J. Log. Algebraic Methods Program..
[27] Georg Struth,et al. A Program Construction and Verification Tool for Separation Logic , 2015, MPC.
[28] Peter W. O'Hearn,et al. Local Action and Abstract Separation Logic , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).
[29] Peter W. O'Hearn,et al. BI as an assertion language for mutable data structures , 2001, POPL '01.
[30] J. Berstel,et al. Les séries rationnelles et leurs langages , 1984 .
[31] G. Rota. On the Foundations of Combinatorial Theory , 2009 .
[32] A. Blass,et al. Partition Theorems for Spaces of Variable Words , 1994 .
[33] Rozália Madarász,et al. Power structures , 2018, Dental Abstracts.
[34] Georg Struth,et al. Hybrid process algebra , 2005, J. Log. Algebraic Methods Program..
[35] Ralph-Johan Back,et al. Refinement Calculus: A Systematic Introduction , 1998 .
[36] Georg Struth,et al. Quantales and Temporal Logics , 2006, AMAST.
[37] G. M. Kelly,et al. BASIC CONCEPTS OF ENRICHED CATEGORY THEORY , 2022, Elements of ∞-Category Theory.
[38] Hongseok Yang,et al. Views: compositional reasoning for concurrent programs , 2013, POPL.
[39] Thomas A. Henzinger,et al. The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[40] Zhou Chaochen,et al. Duration Calculus: A Formal Approach to Real-Time Systems , 2004 .
[41] Andrzej Tarlecki,et al. A Language of Specified Programs , 1985, Sci. Comput. Program..
[42] Simon Ambler. First order linear logic in symmetric monoidal closed categories , 1991 .