Universit at Augsburg

[1]  Rutger M. Dijkstra.  Computation calculus bridging a formalization gap , 2000, Sci. Comput. Program..

[2]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[3]  Burghard von Karger.  Temporal algebra , 1998 .

[4]  Dexter Kozen.  A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[5]  Georg Struth,et al.  Automated Reasoning in Kleene Algebra , 2007, CADE.

[6]  Zoltán Ésik,et al.  Equational axioms for regular sets , 1993, Mathematical Structures in Computer Science.

[7]  T. Henzinger.  The theory of hybrid automata , 1996, LICS 1996.

[8]  D. B. Benson,et al.  The inverse semigroup of a sum-ordered semiring , 1985 .

[9]  Zohar Manna,et al.  The optimal fixedpoint of recursive programs , 1975, STOC.

[10]  Calvin C. Elgot.  The Common Algebraic Structure of Exit-Automata and Machines , 1970 .

[11]  Donald M. Kaplan,et al.  Regular Expressions and the Equivalence of Programs , 1969, J. Comput. Syst. Sci..

[12]  Georg Struth,et al.  Kleene algebra with domain , 2003, TOCL.

[13]  Jan A. Bergstra,et al.  Process algebra for hybrid systems , 2004, Theor. Comput. Sci..

[14]  C. A. R. Hoare,et al.  Sequential Calculus , 1995, Inf. Process. Lett..

[15]  Barbara G. Ryder,et al.  Properties of data flow frameworks , 1990, Acta Informatica.

[16]  S. Lane.  Categories for the Working Mathematician , 1971 .

[17]  Jan A. Bergstra,et al.  Regular extensions of iterative algebras and metric interpretations , 1980, Fundam. Informaticae.

[18]  George Markowsky,et al.  Bases for chain-complete posets , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[19]  Katsunori Nakamura,et al.  On Transfinite Hybrid Automata , 2005, HSCC.

[20]  K. I. Rosenthal.  Quantales and their applications , 1990 .

[21]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[22]  Jerzy Tiuryn.  Unique Fixed Points Vs. Least Fixed Points , 1980, Theor. Comput. Sci..

[23]  Bernhard Möller,et al.  Idel Stream Algebra , 1998, Prospects for Hardware Foundations.

[24]  Georg Struth,et al.  Wp is wip , 2006 .

[25]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[26]  Johan J. Lukkien.  An Operational Semantics for the Guarded Command Language , 1992, MPC.

[27]  Peter Höfner,et al.  Algebraic calculi for hybrid systems , 2009 .

[28]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[29]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[30]  Georg Struth,et al.  Termination in Modal Kleene Algebra , 2004, IFIP TCS.

[31]  Zhenyu Qian,et al.  Standard fixpoint iteration for Java bytecode verification , 2000, TOPL.

[32]  Jan A. Bergstra,et al.  Process Algebra with Iteration and Nesting , 1994, Comput. J..

[33]  D. Kozen.  Automata on Guarded Strings and Applications , 2001 .

[34]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[35]  J. Conway.  Regular algebra and finite machines , 1971 .

[36]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[37]  André Platzer,et al.  KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description) , 2008, IJCAR.

[38]  Jens Palsberg,et al.  A Denotational Semantics of Inheritance and its Correctness , 1989, OOPSLA.

[39]  Peter W. O'Hearn,et al.  Graphical models of separation logic , 2009, Inf. Process. Lett..

[40]  Peter W. O'Hearn,et al.  Resources, concurrency, and local reasoning , 2007 .

[41]  A.D. Ames,et al.  Sufficient conditions for the existence of zeno behavior in a class of nonlinear hybrid systems via constant approximations , 2005, 2007 46th IEEE Conference on Decision and Control.

[42]  Peter Höfner,et al.  Automated Reasoning for Hybrid Systems - Two Case Studies - , 2008, RelMiCS.

[43]  Manfred Broy,et al.  Specification and development of interactive systems: focus on streams, interfaces, and refinement , 2001 .

[44]  Georg Struth,et al.  Modal Kleene Algebra and Partial Correctness , 2004, AMAST.

[45]  Yifeng Chen.  A fixpoint theory for non-monotonic parallelism , 2003 .

[46]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[47]  Zohar Manna,et al.  The Theoretical Aspects of the Optimal Fixed Point , 1976, SIAM J. Comput..

[48]  Maurice Nivat,et al.  The metric space of infinite trees. Algebraic and topological properties , 1980, Fundam. Informaticae.

[49]  M. Egerstedt,et al.  On the regularization of Zeno hybrid automata , 1999 .

[50]  Jan A. Bergstra,et al.  Process Algebra with Propositional Signals , 1994, Theor. Comput. Sci..

[51]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[52]  Jayadev Misra.  Axioms for memory access in asynchronous hardware systems , 1986, TOPL.

[53]  Bernhard Möller,et al.  Kleene getting lazy , 2007, Sci. Comput. Program..

[54]  Ernie Cohen,et al.  Separation and Reduction , 2000, MPC.

[55]  André Arnold,et al.  Finite transition systems , 1994 .

[56]  Dexter Kozen,et al.  Kleene algebra with tests , 1997, TOPL.